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

Johan Tibell johan.tibell at gmail.com
Sun Feb 20 02:16:23 CET 2011

On Sat, Feb 19, 2011 at 4:27 PM, Sterling Clover <s.clover at gmail.com> wrote:
> Getting a bit picky, but for the record, Data.Map and Data.Sequence
> provide O(1) size, and Data.HashTable I believe stores the information
> but doesn't expose it from its tiny API. That's not an argument either
> way for what a HashMap should do, however :-)

We could support O(1) size. I have a design that doesn't waste one
word per node to store the size. I'll look into it as soon as I have


More information about the Haskell-Cafe mailing list