Hoogle Search

Within LTS Haskell 24.3 (ghc-9.10.2)

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

  1. sort :: ListLike full item => full -> full

    ListLike Data.ListLike

    Sorts the list. On data types that do not preserve ordering, or enforce their own ordering, the result may not be what you expect. See also sortBy.

  2. sort :: ListLike full item => full -> full

    ListLike Data.ListLike.Base

    Sorts the list. On data types that do not preserve ordering, or enforce their own ordering, the result may not be what you expect. See also sortBy.

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

    basic-prelude BasicPrelude

    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. The argument must be finite.

    Examples

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

    >>> sort "haskell"
"aehklls"

    >>> import Data.Semigroup(Arg(..))

>>> sort [Arg ":)" 0, Arg ":D" 0, Arg ":)" 1, Arg ":3" 0, Arg ":D" 1]
[Arg ":)" 0,Arg ":)" 1,Arg ":3" 0,Arg ":D" 0,Arg ":D" 1]

  4. sort :: Map k v -> Map k v

    dhall Dhall.Map

    Sort the keys of a Map, forgetting the original ordering 

    sort (sort x) = sort x

    >>> sort (fromList [("B",1),("A",2)])
fromList [("A",2),("B",1)]

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

    dhall Dhall.Set

    Sort the set elements, forgetting their original ordering. 

    >>> sort (fromList [2, 1]) == fromList [1, 2]
True

  6. sort :: Query -> Order

    mongoDB Database.MongoDB.Query

    Sort results by this order, [] = no sort. Default = []

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

    nonempty-containers Data.Sequence.NonEmpty

    sort sorts the specified NESeq 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 => [a] -> [a]

    prelude-compat Data.List2010

    No documentation available.

  9. sort :: (Functor io, MonadIO io, Ord a) => Shell a -> io [a]

    turtle Turtle.Prelude

    Return a list of the sorted elements of the given Shell, keeping duplicates: 

    >>> sort (select [1,4,2,3,3,7])
[1,2,3,3,4,7]

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

    data-ordlist Data.List.Ordered

    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. The argument must be finite.

    Examples

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

    >>> sort "haskell"
"aehklls"

    >>> import Data.Semigroup(Arg(..))

>>> sort [Arg ":)" 0, Arg ":D" 0, Arg ":)" 1, Arg ":3" 0, Arg ":D" 1]
[Arg ":)" 0,Arg ":)" 1,Arg ":3" 0,Arg ":D" 0,Arg ":D" 1]

Page 4 of many | Previous | Next