@Override
		public boolean intersects(S s) {
			Entry<N, Entry<S, V>> entry = spanTree.floorEntry(s.max());
			return entry != null && entry.getValue().getKey().intersects(s);
		}
Get the portion of the interval tree whose entries intersect the given span

@param min the lower endpoint of the span
@param max the upper endpoint of the span
@return the sub map
Ghidra/Framework/Emulation/src/main/java/generic/Span.java