[Haskell-cafe] trees and pointers

Jake McArthur jake.mcarthur at gmail.com
Wed Jul 14 23:17:20 EDT 2010


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. ;)


More information about the Haskell-Cafe mailing list