I did the work, see ticket 1229. http://hackage.haskell.org/trac/ghc/ticket/1229 Patch is attached to the ticket. The code is tested with my generic collection testsuite. See darcs.haskell.org/packages/collections (You will need the latest base + patch for running it.) http://darcs.haskell.org/packages/collections/doc/html/Data-Collections-Prop... I propose the 28th of March as deadline. Cheers, JP. On 1/31/07, Jean-Philippe Bernardy wrote:

I will have a look. I also accept patches if someone has a ready-made solution :)

Cheers, JP.

On 1/31/07, Christian Maeder wrote:

...

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