[Haskell-cafe] Pure hashtable library

[Bulat Ziganshin]

Hello Daniel,

Wednesday, August 27, 2008, 8:01:24 PM, you wrote:

>> trie: O(len)*O(width)
>> hashed trie: O(len)
>> hash: O(len)

> Wouldn't the hashtable have lookup time O(len+bucketsize)?

i suppose that bucketsize=O(1): constructor should get [approximate]
size of hashed assoclist and it will select appropriate Array size



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