This was probably supposed to be a Traversable constraint. I still suspect it would be unwise, because there may be data structures that can be shuffled more efficiently than this type would allow.
On 09:08 Wed 30 Nov , Baldur Blöndal wrote:
> P.s. At least I did not propose ↓ yet :)
>
> > shuffleM :: (Foldable f, MonadRandom m) => f a -> m (f a)
This would be an utter nonsense, given that many if not most foldables
either don't have an order like Set or must have very specific order
like different kinds of trees and therefore cannot be shuffled.
_______________________________________________
Libraries mailing list
Libraries@haskell.org
http://mail.haskell.org/cgi-bin/mailman/listinfo/libraries