Fix non-empty rbtree infinite iteration, bump version to 0.10.7 (and …

…no, I won't test it locally)

Cargo.toml

@@ -3,7 +3,7 @@ name = "eastl-rs"
 authors = ["Andrew Buck"]
 description = "EASTL binary-compatible Rust implementations"
 documentation = "https://docs.rs/crate/eastl-rs"
-version = "0.10.6"
+version = "0.10.7"
 edition = "2021"
 license-file = "LICENSE"
 readme = "README.md"

src/internal/rb_tree/iter.rs

@@ -4,7 +4,7 @@ use std::ptr;
 
 /// An iterator over a Red-Black tree's nodes.
 pub struct Iter<'a, K, V> {
-    pub(super) node: *mut Node<K, V>,
+    pub(super) node: *const Node<K, V>,
     pub(super) anchor: *const (),
     pub(super) _marker: PhantomData<&'a ()>,
 }
@@ -25,7 +25,11 @@ impl<'a, K: 'a, V: 'a> Iterator for Iter<'a, K, V> {
 
         unsafe { self.node.as_ref() }
             .and_then(Node::next)
-            .map(|node| (node.key(), node.val()))
+            .map(|node| {
+                // update the iterator
+                self.node = node;
+                (node.key(), node.val())
+            })
     }
 }
 
@@ -39,6 +43,10 @@ impl<'a, K: 'a, V: 'a> Iterator for IterMut<'a, K, V> {
 
         unsafe { self.node.as_mut() }
             .and_then(Node::next_mut)
-            .map(|node| (&node.pair.0, &mut node.pair.1))
+            .map(|node| {
+                // update the iterator
+                self.node = node;
+                (&node.pair.0, &mut node.pair.1)
+            })
     }
 }