The open source cpp-btree template library, provides you with C++ source code to implement map, set, multimap and multiset templates.
So what you say, those are already in the ST and that's true. These however use considerable less memory which can speed up access (if the total ram footprint is smaller there's a better chance of a cache hit and thus faster execution). However be aware that modifying a C++ B-tree container invalidates all outstanding iterators.
- Permanent Link added to C++ Code Library