Equivilent of STL Set in D ? ...

[Walter Bright]

Sean Kelly wrote:
> The C++ set is implemented as a balanced binary tree, and some sort of 
> binary tree is probably your best bet if you want a sorted container 
> with decent lookup performance.

C++'s balanced binary trees are red-black trees. I had just proposed 
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.