defaults fixed

Author: orxfun

Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "orx-tree"
-version = "1.0.0"
+version = "1.0.1"
 edition = "2021"
 authors = ["orxfun <orx.ugur.arikan@gmail.com>"]
 description = "A beautiful tree 🌳 with convenient and efficient growth, mutation and traversal features."
@@ -24,6 +24,6 @@ serde_json = { version = "1.0.137", default-features = false, features = [
 ] }
 
 [features]
-default = ["std", "serde"]
+default = []
 std = []
 serde = ["dep:serde"]

README.md

@@ -38,8 +38,8 @@ On the other hand, [`node.ancestors()`](https://docs.rs/orx-tree/latest/orx_tree
 
 We also can walk the tree in an alternative desired order by using methods such as:
 
-* [`node.child(child_idx)`](https://docs.rs/orx-tree/latest/orx_tree/trait.NodeRef.html#method.child), [`node.children()`](https://docs.rs/orx-tree/latest/orx_tree/trait.NodeRef.html#method.children), [`node.children_mut()`](https://docs.rs/orx-tree/latest/orx_tree/trait.NodeRef.html#method.children_mut), [`node.into_child(child_idx)`]((https://docs.rs/orx-tree/latest/orx_tree/trait.NodeRef.html#method.into_child))
-* [`node.parent()`](https://docs.rs/orx-tree/latest/orx_tree/trait.NodeRef.html#method.parent), [`node.into_parent()`](https://docs.rs/orx-tree/latest/orx_tree/trait.NodeRef.html#method.into_parent), etc.
+* [`node.child(child_idx)`](https://docs.rs/orx-tree/latest/orx_tree/trait.NodeRef.html#method.child), [`node.children()`](https://docs.rs/orx-tree/latest/orx_tree/trait.NodeRef.html#method.children), [`node.children_mut()`](https://docs.rs/orx-tree/latest/orx_tree/trait.NodeRef.html#method.children_mut), [`node.into_child_mut(child_idx)`](https://docs.rs/orx-tree/latest/orx_tree/struct.NodeMut.html#method.into_child_mut)
+* [`node.parent()`](https://docs.rs/orx-tree/latest/orx_tree/trait.NodeRef.html#method.parent), [`node.into_parent_mut()`](https://docs.rs/orx-tree/latest/orx_tree/struct.NodeMut.html#method.into_parent_mut), etc.
 
 The tree naturally implements [`Collection`](https://docs.rs/orx-iterable/latest/orx_iterable/trait.Collection.html) and [`CollectionMut`](https://docs.rs/orx-iterable/latest/orx_iterable/trait.CollectionMut.html) providing iterators via `iter` and `iter_mut` methods. Since the tree is not a linear data structure, these iterators yield elements in an arbitrary (but deterministic) order. The following are some example cases where the traversal order is not important, and hence, these iterators are useful:
 

src/node_mut.rs

@@ -2256,19 +2256,12 @@ where
     /// // |     |  ╱ ╲
     /// // 8     9 10  11
     ///
-    /// let mut tree = DynTree::new(1);
-    ///
-    /// let mut root = tree.root_mut();
-    /// let [id2, id3] = root.push_children([2, 3]);
-    ///
-    /// let mut n2 = tree.node_mut(&id2);
-    /// let [id4, _] = n2.push_children([4, 5]);
-    ///
+    /// // keep indices valid during removals
+    /// let mut tree = DynTree::new(1).into_lazy_reclaim();
+    /// let [id2, id3] = tree.root_mut().push_children([2, 3]);
+    /// let [id4, _] = tree.node_mut(&id2).push_children([4, 5]);
     /// tree.node_mut(&id4).push_child(8);
-    ///
-    /// let mut n3 = tree.node_mut(&id3);
-    /// let [id6, id7] = n3.push_children([6, 7]);
-    ///
+    /// let [id6, id7] = tree.node_mut(&id3).push_children([6, 7]);
     /// tree.node_mut(&id6).push_child(9);
     /// tree.node_mut(&id7).push_children([10, 11]);
     ///
@@ -2350,19 +2343,12 @@ where
     /// // |     |  ╱ ╲
     /// // 8     9 10  11
     ///
-    /// let mut tree = DynTree::new(1);
-    ///
-    /// let mut root = tree.root_mut();
-    /// let [id2, id3] = root.push_children([2, 3]);
-    ///
-    /// let mut n2 = tree.node_mut(&id2);
-    /// let [id4, _] = n2.push_children([4, 5]);
-    ///
+    /// // keep indices valid during removals
+    /// let mut tree = DynTree::new(1).into_lazy_reclaim();
+    /// let [id2, id3] = tree.root_mut().push_children([2, 3]);
+    /// let [id4, _] = tree.node_mut(&id2).push_children([4, 5]);
     /// tree.node_mut(&id4).push_child(8);
-    ///
-    /// let mut n3 = tree.node_mut(&id3);
-    /// let [id6, id7] = n3.push_children([6, 7]);
-    ///
+    /// let [id6, id7] = tree.node_mut(&id3).push_children([6, 7]);
     /// tree.node_mut(&id6).push_child(9);
     /// tree.node_mut(&id7).push_children([10, 11]);
     ///
@@ -2841,56 +2827,3 @@ where
             .map(|p| NodeMut::new(self.col, p))
     }
 }
-
-#[test]
-fn abc() {
-    use crate::*;
-    use alloc::vec::Vec;
-
-    //      1
-    //     ╱ ╲
-    //    ╱   ╲
-    //   2     3
-    //  ╱ ╲   ╱ ╲
-    // 4   5 6   7
-    // |     |  ╱ ╲
-    // 8     9 10  11
-    let mut tree = DynTree::new(1).into_lazy_reclaim(); // ensure index validity
-    let [id2, id3] = tree.root_mut().push_children([2, 3]);
-    let [id4, _] = tree.node_mut(&id2).push_children([4, 5]);
-    tree.node_mut(&id4).push_child(8);
-    let [id6, id7] = tree.node_mut(&id3).push_children([6, 7]);
-    tree.node_mut(&id6).push_child(9);
-    tree.node_mut(&id7).push_children([10, 11]);
-
-    // let's move subtree rooted at n2 into new tree: tree2
-    //   2
-    //  ╱ ╲
-    // 4   5
-    // |
-    // 8
-    let tree2: DynTree<_> = tree.node_mut(&id2).into_new_tree();
-    let bfs: Vec<_> = tree2.root().walk::<Bfs>().copied().collect();
-    assert_eq!(bfs, [2, 4, 5, 8]);
-
-    // let's move subtree rooted at n7 into new tree: tree7
-    // this time, the target tree is a BinaryTree
-    //   7
-    //  ╱ ╲
-    // 10  11
-    let tree7: BinaryTree<_> = tree.node_mut(&id7).into_new_tree();
-    let bfs: Vec<_> = tree7.root().walk::<Bfs>().copied().collect();
-    assert_eq!(bfs, [7, 10, 11]);
-
-    // these subtrees are removed from the original tree
-    // 1
-    //  ╲
-    //   ╲
-    //    3
-    //   ╱
-    //  6
-    //  |
-    //  9
-    let bfs: Vec<_> = tree.root().walk::<Bfs>().copied().collect();
-    assert_eq!(bfs, [1, 3, 6, 9]);
-}

src/traversal/post_order/iter_ptr.rs

@@ -108,9 +108,7 @@ where
                 None => return None,
                 Some((ptr, child_idx)) => {
                     let node = unsafe { &*ptr.ptr() };
-                    std::dbg!(child_idx);
                     let child_ptr = node.next().get_ptr(*child_idx).cloned();
-                    std::dbg!("ABC");
                     match child_ptr {
                         Some(child_ptr) => self.move_deeper(child_ptr),
                         None => {