Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

  1. fmapOpt :: (a -> b) -> OptDescr a -> OptDescr b

    snap-server Snap.Internal.Http.Server.Config

    No documentation available.

  2. module Language.Haskell.TH.Desugar.OMap

    An OMap behaves much like a Map, with all the same asymptotics, but also remembers the order that keys were inserted. This module offers a simplified version of the Data.Map.Ordered API that assumes left-biased indices everywhere and uses a different Semigroup instance (the one in this module uses (<>) = union) and Monoid instance (the one in this module uses mappend = union).

  3. newtype OMap k v

    th-desugar Language.Haskell.TH.Desugar.OMap

    An ordered map whose insertPre, insertPost, intersection, intersectionWithKey, union, and unionWithKey operations are biased towards leftmost indices when when breaking ties between keys.

  4. OMap :: Bias L (OMap k v) -> OMap k v

    th-desugar Language.Haskell.TH.Desugar.OMap

    No documentation available.

  5. toMap :: OMap k v -> Map k v

    th-desugar Language.Haskell.TH.Desugar.OMap

    No documentation available.

  6. newtype OMap k v

    th-desugar Language.Haskell.TH.Desugar.OMap.Strict

    An ordered map whose insertPre, insertPost, intersection, intersectionWithKey, union, and unionWithKey operations are biased towards leftmost indices when when breaking ties between keys.

  7. OMap :: Bias L (OMap k v) -> OMap k v

    th-desugar Language.Haskell.TH.Desugar.OMap.Strict

    No documentation available.

  8. toMap :: OMap k v -> Map k v

    th-desugar Language.Haskell.TH.Desugar.OMap.Strict

    No documentation available.

  9. module Text.XML.HaXml.TypeMapping

    No documentation available.

  10. wholeMap :: WholeFunc a b -> [a] -> [b]

    MissingH Data.List.Utils

    This is an enhanced version of the concatMap or map functions in Data.List. Unlike those functions, this one:

    • Can consume a varying number of elements from the input list during each iteration
    • Can arbitrarily decide when to stop processing data
    • Can return a varying number of elements to insert into the output list
    • Can actually switch processing functions mid-stream
    • Is not even restricted to processing the input list intact
    The function used by wholeMap, of type WholeFunc, is repeatedly called with the input list. The function returns three things: the function to call for the next iteration (if any), what remains of the input list, and the list of output elements generated during this iteration. The return value of wholeMap is the concatenation of the output element lists from all iterations. Processing stops when the remaining input list is empty. An example of a WholeFunc is fixedWidth.

Page 572 of many | Previous | Next