Queries the interval tree for all elements overlapping a given interval. This runs in `O(log n + m)`.
(&self, range: Range<K>)
| 146 | /// |
| 147 | /// This runs in `O(log n + m)`. |
| 148 | pub fn query(&self, range: Range<K>) -> QueryIter<K, V> { |
| 149 | QueryIter { |
| 150 | todo: self.todo(), |
| 151 | tree: self, |
| 152 | query: Query::Range(range), |
| 153 | } |
| 154 | } |
| 155 | |
| 156 | /// Queries the interval tree for all elements containing a given point. |
| 157 | /// |