t = SortedSet([(1, 3), (2, 4), (-2, 9)], updator=OverlappingIntervalsUpdator)
print(t.overlap_point(-5))
print(t.overlap_point(5))
Optimized approach to finding which pairs of numbers another number falls between?