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. pattern SortSpec_SortOrder_Descending :: SortSpec_SortOrder

    gogol-sheets Gogol.Sheets.Types

    Sort descending.

  2. pattern SortSpec_SortOrder_SORTORDERUNSPECIFIED :: SortSpec_SortOrder

    gogol-sheets Gogol.Sheets.Types

    Default value, do not use this.

  3. data SortKey

    natural-sort Algorithms.NaturalSort

    No documentation available.

  4. SortExtended :: Sort

    sphinx Text.Search.Sphinx.Types

    No documentation available.

  5. module XMonad.Layout.SortedLayout

    A LayoutModifier that sorts the windows in another layout, given a list of properties. The order of properties in the list determines the order of windows in the final layout. Any unmatched windows go to the end of the order.

  6. data TypeLitSort

    base Type.Reflection.Unsafe

    No documentation available.

  7. data TypeLitSort

    base GHC.Base

    No documentation available.

  8. c_sort :: Ptr Word8 -> CSize -> IO ()

    bytestring Data.ByteString.Internal

    No documentation available.

  9. reverseTopSort :: Graph -> [Vertex]

    containers Data.Graph

    Reverse ordering of topSort. See note in topSort.

  10. topSort :: Graph -> [Vertex]

    containers Data.Graph

    A topological sort of the graph. The order is partially specified by the condition that a vertex i precedes j whenever j is reachable from i but not vice versa. Note: A topological sort exists only when there are no cycles in the graph. If the graph has cycles, the output of this function will not be a topological sort. In such a case consider using scc.

Page 92 of many | Previous | Next