Project DescriptionWeb Page Review this project

BS is a data structures library. It features fixed size, random access sequences. The sequences are constructed over B-trees. Complexity for most single item operations is about O(logN). The sequences are three to five times faster over random access BST-based sequences, while having better memory usage characteristics.

(This Description is auto-translated) Try to translate to Japanese Show Original Description

Review
Your rating
Review this project