MCPcopy Create free account
hub / github.com/chaimleib/intervaltree / union

Method union

intervaltree/intervaltree.py:419–424  ·  view source on GitHub ↗

Returns a new tree, comprising all intervals from self and other.

(self, other)

Source from the content-addressed store, hash-verified

417 self.discard(iv)
418
419 def union(self, other):
420 """
421 Returns a new tree, comprising all intervals from self
422 and other.
423 """
424 return IntervalTree(set(self).union(other))
425
426 def intersection(self, other):
427 """

Callers 6

test_unionFunction · 0.95
test_invalid_unionFunction · 0.95
test_intersectionFunction · 0.80
symmetric_differenceMethod · 0.80
verifyMethod · 0.80

Calls 1

IntervalTreeClass · 0.85

Tested by 4

test_unionFunction · 0.76
test_invalid_unionFunction · 0.76
test_intersectionFunction · 0.64