BTreeList

A list data structure that has efficient insertion and removal in the middle.

Heritage

This data structure was originally built for the Automerge Rust frontend to aid in efficient insertions in the middle of lists.

lib.rs:

A tree-based list with heap-allocated contents.

A BTreeList offers O(log(n)) indexing, O(log(n)) insertion (anywhere in the list) and O(log(n)) removal (also anywhere in the list).

See BTreeList for more details.