Hoogle Search

Within LTS Haskell 24.38 (ghc-9.10.3)

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

  1. mapAndUnzipM :: Applicative m => (a -> m (b, c)) -> [a] -> m ([b], [c])

    protolude Protolude.Monad

    The mapAndUnzipM function maps its first argument over a list, returning the result as a pair of lists. This function is mainly used with complicated data structures or a state monad.

  2. mapo :: (forall y . () => (Fix f -> y) -> (x -> y) -> x -> f y) -> x -> Fix f

    recursion-schemes Data.Functor.Foldable

    Mendler-style corecursion

  3. mapMonotonic :: (a -> c) -> Bimap a b -> Bimap c b

    bimap Data.Bimap

    O(n). Map a strictly increasing function over all left keys in the map. The precondition is not checked. Version 0.3

  4. mapMonotonicR :: (b -> c) -> Bimap a b -> Bimap a c

    bimap Data.Bimap

    O(n). Map a strictly increasing function over all right keys in the map. The precondition is not checked. Version 0.3

  5. mapR :: Ord c => (b -> c) -> Bimap a b -> Bimap a c

    bimap Data.Bimap

    O(n*log n) Map a function over all the right keys in the map. Version 0.3

  6. mapCArrayInPlace :: (Ix i, Storable e) => (e -> e) -> CArray i e -> CArray i e

    carray Data.Array.CArray.Base

    In-place map on CArray. Note that this is IN PLACE so you should not retain any reference to the original. It flagrantly breaks referential transparency!

  7. mapException :: (Exception e1, Exception e2) => (e1 -> e2) -> a -> a

    graphviz Data.GraphViz.Exception

    This function maps one exception into another as proposed in the paper "A semantics for imprecise exceptions".

  8. mapDotGraph :: (DotRepr dg n, DotRepr dg n') => (n -> n') -> dg n -> dg n'

    graphviz Data.GraphViz.Types

    Change the node values. This function is assumed to be injective, otherwise the resulting graph will not be identical to the original (modulo labels).

  9. mapAccounts :: (Account -> Account) -> Account -> Account

    hledger-lib Hledger.Data.Account

    Map a (non-tree-structure-modifying) function over this and sub accounts.

  10. maPlus :: MixedAmount -> MixedAmount -> MixedAmount

    hledger-lib Hledger.Data.Amount

    Sum two MixedAmount, keeping the cost of the first if any. Amounts with different costs are kept separate (since 2021).

Page 162 of many | Previous | Next