Hoogle Search

Within LTS Haskell 22.21 (ghc-9.6.5)

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

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

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

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

    base Data.List.NonEmpty

    Sort a stream.

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

    base GHC.OldList

    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 :: ByteString -> ByteString

    bytestring Data.ByteString

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

  5. sort :: ByteString -> ByteString

    bytestring Data.ByteString.Char8

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

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

    containers Data.Sequence

    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.

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

    containers Data.Sequence.Internal.Sorting

    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.

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

    base-compat Data.List.NonEmpty.Compat

    Sort a stream.

  9. sort :: Ord b => (a -> b) -> [a] -> [a]

    utility-ht Data.List.Key

    No documentation available.

  10. sort :: (Sort f, Ord a) => f a -> f a

    non-empty Data.NonEmpty.Class

    No documentation available.

Page 1 of many | Next