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

Method update

intervaltree/intervaltree.py:346–354  ·  view source on GitHub ↗

Given an iterable of intervals, add them to the tree. Completes in O(m*log(n+m), where m = number of intervals to add.

(self, intervals)

Source from the content-addressed store, hash-verified

344 appendi = addi
345
346 def update(self, intervals):
347 """
348 Given an iterable of intervals, add them to the tree.
349
350 Completes in O(m*log(n+m), where m = number of intervals to
351 add.
352 """
353 for iv in intervals:
354 self.add(iv)
355
356 def remove(self, interval):
357 """

Callers 13

test_insertFunction · 0.95
test_duplicate_insertFunction · 0.95
test_updateFunction · 0.95
test_invalid_updateFunction · 0.95
test_unionFunction · 0.95
chopMethod · 0.95
sliceMethod · 0.95
__init__Method · 0.80
envelopMethod · 0.80
overlapMethod · 0.80
srotateMethod · 0.80

Calls 1

addMethod · 0.95

Tested by 5

test_insertFunction · 0.76
test_duplicate_insertFunction · 0.76
test_updateFunction · 0.76
test_invalid_updateFunction · 0.76
test_unionFunction · 0.76