On Wednesday, 12 February 2020 at 20:58:49 UTC, Marcel wrote:
2- How is the builtin associative array implemented? I think I read somewhere it's implemented like C++'s std::unordered_map but with BSTs instead of DLists for handling collisions: is this correct?
It's an open-addressed hash table. If you want to see all the details, the source is here:
https://github.com/dlang/druntime/blob/v2.090.1/src/rt/aaA.d
