Hoogle Search

Within LTS Haskell 24.35 (ghc-9.10.3)

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

  1. 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.

  2. commonTypesMap :: MIMETypeData -> Map String String

    MissingH Data.MIME.Types

    A mapping used to augment the typesMap when non-strict lookups are used.

  3. encodingsMap :: MIMETypeData -> Map String String

    MissingH Data.MIME.Types

    A mapping used to determine the encoding of a file. This is used, for instance, to map ".gz" to "gzip".

  4. suffixMap :: MIMETypeData -> Map String String

    MissingH Data.MIME.Types

    A mapping used to expand common suffixes into equivolent, better-parsed versions. For instance, ".tgz" would expand into ".tar.gz".

  5. typesMap :: MIMETypeData -> Map String String

    MissingH Data.MIME.Types

    A mapping used to map extensions to MIME types.

  6. lazyMapM :: (a -> IO b) -> [a] -> IO [b]

    MissingH System.IO.Utils

    Applies a given function to every item in a list, and returns the new list. Unlike the system's mapM, items are evaluated lazily.

  7. type StreamMap = StreamArrow (->)

    arrows Control.Arrow.Transformer.Stream

    Mappings of streams

  8. type StreamMapST s = StreamArrow Kleisli ST s

    arrows Control.Arrow.Transformer.Stream

    In-place state updates. Note: this is an arrow type, and lift can be used to promote arrows from Kleisli (ST s): the resulting arrow updates the state for each stream element in turn, and as long as the final state in not required all is well. However, lift does not preserve composition, because this monad isn't commutative. In particular, a composition of lifts of state transformers will not work, as the second will require the final state of the first.

  9. package bimap

    Bidirectional mapping between two key types A data structure representing a bidirectional mapping between two key types. Each value in the bimap is associated with exactly one value of the opposite type.

  10. module Data.Bimap

    An implementation of bidirectional maps between values of two key types. A Bimap is essentially a bijection between subsets of its two argument types. Each element of the left-hand type is associated with an element of the right-hand type, and vice-versa, such that the two mappings are inverses. Deleting an element will cause its twin to be deleted, and inserting a pair of elements will cause any overlapping bindings to be deleted. Most functions implicitly consider the left-hand type to be the key, and the right-hand type to be the value. Functions with an R suffix reverse this convention, treating the right-hand type as the key and the left-hand type as the value.

Page 573 of many | Previous | Next