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 => [a] -> [a]

   heaps	Data.Heap

   O(n log n). Perform a heap sort

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

   LambdaHack	Game.LambdaHack.Core.Prelude

   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]
   

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

   cabal-install-solver	Distribution.Solver.Compat.Prelude

   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 :: PrimMonad m => DoubleBuffer (PrimState m) -> m ()

   data-sketches-core	DataSketches.Quantiles.RelativeErrorQuantile.Internal.DoubleBuffer

   Sorts the active region

5. sort :: Vector Double -> Vector Double

   hmatrix-gsl-stats	Numeric.GSL.Sort

   sort the elements of a vector into ascending order

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

   ihaskell	IHaskellPrelude

   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 => [a] -> [a]

   incipit-base	Incipit.Base

   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]
   

8. sort :: (Representable k, Representable a, Movable k, Ord k, Movable a) => [(k, a)] -> [(k, a)]

   linear-base	Foreign.Heap

   No documentation available.

9. sort :: Sort -> Type

   Agda	Agda.TypeChecking.Substitute

   No documentation available.

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

    Agda	Agda.Utils.List1

    Sort a stream.

Page 5 of many | Previous | Next