mutcursor
This crate provides a type to safely store mutable references to parent nodes, for backtracking during traversal of tree & graph structures.
Usage
use MutCursor;
let mut tree = new;
let mut node_stack = new;
// Traverse to the last node
while node_stack.advance
assert_eq!;
assert_eq!;
node_stack.backtrack;
assert_eq!;
assert_eq!;
/// A simple stand-in for a recursive graph structure
Alternative(s)
This crate basically does the same thing as generic-cursors. However, this crate opts for a fixed-size stack while generic-cursors
uses a Vec
. That means this crate has lower overhead but generic-cursors
permits arbitrarily-deep backtracking.
Safety Thesis
Each &mut
reference stored by a [MutCursor] mutably borrows the reference beneath it in the stack. The stack root takes a mutable (and therefore exclusive) borrow of the node itself. Therefore the stack's top is an exclusive borrow.
You can imagine unrolling tree traversal into something like the code below, but this isn't amenable to looping. In essence each level
variable is preserved, but inaccessible because the level above is mutably borrowing it. The [MutCursor] object contains all the level
variables but only provides access to the top
let level_1 = &mut root;