[Haskell-cafe] Pure hashtable library

[Johannes Waldmann]

>> * hashtable is represented as an array of assoc lists: Array Int [(a,b)]
> 
> Don't immutable arrays get rather inefficient when modified?

Bulat was specifically asking for "simple *non-modifiable* hashes"
http://article.gmane.org/gmane.comp.lang.haskell.cafe/43612

J.W.

-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 257 bytes
Desc: OpenPGP digital signature
Url : http://www.haskell.org/pipermail/haskell-cafe/attachments/20080827/eec12040/signature.bin