Skip to content

A lightweight WebAssembly runtime that is fast, secure, and standards-compliant

Implement `DoubleEndedIterator` for `TryBTreeMap`'s range iterator (#12839)

Nick Fitzgerald3d36f0bd9850
diff --git a/crates/environ/src/collections/btree_map.rs b/crates/environ/src/collections/btree_map.rs
index a96c78c1b6..16c9c246b9 100644
--- a/crates/environ/src/collections/btree_map.rs
+++ b/crates/environ/src/collections/btree_map.rs
@@ -409,6 +409,16 @@ where
}
}
+impl<'a, K, V> DoubleEndedIterator for BTreeMapRange<'a, K, V>
+where
+ K: Copy + Ord,
+{
+ fn next_back(&mut self) -> Option<Self::Item> {
+ let (key, id) = self.inner.next_back()?;
+ Some((key, &self.values[id]))
+ }
+}
+
/// A range iterator of `(K, &'a V)` items returned by [`TryBTreeMap::range`].
pub struct BTreeMapRangeMut<'a, K, V>
where