[Haskell-cafe] ANN: unordered-containers - a new, faster hashing-based containers library
Malcolm Wallace
malcolm.wallace at me.com
Mon Mar 14 12:21:57 CET 2011
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.
Regards,
Malcolm
More information about the Haskell-Cafe
mailing list