Hoogle Search

Within LTS Haskell 22.18 (ghc-9.6.4)

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

  1. sort :: (SemiSequence seq, Ord (Element seq)) => seq -> seq

    mono-traversable Data.Sequences

    Sort a ordered sequence. 

    > sort [4,3,1,2]
[1,2,3,4]

  2. sort :: ByteString -> ByteString

    rio RIO.ByteString

    O(n) Sort a ByteString efficiently, using counting sort.

  3. sort :: Ord a => [a] -> [a]

    rio RIO.List

    The sort function implements a stable sorting algorithm. It is a special case of sortBy, which allows the programmer to supply their own comparison function. Elements are arranged from lowest to highest, keeping duplicates in the order they appeared in the input. 

    >>> sort [1,6,4,3,2,5]
[1,2,3,4,5,6]
    The argument must be finite.

  4. sort :: Ord a => NonEmpty a -> NonEmpty a

    rio RIO.NonEmpty

    Sort a stream.

  5. sort :: Ord a => Seq a -> Seq a

    rio RIO.Seq

    sort sorts the specified Seq by the natural ordering of its elements. The sort is stable. If stability is not required, unstableSort can be slightly faster.

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

    vector-algorithms Data.Vector.Algorithms.AmericanFlag

    Sorts an array using the default ordering. Both Lexicographic and Ord are necessary because the algorithm falls back to insertion sort for sufficiently small arrays.

  7. sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m ()

    vector-algorithms Data.Vector.Algorithms.Heap

    Sorts an entire array using the default ordering.

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

    vector-algorithms Data.Vector.Algorithms.Insertion

    Sorts an entire array using the default comparison for the type

  9. sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m ()

    vector-algorithms Data.Vector.Algorithms.Intro

    Sorts an entire array using the default ordering.

  10. sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m ()

    vector-algorithms Data.Vector.Algorithms.Merge

    Sorts an array using the default comparison.

Page 2 of many | Previous | Next