On Wed, Dec 5, 2012 at 5:23 AM, Alexander Voitenko <tarmik@meta.ua> wrote: [...]
3) Compound files use red-black tree as format feature. And to deal with compound files correctly, I need to access such low level data of a red-black tree as color of a node. I searched on the Internet for a free C++ library that allow to access all the data within a tree but not found any which is well-tested, so decided to make my own implementation using TDD approach.
It was developed according to this book:
http://www.amazon.com/Introduction-Algorithms-Includes-CD-Rom-Thomas/dp/0072... With my tiny modifications. ]:) Is it any interest for binary and red-black tree implementations as separate component? Or... the boost already have such facilities and I waste my time by reinventing one more wheel? :-)
rbtree supplied by Boost.Intrusive [1] could be what you're looking for. [1] http://www.boost.org/doc/libs/1_52_0/doc/html/intrusive/set_multiset.html - Jeff