Merge pull request #164 from orxfun/new-pinned-vector-versions

upgrade to new pinned vec and con iter versions

Author: orxfun

Cargo.toml

@@ -1,6 +1,6 @@
 [package]
 name = "orx-tree"
-version = "1.7.1"
+version = "1.8.0"
 edition = "2024"
 authors = ["orxfun <[email protected]>"]
 description = "A beautiful tree 🌳 with convenient, efficient, parallelizable growth, mutation and traversal features."
@@ -12,11 +12,11 @@ categories = ["data-structures", "algorithms", "rust-patterns", "no-std"]
 [dependencies]
 orx-iterable = { version = "1.3.0", default-features = false }
 orx-pseudo-default = { version = "2.1.0", default-features = false }
-orx-pinned-vec = "3.16.0"
+orx-pinned-vec = { version = "3.16.0", default-features = false }
 orx-self-or = "1.2.0"
 serde = { version = "1.0.219", optional = true, default-features = false }
 orx-split-vec = { version = "3.17.0", default-features = false }
-orx-selfref-col = { version = "2.10.0", default-features = false }
+orx-selfref-col = { version = "2.9.0", default-features = false }
 orx-concurrent-iter = { version = "2.1.0", default-features = false }
 orx-parallel = { version = "2.1.0", default-features = false, optional = true }
 

src/common_traits/display.rs

@@ -244,7 +244,7 @@ where
                 false => '├',
             };
 
-            write!(f, "{}", first_depth_char)?;
+            write!(f, "{first_depth_char}")?;
             write!(f, "──")?;
 
             writeln!(f, "{}", node.data().to_string().as_str())?;

src/common_traits/serde.rs

@@ -105,8 +105,7 @@ where
             let (depth, value): (usize, V::Item) = x;
             if depth != 0 {
                 return err(format!(
-                    "First element of DepthFirstSequence (root of the tree) must have depth 0; however, received a depth of {}. Following is an example valid sequence of (depth, value) pairs: [[0, 0], [1, 1], [2, 3], [3, 6], [1, 2], [2, 4], [2, 5], [3, 7]].",
-                    depth
+                    "First element of DepthFirstSequence (root of the tree) must have depth 0; however, received a depth of {depth}. Following is an example valid sequence of (depth, value) pairs: [[0, 0], [1, 1], [2, 3], [3, 6], [1, 2], [2, 4], [2, 5], [3, 7]].",
                 ));
             }
             tree.push_root(value);
@@ -120,8 +119,7 @@ where
                     true => {
                         if depth > current_depth + 1 {
                             return err(format!(
-                                "Let d1 and d2 be two consecutive depths in the depth-first sequence. Then, (i) d2=d1+1, (ii) d2=d1 or (iii) d2<d1 are valid cases. However, received the invalid case where d2>d1+1 (d1={}, d2={}). Please see DepthFirstSequenceError documentation for details. Following is an example valid sequence of (depth, value) pairs: [[0, 0], [1, 1], [2, 3], [3, 6], [1, 2], [2, 4], [2, 5], [3, 7]].",
-                                current_depth, depth
+                                "Let d1 and d2 be two consecutive depths in the depth-first sequence. Then, (i) d2=d1+1, (ii) d2=d1 or (iii) d2<d1 are valid cases. However, received the invalid case where d2>d1+1 (d1={current_depth}, d2={depth}). Please see DepthFirstSequenceError documentation for details. Following is an example valid sequence of (depth, value) pairs: [[0, 0], [1, 1], [2, 3], [3, 6], [1, 2], [2, 4], [2, 5], [3, 7]].",
                             ));
                         }
                     }