[Haskell-cafe] Pure hashtable library

Bulat Ziganshin bulat.ziganshin at gmail.com
Wed Aug 27 16:31:08 EDT 2008

Hello Jan-Willem,

Wednesday, August 27, 2008, 4:06:11 PM, you wrote:

> One obvious way to make non-modifiable hash tables useful is to "eat
> your own tail" non-strictly--- aggregate a set of hash table entries,
> construct a hash table from them, and plumb the resulting hash table  
> into the original computation by tying the knot.  This works really  
> well if you can construct the bucket lists lazily and if you specify  
> the table size up front.

i think it's impossible since you need to scan whole assoclist to
build list of entries for any value of hash function. actually, the
same is true for any array building code - while the *values* of array
elements may be calculated lazy, *positions* cannot

Best regards,
 Bulat                            mailto:Bulat.Ziganshin at gmail.com

More information about the Haskell-Cafe mailing list