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?
Jules
_______________________________________________ Haskell mailing list [EMAIL PROTECTED] http://www.haskell.org/mailman/listinfo/haskell
