[Haskell-cafe] Motivation for having indexed access in Data.Map?
chbreitkopf at googlemail.com
Sat Jan 7 13:17:11 CET 2012
I wonder why Data.Map provides the indexed access functions:
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?
-------------- next part --------------
An HTML attachment was scrubbed...
More information about the Haskell-Cafe