(self, min_val: float, max_val: float, id: int)
| 129 | self.intervals: List[Interval] = [] # Sorted by min_val |
| 130 | |
| 131 | def insert(self, min_val: float, max_val: float, id: int): |
| 132 | interval = Interval(min_val, max_val, id) |
| 133 | bisect.insort(self.intervals, interval) |
| 134 | |
| 135 | def find_containing(self, point: float) -> Set[int]: |
| 136 | """Find all intervals containing the point.""" |
no test coverage detected