#random-access #tree #log #insertion #splitting #merging

magiclist

List with O(log n) random access, insertion, splitting, and merging

1 unstable release

0.1.0 Aug 28, 2024

#944 in Data structures

GPL-3.0-only

20KB
543 lines

magiclist

This crate provides a list implemented using a B+ tree, similar to btree_vec but has O(log n) splitting and merging.

No runtime deps