#tree #arena-allocation #depth #width #general #overhead

arbtree

A small library for general purpose tree data structures

5 releases

0.2.0 Jun 25, 2022
0.1.3 May 24, 2022
0.1.2 May 12, 2022
0.1.1 May 8, 2022
0.1.0 May 8, 2022

#1152 in Data structures

Apache-2.0

17KB
377 lines

arbtree

arbtree is a library for general purpose tree data structures.

The library provides an interface for working with trees of arbitrary depth and width. The implementation is simple and uses arena allocation where nodes are stored in a Vec. No unsafe blocks and no additional overhead from using smart pointers.


lib.rs:

arbtree

arbtree is a library for general purpose tree data structures.

The library provides an interface for working with trees of arbitrary depth and width. The implementation is simple and uses arena allocation where nodes are stored in a Vec. No unsafe blocks and no additional overhead from using smart pointers.

No runtime deps