Project Description Web 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.
No Image posted
Your rating on BS
This page posts information of other open source development sites, and the information here is put together through the use of a feature called OFI. These projects are not the projects on OSDN.