I am sure you know HashMaps are probabilistic data structures. This is akin to pointing out QuickSort takes O(n^2) time.
Compare to this prior to "fix": 1. Insert N elems into a HT. 2. Force copy of those elems into a new HT. Both O(n**2)?
-
-
this doesn't work because we don't shrink; the "attack" is reliant on having a lower cap table.
-
so basically you also need to get a shrink_to_fit in there.
-
that's convoluted enough that I think it's reasonable to say "this isn't a significant concern in practice"
-
notably we can suggest the code is wrong because it contains a performance hint that's incorrect.
End of conversation
New conversation -
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.