On 12/25/10 12:21 AM, bearophile wrote:
D built-in AAs are a hash map, but they use comparisons to resolve collisions.
This makes D AAs strong against malicious attacks. Python dicts are faster but
they are a pure hash map.
What is a pure hash map?
than std::unordered_set, but I don't know of any other data structures in D
for this (I'm still learning).
A unordered_set is not present in stc.collections yet.
Well the built-in AAs are unordered sets.
Regarding your code, break and continue statements are not Structured
Programming, so it's better to avoid them when possible.
I guess I'd be the guilty one :o). I like break and continue, not to
mention scope, and I think structured programming is all too often
noncritically as "good". Anyway, this is minutia not to bother a new
member with!
Andrei
