Portability | portable |
---|---|

Stability | experimental |

Maintainer | bos@serpentine.com |

Useful functions.

- minMax :: Vector v Double => v Double -> (Double, Double)
- sort :: (Ord e, Vector v e) => v e -> v e
- partialSort :: (Vector v e, Ord e) => Int -> v e -> v e
- indexed :: (Vector v e, Vector v Int, Vector v (Int, e)) => v e -> v (Int, e)
- indices :: (Vector v a, Vector v Int) => v a -> v Int
- create :: (PrimMonad m, Vector v e) => Int -> (Int -> m e) -> m (v e)

# Documentation

minMax :: Vector v Double => v Double -> (Double, Double)Source

Compute the minimum and maximum of a vector in one pass.

Partially sort a vector, such that the least *k* elements will be
at the front.

indexed :: (Vector v e, Vector v Int, Vector v (Int, e)) => v e -> v (Int, e)Source

Zip a vector with its indices.