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

Johan Tibell johan.tibell at gmail.com
Mon Mar 14 15:00:14 CET 2011

On Mar 14, 2011 6:23 PM, "Malcolm Wallace" <malcolm.wallace at me.com> wrote:
> On 22 Feb 2011, at 22:21, Bryan O'Sullivan wrote:
>> for some code that's (b) faster than anything else currently available
> I look forward to seeing some benchmarks against libraries other than
containers, such as AVL trees, bytestring-trie, hamtmap, list-trie, etc.
 Good comparisons of different API-usage patterns are hard to come by.

Milan Straka compared containers to a number of other libraries (including
some of those you mentioned) and found them all to be slower. Since
unordered-containers is faster (or sometimes as fast) as containers I
haven't really bothered comparing it to libraries other than containers.

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20110314/11ed6dc5/attachment.htm>

More information about the Haskell-Cafe mailing list