Hoogle Search

Within LTS Haskell 24.2 (ghc-9.10.2)

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

Exact lookup

1. sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m ()

   vector-algorithms	Data.Vector.Algorithms.Heap

   Sorts an entire array using the default ordering.

2. sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m ()

   vector-algorithms	Data.Vector.Algorithms.Insertion

   Sorts an entire array using the default comparison for the type

3. sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m ()

   vector-algorithms	Data.Vector.Algorithms.Intro

   Sorts an entire array using the default ordering.

4. sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m ()

   vector-algorithms	Data.Vector.Algorithms.Merge

   Sorts an array using the default comparison.

5. sort :: forall e m v . (PrimMonad m, MVector v e, Radix e) => v (PrimState m) e -> m ()

   vector-algorithms	Data.Vector.Algorithms.Radix

   Sorts an array based on the Radix instance.

6. sort :: (PrimMonad m, MVector v e, Ord e) => v (PrimState m) e -> m ()

   vector-algorithms	Data.Vector.Algorithms.Tim

   Sorts an array using the default comparison.

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

8. sort :: ByteString -> ByteString

   rio	RIO.ByteString

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

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

   rio	RIO.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 => NonEmpty a -> NonEmpty a

    rio	RIO.NonEmpty

    Sort a stream.

Page 2 of many | Previous | Next