Hoogle Search

Within LTS Haskell 10.3 (ghc-8.2.2)

  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 from lowest to highest, keeping duplicates in the order they appeared in the input.

  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 from lowest to highest, keeping duplicates in the order they appeared in the input.

  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

    O(n log n). sort sorts the specified Seq by the natural ordering of its elements. The sort is stable. If stability is not required, unstableSort can be considerably faster, and in particular uses less memory.

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

    containers Data.Sequence.Internal

    O(n log n). sort sorts the specified Seq by the natural ordering of its elements. The sort is stable. If stability is not required, unstableSort can be considerably faster, and in particular uses less memory.

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

    Cabal Distribution.Compat.Prelude.Internal

    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 from lowest to highest, keeping duplicates in the order they appeared in the input.

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

    utility-ht Data.List.Key

    No documentation available.

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

Page 1 of many | Next