15 Jul
2010
15 Jul
'10
3:39 p.m.
Stephen Tetley <stephen.tetley@gmail.com> writes:
2010/7/15 Jake McArthur <jake.mcarthur@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@gmail.com IvanMiljenovic.wordpress.com