29 Aug
2012
29 Aug
'12
2:25 a.m.
On 29.08.2012 10:19, Karl Voelker wrote:
Data.Map.lookup has better asymptotic time complexity than Prelude.lookup, but the relevant measures of efficiency depend on the situation.
Can you please elaborate a bit? I suspect lists better when there are just a few elements, but how much is a "few"? And what's about storage efficiency? How big is (Data.Map.fromList [1])?