
31 Jan
2007
31 Jan
'07
4:18 a.m.
I will have a look. I also accept patches if someone has a ready-made
solution :)
Cheers,
JP.
On 1/31/07, Christian Maeder
recently I've switched from "Data.Map.Map Int" to "Data.IntMap.IntMap", but I was disappointed because I did not find a function that would yield the maximum key faster than in linear time, i.e. O(log n).
In fact the whole "Min/Max" section is missing in Data.IntMap (resp. Data.IntSet) compared to Data.Map (resp. Data.Set). (The section "Indexed" is also only in Data.Map.)
Would somebody care to fix this?
Cheers Christian
_______________________________________________ Libraries mailing list Libraries@haskell.org http://www.haskell.org/mailman/listinfo/libraries