Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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.Heap

   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.Heap

   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.Insertion

   Sorts an entire array using a given comparison

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

   vector-algorithms	Data.Vector.Algorithms.Insertion

   Sorts the portion of an array delimited by [l,u)

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

   vector-algorithms	Data.Vector.Algorithms.Insertion

   Sorts the portion of the array delimited by [l,u) under the assumption that [l,m) is already sorted.

6. 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.

7. 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.

8. 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.

9. 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

10. 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.

Page 18 of many | Previous | Next