[Haskell-cafe] ANN: unordered-containers - a new, faster hashing-based containers library

Johan Tibell johan.tibell at gmail.com
Wed Feb 23 06:31:12 CET 2011

On Tue, Feb 22, 2011 at 9:19 PM, Johan Tibell <johan.tibell at gmail.com> wrote:
> Initial numbers suggest that lookup gets 3% slower and insert/delete
> 6% slower. The upside is O(1) size.

Can someone come up with a real world example where O(1) size is important?


More information about the Haskell-Cafe mailing list