This post is really great but also 
https://twitter.com/nelhage/status/801472446121422848 …
-
-
Replying to @Gankro
This only happened because we recently tried to weaken our seeding strategy, but this is still latently problematic for non-seeded hashers.
1 reply 0 retweets 3 likes -
Replying to @Gankro
We long ago discussed tracking run length, and reallocating if it exceeded some constant like 16/32. I'd assume this is the "right" fix.
2 replies 0 retweets 2 likes -
Replying to @Gankro
HashMap insertion is O(n) wost case. Copying a m-element HashMap by inserting each of its elements into another is O(m*n)==O(n**2).
2 replies 0 retweets 0 likes
Replying to @BRIAN_____ @Gankro
If you need better-than-linear worst-case then don't use a HashMap. A HashMap that falls back to being a tree map isn't a HashMap.
5:45 PM - 23 Nov 2016
0 replies
0 retweets
0 likes
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.