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. sortBy :: SortBy f => (a -> a -> Ordering) -> f a -> f a

   non-empty	Data.NonEmpty.Class

   No documentation available.

2. sortDefault :: (Ord a, SortBy f) => f a -> f a

   non-empty	Data.NonEmpty.Class

   Default implementation for sort based on sortBy.

3. sortKey :: (SortKey f, Ord b) => (a -> b) -> f a -> f a

   non-empty	Data.NonEmpty.Class

   No documentation available.

4. sortKeyGen :: (SortBy f, Functor f, Ord b) => (a -> b) -> f a -> f a

   non-empty	Data.NonEmpty.Class

   No documentation available.

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

   vector-algorithms	Data.Vector.Algorithms.AmericanFlag

   A fully parameterized version of the sorting algorithm. Again, this function takes both radix information and a comparison, because the algorithms falls back to insertion sort for small arrays.

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

   vector-algorithms	Data.Vector.Algorithms.AmericanFlag

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

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

   vector-algorithms	Data.Vector.Algorithms.AmericanFlag

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

   Sorts an entire array using a custom ordering.

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

   vector-algorithms	Data.Vector.Algorithms.Heap

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

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

    vector-algorithms	Data.Vector.Algorithms.Heap

    Given a heap stored in a portion of an array [l,u), sorts the highest values into [m,u). The elements in [l,m) are not in any particular order.

Page 17 of many | Previous | Next