j
k
j a
j l
2010/7/15 Jake McArthur :
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. ;)
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))
Back to the thread
Back to the list
