Hello,<br><br>I wonder why Data.Map provides the indexed access functions:<br><br><a href="http://hackage.haskell.org/packages/archive/containers/latest/doc/html/Data-Map.html#g:21">http://hackage.haskell.org/packages/archive/containers/latest/doc/html/Data-Map.html#g:21</a><br>
<br>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?<br>
<br>Regards,<br><br>Chris<br>