[Haskell] whereis the lazyness ?

Jules Bean jules at jellybean.co.uk
Sat Dec 4 14:12:14 EST 2004

On 3 Dec 2004, at 19:22, Duncan Coutts wrote:

> I can't immediately think of a collection data structure combining O(1)
> lookup with a sparse key space however - that sounds quite tricky.

Hashtable, surely?


More information about the Haskell mailing list