[Issue 13410] Performance problem with associative array byKey/byValue

[via Digitalmars-d-bugs]

https://issues.dlang.org/show_bug.cgi?id=13410

--- Comment #9 from bearophile_hugs at eml.cc ---
(In reply to Ketmar Dark from comment #8)

> but to find "first available" item we must loop thru all buckets
> until we find the used one.

Right. (But using an unordered_map in the C++ code from the newsgroup the C++
code only gets a little more than twice slower, that seems about twice faster
than the patched D code. I don't know the source of such performance
difference.)


> sorry, each time i'm thinking about registering at github god kills one
> kitten.

Thank you for your work. Probably someone else will create a pull request with
this.

--