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

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. Cheers, Sterl On Feb 23, 2011, at 4:32 PM, Johan Tibell wrote:

On Wed, Feb 23, 2011 at 1:27 PM, Gwern Branwen 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@haskell.org http://www.haskell.org/mailman/listinfo/haskell-cafe