[Haskell-cafe] Sorting a Repa Array

Chaddaï Fouché chaddai.fouche at gmail.com
Thu Jan 23 16:59:55 UTC 2014

Convert to a vector (that should be efficient since I understand that it is
the underlying representation anyway), then use the sort algorithms
available in the vector-algorithms package then convert back. You'll need
to use modify to apply the sort (since it works on MVector).

I don't think there's a simpler or better solution right now.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/haskell-cafe/attachments/20140123/ca6ed582/attachment.html>

More information about the Haskell-Cafe mailing list