9 releases (stable)

1.0.6 Jun 11, 2020
1.0.5 Nov 21, 2019
1.0.4 Dec 18, 2018
1.0.3 Apr 4, 2018
0.1.0 Jul 31, 2017

#574 in Data structures

Download history 864/week @ 2022-11-27 645/week @ 2022-12-04 839/week @ 2022-12-11 559/week @ 2022-12-18 293/week @ 2022-12-25 511/week @ 2023-01-01 797/week @ 2023-01-08 658/week @ 2023-01-15 1154/week @ 2023-01-22 1234/week @ 2023-01-29 1150/week @ 2023-02-05 1310/week @ 2023-02-12 758/week @ 2023-02-19 956/week @ 2023-02-26 1004/week @ 2023-03-05 844/week @ 2023-03-12

3,655 downloads per month
Used in 7 crates (3 directly)

Apache-2.0/MIT

16KB
234 lines

Cactus

This library provides an immutable cactus stack (also called a spaghetti stack or parent pointer tree). A cactus stack is a (possibly empty) node with a (possibly null) pointer to a parent node. Any given node has a unique path back to the root node. Rather than mutably updating the stack, one creates and obtains access to immutable nodes (when a node becomes unreachable its memory is automatically reclaimed). A new child node pointing to a parent can be created via the child function (analogous to the normal push) and a parent can be retrieved via the parent function (analogous to the normal pop).

use cactus::Cactus;
let c = Cactus::new();
assert!(c.is_empty());
let c2 = c.child(1);
assert_eq!(c2.len(), 1);
assert_eq!(*c2.val().unwrap(), 1);
let c3 = c2.parent().unwrap();
assert!(c3.is_empty());

From a given node one can create multiple sub-stacks:

use cactus::Cactus;
let c = Cactus::new().child(1);
let c2 = c.child(2);
let c3 = c.child(3);
assert!(c2 != c3);
assert_eq!(c2.vals().cloned().collect::<Vec<_>>(), [2, 1]);
assert_eq!(c3.vals().cloned().collect::<Vec<_>>(), [3, 1]);

No runtime deps