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 :: YouTubeAnalyticsReportsQuery -> Maybe Text

    gogol-youtube-analytics Gogol.YouTubeAnalytics.Reports.Query

    A comma-separated list of dimensions or metrics that determine the sort order for YouTube Analytics data. By default the sort order is ascending. The '-' prefix causes descending sort order.", pattern: [-0-9a-zA-Z,]+

  2. sort :: MonadDOM m => URLSearchParams -> m ()

    jsaddle-dom JSDOM.Generated.URLSearchParams

    Mozilla URLSearchParams.sort documentation

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

    listsafe Data.List.Safe

    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 :: Lens' Trace (Maybe Bool)

    plotlyhs Graphics.Plotly

    No documentation available.

  5. sort :: Lens' Trace (Maybe Bool)

    plotlyhs Graphics.Plotly.Base

    No documentation available.

  6. sort :: forall (m :: Type -> Type) a . (Monad m, FromByteString a) => Key -> Opts "SORT" -> Redis m [a]

    redis-resp Data.Redis.Command

    No documentation available.

  7. sort :: (Functor f, HasField s "sort" a) => LensLike' f s a

    riak-protobuf Data.Riak.Proto

    No documentation available.

  8. package sort

    A Haskell sorting toolkit A library of general-purpose sorting utilities.

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

    sort Data.Sort

    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 :: Configuration -> Sort

    sphinx Text.Search.Sphinx

    Match sorting mode

Page 10 of many | Previous | Next