protected NavigableMap<N, Entry<S, V>> subMap(N min, N max) {
			Entry<N, Entry<S, V>> adjEnt = spanTree.floorEntry(min);
			if (adjEnt != null && adjEnt.getValue().getKey().contains(min)) {
				min = adjEnt.getKey();
			}
			return spanTree.subMap(min, true, max, true);
		}
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