This repository is archived to reflect its level of (in)activity and set maintenance expectations.
If some ideas or code in it are useful to you, feel free to use them in other repositories and crates in accordance with the license.
Note however that tree data structure design in Rust is full of trade-offs,
maybe some approach other than
Weak would work better for you.
Vec + indices, if it’s acceptable
not to recover memory for dropped nodes before the entire document is dropped.)