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)
| 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 | """ |