Google has always been great at releasing their internally developed C++ utility libraries to the public. In fact, by now, I’d say that Google’s testing framework, googletest, is bordering on becoming a de facto standard, but other great projects like glog have proven themselves equally awesome. These guys seriously know what they’re doing.

Therefore, it was with great pleasure that I saw a couple of days ago, that Google has now released yet another library. It got even better when I realised that it was a drop-in STL-esque container library built using B-trees rather than the more familiar data structures such as singly or doubly linked lists, vectors, deques and hash maps. If you’ve ever tried to find a good, readily usable B-tree implementation for C++ that supported anything even in the vicinity of STL iterators, you’ll realise how big a deal the aptly named C++ B-Tree library is.