[Haskell-cafe] trees and pointers

Ivan Lazar Miljenovic ivan.miljenovic at gmail.com
Thu Jul 15 03:39:58 EDT 2010

Stephen Tetley <stephen.tetley at gmail.com> writes:

> 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. ;)
> Unlikely...
>>From the docs, lookup is O(min(n,W))

Yeah, I was trying to work out how the O(1) time worked as well...

Ivan Lazar Miljenovic
Ivan.Miljenovic at gmail.com

More information about the Haskell-Cafe mailing list