8 stable releases

1.0.7 Feb 16, 2024
1.0.6 Jun 11, 2020
1.0.5 Nov 21, 2019
1.0.4 Dec 18, 2018
0.1.0 Jul 31, 2017

#208 in Data structures

Download history 814/week @ 2024-02-26 1218/week @ 2024-03-04 1977/week @ 2024-03-11 1072/week @ 2024-03-18 889/week @ 2024-03-25 1182/week @ 2024-04-01 933/week @ 2024-04-08 965/week @ 2024-04-15 1084/week @ 2024-04-22 929/week @ 2024-04-29 2021/week @ 2024-05-06 1746/week @ 2024-05-13 2268/week @ 2024-05-20 2124/week @ 2024-05-27 2212/week @ 2024-06-03 2098/week @ 2024-06-10

8,792 downloads per month
Used in 10 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