Hoogle Search

Within LTS Haskell 24.32 (ghc-9.10.3)

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

  1. sortBy :: Configuration -> String

    sphinx Text.Search.Sphinx.Configuration

    Attribute to sort by

  2. sortBy :: (a -> a -> Ordering) -> [a] -> [a]

    verset Verset

    The sortBy function is the non-overloaded version of sort. The argument must be finite. The supplied comparison relation is supposed to be reflexive and antisymmetric, otherwise, e. g., for _ _ -> GT, the ordered list simply does not exist. The relation is also expected to be transitive: if it is not then sortBy might fail to find an ordered permutation, even if it exists.

    Examples

    >>> sortBy (\(a,_) (b,_) -> compare a b) [(2, "world"), (4, "!"), (1, "Hello")]
[(1,"Hello"),(2,"world"),(4,"!")]

  3. sortOn :: Ord b => (a -> b) -> [a] -> [a]

    verset Verset

    Sort a list by comparing the results of a key function applied to each element. sortOn f is equivalent to sortBy (comparing f), but has the performance advantage of only evaluating f once for each element in the input list. This is called the decorate-sort-undecorate paradigm, or Schwartzian transform. Elements are arranged from lowest to highest, keeping duplicates in the order they appeared in the input. The argument must be finite.

    Examples

    >>> sortOn fst [(2, "world"), (4, "!"), (1, "Hello")]
[(1,"Hello"),(2,"world"),(4,"!")]

    >>> sortOn length ["jim", "creed", "pam", "michael", "dwight", "kevin"]
["jim","pam","creed","kevin","dwight","michael"]

    Performance notes

    This function minimises the projections performed, by materialising the projections in an intermediate list. For trivial projections, you should prefer using sortBy with comparing, for example: 
    >>> sortBy (comparing fst) [(3, 1), (2, 2), (1, 3)]
[(1,3),(2,2),(3,1)]
    Or, for the exact same API as sortOn, you can use `sortBy . comparing`: 
    >>> (sortBy . comparing) fst [(3, 1), (2, 2), (1, 3)]
[(1,3),(2,2),(3,1)]

  4. sorted :: [Property] -> l a -> ModifiedLayout SortedLayout l a

    xmonad-contrib XMonad.Layout.SortedLayout

    Modify a layout using a list of properties to sort its windows.

  5. sortBy :: (a -> a -> Ordering) -> [a] -> [a]

    xmonad-contrib XMonad.Prelude

    The sortBy function is the non-overloaded version of sort. The argument must be finite. The supplied comparison relation is supposed to be reflexive and antisymmetric, otherwise, e. g., for _ _ -> GT, the ordered list simply does not exist. The relation is also expected to be transitive: if it is not then sortBy might fail to find an ordered permutation, even if it exists.

    Examples

    >>> sortBy (\(a,_) (b,_) -> compare a b) [(2, "world"), (4, "!"), (1, "Hello")]
[(1,"Hello"),(2,"world"),(4,"!")]

  6. sortOn :: Ord b => (a -> b) -> [a] -> [a]

    xmonad-contrib XMonad.Prelude

    Sort a list by comparing the results of a key function applied to each element. sortOn f is equivalent to sortBy (comparing f), but has the performance advantage of only evaluating f once for each element in the input list. This is called the decorate-sort-undecorate paradigm, or Schwartzian transform. Elements are arranged from lowest to highest, keeping duplicates in the order they appeared in the input. The argument must be finite.

    Examples

    >>> sortOn fst [(2, "world"), (4, "!"), (1, "Hello")]
[(1,"Hello"),(2,"world"),(4,"!")]

    >>> sortOn length ["jim", "creed", "pam", "michael", "dwight", "kevin"]
["jim","pam","creed","kevin","dwight","michael"]

    Performance notes

    This function minimises the projections performed, by materialising the projections in an intermediate list. For trivial projections, you should prefer using sortBy with comparing, for example: 
    >>> sortBy (comparing fst) [(3, 1), (2, 2), (1, 3)]
[(1,3),(2,2),(3,1)]
    Or, for the exact same API as sortOn, you can use `sortBy . comparing`: 
    >>> (sortBy . comparing) fst [(3, 1), (2, 2), (1, 3)]
[(1,3),(2,2),(3,1)]

  7. sorter :: XPConfig -> String -> [String] -> [String]

    xmonad-contrib XMonad.Prompt

    Used to sort the possible completions by how well they match the search string (see X.P.FuzzyMatch for an example).

  8. sortByZ :: (a -> a -> Ordering) -> Zipper a -> Zipper a

    xmonad-contrib XMonad.Util.Stack

    Sort a stack with an arbitrary sorting function

  9. sortZ :: Ord a => Zipper a -> Zipper a

    xmonad-contrib XMonad.Util.Stack

    Sort a stack of elements supporting Ord

  10. module Data.Sequence.Internal.Sorting

    WARNING

    This module is considered internal. The Package Versioning Policy does not apply. The contents of this module may change in any way whatsoever and without any warning between minor versions of this package. Authors importing this module are expected to track development closely.

    Description

    This module provides the various sorting implementations for Data.Sequence. Further notes are available in the file sorting.md (in this directory).

Page 73 of many | Previous | Next