I took a view at some doc and I belive that it would be nice to have different balanced tree implementations in a framework (i.e. avl, red-black and splay). 2010/12/24 Hal Finkel <half@halssoftware.com>:

Hello,

I have no connection to the CPH STL project, but I have spent several hours looking over their technical reports, and a number of them are quite interesting. They detail research into different implementation choices for the STL containers and some of the algorithms, and have benchmarks, practical implementation notes, etc. Many of the reports even include full source code in the appendices.

http://www.cphstl.dk/WWW/reports.html

For example, I recommend looking at: 2004-2 - Mads D. Kristensen: Vector implementation for the CPH STL

Even though these are academic in nature, unlike most papers about data structures which I've read, they deal explicitly with the issues associated with actually creating STL-compatible containers (with the associated iterators).

This seems to be an active project, with work ongoing through this year. There is also some source code posted, although I was not able to find any licensing details.

I hope everyone has an enjoyable holiday season!

 -Hal

_______________________________________________ Unsubscribe & other changes: http://lists.boost.org/mailman/listinfo.cgi/boost

-- Quiero ser el rayo de sol que cada día te despierta para hacerte respirar y vivir en me. "Favola -Moda".