Returns the set of all intervals that contain p. Completes in O(m + log n) time, where: * n = size of the tree * m = number of matches :rtype: set of Interval
(self, p)
| 862 | return 0 == len(self) |
| 863 | |
| 864 | def at(self, p): |
| 865 | """ |
| 866 | Returns the set of all intervals that contain p. |
| 867 | |
| 868 | Completes in O(m + log n) time, where: |
| 869 | * n = size of the tree |
| 870 | * m = number of matches |
| 871 | :rtype: set of Interval |
| 872 | """ |
| 873 | root = self.top_node |
| 874 | if not root: |
| 875 | return set() |
| 876 | return root.search_point(p, set()) |
| 877 | |
| 878 | def envelop(self, begin, end=None): |
| 879 | """ |