public boolean intersects(int min, int max) {
		Range key = new Range(min, min);
		SortedSet<Range> head = set.headSet(key);
		if (!head.isEmpty()) {
			Range last = head.last();
			if (last.max >= min) {
				return true;
			}
		}
		SortedSet<Range> tail = set.tailSet(key);
		if (!tail.isEmpty()) {
			Range next = tail.first();
			if (next.min <= max) {
				return true;
			}
		}
		return false;
	}
Returns true if the range from min to max intersects (overlaps) any ranges in this sorted
range list.
@param min the range minimum value.
@param max the range maximum value.
@return true if the range from min to max intersects (overlaps) any ranges in this sorted
range list.
Ghidra/Framework/Generic/src/main/java/ghidra/util/datastruct/SortedRangeList.java