Closed applejag closed 2 years ago
Possibly use a B-Tree as underlying data structure? Alternatively just use the AVL BST type Can't use tree as I need indexing support
I went with binary search-ed slice insertion instead. The implementation uses copy and doesn't allocate new slices on each insertion.
copy
Possibly use a B-Tree as underlying data structure?
Alternatively just use the AVL BST typeCan't use tree as I need indexing support