[Haskell-cafe] ANN: unordered-containers - a new, faster hashing-based containers library
stephen.tetley at gmail.com
Wed Feb 23 09:27:29 CET 2011
On 23 February 2011 05:31, Johan Tibell <johan.tibell at gmail.com> wrote:
> Can someone come up with a real world example where O(1) size is important?
Tangentially - if you changed the API so the size function was called
'count' rather than 'size' or 'length', there would be no shame what's
so ever in not being O(1).
Problem solved :-)
More information about the Haskell-Cafe