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

Max Bolingbroke batterseapower at hotmail.com
Wed Feb 23 21:46:02 CET 2011

On 23 February 2011 16:03, Johan Tibell <johan.tibell at gmail.com> wrote:
> Thanks for the examples. Point 3 is interesting but most of the gain
> there could probably be had by telling the user to use (bigmap `union`
> smallmap). My guess is that the user has a good idea which argument is
> larger/smaller.

Totally agreed - this matches my experience with Map/Set.

> And I didn't see anything that looked particularly bad. The core uses
> unboxed values everywhere possible and the recursive function (i.e.
> inserts) returns an unboxed pair (# Int#, Tree k v #).

Right. I was wondering if you were returning (Int, Tree k v), in which
case CPR wouldn't unbox the Int - but I see you already thought of
that issue.

By the way, do you plan to add a HashSet to complement HashMap?

Thanks for all the work on the library!

More information about the Haskell-Cafe mailing list