On Tuesday, 8 February 2022 at 21:42:06 UTC, H. S. Teoh wrote:
But as I said, this is overkill for something so trivial. Using
`bool[E]` or an RBTree works just fine.
Is the current implementation of associative arrays in D language
resistant to Denial of Service hash collision attacks?
* https://github.com/dlang/dmd/blob/master/src/dmd/root/aav.d
*
https://arstechnica.com/information-technology/2011/12/huge-portions-of-web-vulnerable-to-hashing-denial-of-service-attack/
* https://lwn.net/Articles/474912/
* https://codeforces.com/blog/entry/62393
If not, then redBlackTree may be safer to use when dealing with
potentially adversarially constructed input data.
