Removes all intervals completely enveloped in the given range. Completes in O((r+m)*log n) time, where: * n = size of the tree * m = number of matches * r = size of the search range
(self, begin, end)
| 481 | self.remove(iv) |
| 482 | |
| 483 | def remove_envelop(self, begin, end): |
| 484 | """ |
| 485 | Removes all intervals completely enveloped in the given range. |
| 486 | |
| 487 | Completes in O((r+m)*log n) time, where: |
| 488 | * n = size of the tree |
| 489 | * m = number of matches |
| 490 | * r = size of the search range |
| 491 | """ |
| 492 | hitlist = self.envelop(begin, end) |
| 493 | for iv in hitlist: |
| 494 | self.remove(iv) |
| 495 | |
| 496 | def chop(self, begin, end, datafunc=None): |
| 497 | """ |