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

Sterling Clover s.clover at gmail.com
Wed Feb 23 22:42:59 CET 2011

A quick grep of some of my own source reveals that I've used M.size and S.size only to test for sizes equal to 1. So, for my purposes at least, an O(1) isSingleton operation would be just as useful as an O(1) size.


On Feb 23, 2011, at 4:32 PM, Johan Tibell wrote:

> On Wed, Feb 23, 2011 at 1:27 PM, Gwern Branwen <gwern0 at gmail.com> wrote:
>> You could look at them yourself; I attached the files. I see 6 uses
>> out of ~100 which involve an == 0
> Looks like the mailing list gateway didn't let your attachements
> through. No need to attach them though, I can just grep Hackage for
> uses.
> Johan
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe

More information about the Haskell-Cafe mailing list