See also CodingStyle/C++.
Data structures
B-tree-based maps & sets
In 2013, Google open-sourced a mostly-STL-compatible b-tree implementation: B-tree containers from Google. The old project is on Google code, but JGRennison/cpp-btree is a fork with minor fixes and some C++11 support (e.g. move constructors, etc).
tlx library contains a fast loser tree implementation, a newer version of the bingmann/stx-btree implemtnation, a smart pointer replacement for shared_ptr called counting_ptr, and std::string helper functions missing from STL.
