#tree #arena #index #indextree #trie

indextree

Arena based tree structure by using indices instead of reference counted pointers

14 stable releases (4 major)

✓ Uses Rust 2018 edition

4.0.0 Aug 4, 2019
3.3.0 Jul 9, 2019
3.2.0 Apr 18, 2019
3.1.1 Mar 31, 2019
0.1.1 Dec 22, 2016

#36 in Data structures

Download history 94/week @ 2019-04-21 46/week @ 2019-04-28 73/week @ 2019-05-05 81/week @ 2019-05-12 113/week @ 2019-05-19 119/week @ 2019-05-26 61/week @ 2019-06-02 73/week @ 2019-06-09 106/week @ 2019-06-16 300/week @ 2019-06-23 167/week @ 2019-06-30 108/week @ 2019-07-07 73/week @ 2019-07-14 194/week @ 2019-07-21 151/week @ 2019-07-28

534 downloads per month
Used in 19 crates (11 directly)

MIT license

72KB
792 lines

indextree

Build status Build Status Build status Coverage Dependency Status Doc indextree License MIT Crates.io doc.rs

Arena based tree structure with multithreading support

This arena tree structure is using just a single Vec and numerical identifiers (indices in the vector) instead of reference counted pointers. This means there is no RefCell and mutability is handled in a way much more idiomatic to Rust through unique (&mut) access to the arena. The tree can be sent or shared across threads like a Vec. This enables general multiprocessing support like parallel tree traversals.

Example usage

use indextree::Arena;

// Create a new arena
let arena = &mut Arena::new();

// Add some new nodes to the arena
let a = arena.new_node(1);
let b = arena.new_node(2);

// Append a to b
assert!(a.append(b, arena).is_ok());
assert_eq!(b.ancestors(arena).into_iter().count(), 2);

Dependencies

~0–445KB