Boost.Bimap is a bidirectional maps library for C++. With Boost.Bimap you can create associative containers in which both types can be used as key. A bimap can be thought of as a combination of a std::map and a std::map. The learning curve of bimap is almost flat if you know how to use standard
... [More] containers. A great deal of effort has been put into mapping the naming scheme of the STL in Boost.Bimap. The library is designed to match the common STL containers. [Less]
Template based B+ Tree is a simple and yet very efficient template based B+ Tree implementation which supports different types of storage. It is implemented in C++, and can be used with any type of data. To change storage type (e.g. from file based to memory based), all you need is to change a
... [More] template argument of the BTreeAlgorithms class. Either the standard search method or a customized search method can be used. [Less]
A generic implementation of STL containers and some STL algorithms. It is absolutly independent from external types it use only types declared in type_traits. So containers can be used with any poiner types which satisfies PointerConcept.
TreeComp is a ANSI C++ library that provides data structures for the generation, storage and manipulation of trees. It is STL conform so that STL algorithms can be used. The design was made using design patterns.