[Haskell-cafe] trees and pointers

Stephen Tetley stephen.tetley at gmail.com
Thu Jul 15 03:30:06 EDT 2010

2010/7/15 Jake McArthur <jake.mcarthur at gmail.com>:
> On 07/14/2010 05:01 PM, Victor Gorokhov wrote:
>> You can implement pure pointers on top of Data.Map with O(log n) time
> Or on top of Data.IntMap with O(1) time. ;)


>From the docs, lookup is O(min(n,W))

More information about the Haskell-Cafe mailing list