Hoogle Search
Within LTS Haskell 24.33 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapMonotonic :: (a -> c) -> Bimap a b -> Bimap c bbimap Data.Bimap O(n). Map a strictly increasing function over all left keys in the map. The precondition is not checked. Version 0.3
mapMonotonicR :: (b -> c) -> Bimap a b -> Bimap a cbimap Data.Bimap O(n). Map a strictly increasing function over all right keys in the map. The precondition is not checked. Version 0.3
mapR :: Ord c => (b -> c) -> Bimap a b -> Bimap a cbimap Data.Bimap O(n*log n) Map a function over all the right keys in the map. Version 0.3
mapCArrayInPlace :: (Ix i, Storable e) => (e -> e) -> CArray i e -> CArray i ecarray 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!
mapException :: (Exception e1, Exception e2) => (e1 -> e2) -> a -> agraphviz Data.GraphViz.Exception This function maps one exception into another as proposed in the paper "A semantics for imprecise exceptions".
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).
mapAccounts :: (Account -> Account) -> Account -> Accounthledger-lib Hledger.Data.Account Map a (non-tree-structure-modifying) function over this and sub accounts.
maPlus :: MixedAmount -> MixedAmount -> MixedAmounthledger-lib Hledger.Data.Amount Sum two MixedAmount, keeping the cost of the first if any. Amounts with different costs are kept separate (since 2021).
mapMixedAmount :: (Amount -> Amount) -> MixedAmount -> MixedAmounthledger-lib Hledger.Data.Amount Apply a transform to a mixed amount's component Amounts.
mapM' :: Monad f => (a -> f b) -> [a] -> f [b]hledger-lib Hledger.Utils Like mapM but uses sequence'.