memory pool and rb-tree

[Denis Koroskin]

On Thu, 28 Aug 2008 18:46:04 +0400, Steven Schveighoffer  
<schveiguy at yahoo.com> wrote:

> "BLS" wrote
>> Hi Steve
>> In 2008, Sedgewick introduced a simpler version of red-black trees.
>> So called Left-Leaning Red-Black Trees. Remarkable enough : This algo.
>> requires just a few lines of code (compared to traditional
>> implementations), is dammned fast, and looks pretty smart. Probabely
>> interesting for you / DCollections. So here two links.
>>
>> PDF describing the Algorithm :
>> http://www.cs.princeton.edu/~rs/talks/LLRB/RedBlack.pdf
>>
>> Java source:
>> http://www.cs.princeton.edu/~rs/talks/LLRB/Java/RedBlackBST.java
>> hope you'll find it usefull,Bjoern
>
> At some point, I plan to investigate other means of representing trees  
> and
> hashes, and implement those options in dcollections.  I've heard several
> suggestions for tree-implementation, and I'll probably look at all of  
> them.
> When I have time :)
>
> Thanks!
>
> -Steve
>
>

Looking forward for results and good luck!