[Haskell-cafe] can there be (hash-table using) O(n) version of this (I think currently) n log n algo?

[Alberto G. Corona]

Any application where multiple updates are done in multiple threads . gain
by using a hashTable

2009/7/18 Bulat Ziganshin <bulat.ziganshin at gmail.com>

> Hello Thomas,
>
> Saturday, July 18, 2009, 7:23:10 PM, you wrote:
>
> > Going back to my original question, I am now looking for a dead simple
> > motivating example for showing the example of using a (good) hashtable
> > over Data.Map
>
> spell checking?
>
> --
> Best regards,
>  Bulat                            mailto:Bulat.Ziganshin at gmail.com
>
> _______________________________________________
> Haskell-Cafe mailing list
> Haskell-Cafe at haskell.org
> http://www.haskell.org/mailman/listinfo/haskell-cafe
>
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://www.haskell.org/pipermail/haskell-cafe/attachments/20091208/f4974ffd/attachment.html