[Haskell-cafe] Motivation for having indexed access in Data.Map?

[Christoph Breitkopf]

Hello,

I wonder why Data.Map provides the indexed access functions:

http://hackage.haskell.org/packages/archive/containers/latest/doc/html/Data-Map.html#g:21

These functions seem rather out-of-place to me in the map api. The only use
case I could think of so far would be to find the median, or in general
n-th smallest key, but that does not seem sufficient reason (also, I think
there are faster methods for that). Anything else?

Regards,

Chris
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20120107/0f26d847/attachment.htm>