Closed btc closed 3 years ago
Right now, uses BTree but compaction would benefit from an ADT with O(1) insertions.
The most important operation for the ADT to support is the "bisect" lookup. With a vector, this would be O(logn). What is it right now with the BTree?
Right now, uses BTree but compaction would benefit from an ADT with O(1) insertions.
The most important operation for the ADT to support is the "bisect" lookup. With a vector, this would be O(logn). What is it right now with the BTree?