Equivilent of STL Set in D ? ...

BLS nanali at wanadoo.fr
Mon Oct 23 13:44:33 PDT 2006

Walter Bright schrieb:

> .....that someone do a red-black tree implementation for D. It's not hard, 
> the algorithms are well known. It just takes a little time to sit down 
> and do it.

Hi algorithm fans, maybe you can help a bit. I own  the Algorithms and 
Data Structures books from Wirth and Sedgewick. (Both antik/antique ... 
means Pascal, still true! and of course a little bit outdated) If you 
have a hint what is worth reading now (except C++ books) Thanks in 
advance. Björn

More information about the Digitalmars-d-learn mailing list