Returns a fast iterator over all key-value pairs using unsafe arena access. This provides better performance by skipping bounds checks. # Safety This is safe to use as long as the tree structure is valid and no concurrent modifications occur during iteration.
(&self)
| 65 | /// This is safe to use as long as the tree structure is valid and no concurrent |
| 66 | /// modifications occur during iteration. |
| 67 | pub fn items_fast(&self) -> FastItemIterator<'_, K, V> { |
| 68 | FastItemIterator::new(self) |
| 69 | } |
| 70 | |
| 71 | /// Returns an iterator over all keys in sorted order. |
| 72 | pub fn keys(&self) -> KeyIterator<'_, K, V> { |
no outgoing calls