intersection?

[chananshgong]

t1 = IntervalTree([Interval(0, 10))
t2 = IntervalTree([Interval(5, 15)])
t1&t2
Out[]: IntervalTree()

would not you expect to get IntervalTree(Interval(5,10)) ?

0:10 ----------
5:15      ------------
*         -----

[escalonn]

That's a different interpretation of intersection. The set operations implemented in this library on interval trees treat them simply as sets of interval objects, and those interval objects either compare equal or do not compare equal.

So if there are three unequal intervals, a, b, and c (no matter what their bounds are or if they overlap), then IntervalTree([b, c]) & IntervalTree([b, a]) == IntervalTree([b])

[chaimleib]

Part of the reason I didn't implement range intersection is that it was ambiguous what should happen if intervals within one or both of the input trees overlapped each other:

• Should the intervals be intersected first?
• If so, should those initial intersections within the input trees merge the data fields differently from the intersections between the input trees?
• Should the product tree mark each intersection of the N intervals in tree A with the M intervals of tree B to produce up to N*M result intervals in the result tree?

Rather than impose my idea of what to do in these cases, I decided to leave this up to users to implement.