C++ Container equivalents

[Henning Hasemann]

Jascha Wetzel <"[firstname]"@mainia.de> wrote:
> what he means is probably that a hash table implementation doesn't
> need an ordering comparator, only equality. D's associative arrays
> are implemented as binary search trees with hash keys as index
> values. like this it needs both: ordering for the tree search and
> equality due to the non-injective hashing.

Thanks for that info, I always asked myself why they need both, too :)

Henning

-- 
GPG Public Key:
http://keyserver.ganneff.de:11371/pks/lookup?op=get&search=0xDDD6D36D41911851
Fingerprint: 344F 4072 F038 BB9E B35D  E6AB DDD6 D36D 4191 1851