Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

  1. sort :: Configuration -> Sort

    sphinx Text.Search.Sphinx.Configuration

    Match sorting mode

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

    verset Verset

    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]

    xmonad-contrib XMonad.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. module Test.Hspec.Discover.Sort

    NOTE: This module is not meant for public consumption. For user documentation look at https://hspec.github.io/hspec-discover.html.

  5. class Sort (f :: Type -> Type)

    non-empty Data.NonEmpty.Class

    We need to distinguish between Sort and SortBy, since there is an instance Sort Set but there cannot be an instance SortBy Set.

  6. type family Sort (a1 :: NonEmpty a) :: NonEmpty a

    singletons-base Data.List.NonEmpty.Singletons

    No documentation available.

  7. type family Sort (a1 :: [a]) :: [a]

    singletons-base Data.List.Singletons

    No documentation available.

  8. module System.TmpProc.TypeLevel.Sort

    Defines type-level combinators for performing a merge sort of type-level lists. SortSymbols sorts type-level lists of Symbols. The other exported combinators make it easy to implement type-level merge sort for similar type-level lists. This is an internal module that provides type-level functions used in various constraints in System.TmpProc.Docker.

  9. Sort :: Const

    dhall Dhall.Core

    No documentation available.

  10. module Harpie.Sort

    Vector sort routines.

Page 11 of many | Previous | Next