Closed treeowl closed 6 years ago
insert :: DynamicStableName -> a -> Map a -> Map a insert k v = Map . IntMap.insertWith (++) (hashDynamicStableName k) [(k,v)] . getMap
I can't immediately tell if it's correct or not, but inserting the same key many times will make the collision bucket grow without bound.
I can't immediately tell if it's correct or not, but inserting the same key many times will make the collision bucket grow without bound.