C++ Container equivalents

Jascha Wetzel "[firstname]" at mainia.de
Wed Aug 15 01:59:46 PDT 2007


Bruce Adams wrote:
> Hashmap "Unlike DMD's dodgy associative array implementation, it doesn't rely on an ordering comparator"
> 
> What's wrong with std.date and whats dodgey about associative 
> arrays?

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.


More information about the Digitalmars-d-learn mailing list