Queries the interval tree for all elements containing a given point. This runs in `O(log n + m)`.
(&self, point: K)
| 157 | /// |
| 158 | /// This runs in `O(log n + m)`. |
| 159 | pub fn query_point(&self, point: K) -> QueryIter<K, V> { |
| 160 | QueryIter { |
| 161 | todo: self.todo(), |
| 162 | tree: self, |
| 163 | query: Query::Point(point), |
| 164 | } |
| 165 | } |
| 166 | } |
| 167 | |
| 168 | #[derive(Clone)] |
no test coverage detected