Hoogle Search

Within LTS Haskell 24.34 (ghc-9.10.3)

Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.

Exact lookup

1. sortUniq :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m (v (PrimState m) e)

   vector-algorithms	Data.Vector.Algorithms.Insertion

   A variant on sort that returns a vector of unique elements.

2. sortUniqBy :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> m (v (PrimState m) e)

   vector-algorithms	Data.Vector.Algorithms.Insertion

   A variant on sortBy which returns a vector of unique elements.

3. sortBy :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> m ()

   vector-algorithms	Data.Vector.Algorithms.Intro

   A variant on sortBy which returns a vector of unique elements.

4. sortByBounds :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> Int -> Int -> m ()

   vector-algorithms	Data.Vector.Algorithms.Intro

   Sorts a portion of an array [l,u) using a custom ordering

5. sortUniq :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m (v (PrimState m) e)

   vector-algorithms	Data.Vector.Algorithms.Intro

   A variant on sort that returns a vector of unique elements.

6. sortUniqBy :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> m (v (PrimState m) e)

   vector-algorithms	Data.Vector.Algorithms.Intro

   Sorts an entire array using a custom ordering returning a vector of the unique elements.

7. sortBy :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> m ()

   vector-algorithms	Data.Vector.Algorithms.Merge

   Sorts an array using a custom comparison.

8. sortUniq :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m (v (PrimState m) e)

   vector-algorithms	Data.Vector.Algorithms.Merge

   A variant on sort that returns a vector of unique elements.

9. sortUniqBy :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> m (v (PrimState m) e)

   vector-algorithms	Data.Vector.Algorithms.Merge

   A variant on sortBy which returns a vector of unique elements.

10. sort2ByIndex :: (PrimMonad m, MVector v e) => Comparison e -> v (PrimState m) e -> Int -> Int -> m ()

    vector-algorithms	Data.Vector.Algorithms.Optimal

    Sorts the elements at the two given indices using the comparison. This is essentially a compare-and-swap, although the first index is assumed to be the lower of the two.

Page 19 of many | Previous | Next