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.

Exact lookup

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

2. sort :: Vector Double -> Vector Double

   statistics	Statistics.Function

   Sort a vector.

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

   Cabal-syntax	Distribution.Compat.Prelude

   No documentation available.

4. sort :: RedisCtx m f => ByteString -> SortOpts -> m (f [ByteString])

   hedis	Database.Redis

   No documentation available.

5. sort :: RedisCtx m f => ByteString -> SortOpts -> m (f [ByteString])

   hedis	Database.Redis.Sentinel

   No documentation available.

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

   relude	Relude.List.Reexport

   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]
   

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

   base-compat-batteries	Data.List.NonEmpty.Compat

   Sort a stream.

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

   protolude	Protolude

   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]
   

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

   ghc-internal	GHC.Internal.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. 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]
   

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

    ghc-internal	GHC.Internal.Data.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. 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 3 of many | Previous | Next