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

wren ng thornton wren at freegeek.org
Thu Feb 24 02:09:08 CET 2011

On 2/23/11 4:55 PM, Max Bolingbroke wrote:
> 3) A surprise to me: generating fresh names! People keep a set of all
> names generated so far, and then just take size+1 as their fresh name.
> Nice trick. ~17 occurrences

This is a really common trick in NLP circles. Of course, it's easy to 
build a datastructure of your own which caches the size, rather than 
having the underlying datastructure do it.

Speaking of which, I should put my package for that up on Hackage...

Live well,

More information about the Haskell-Cafe mailing list