Hoogle Search
Within LTS Haskell 24.34 (ghc-9.10.3)
Note that Stackage only displays results for the latest LTS and Nightly snapshot. Learn more.
mapMonoidMap :: DecidablyEmpty b => (a -> b) -> MonoidMap k a -> MonoidMap k bmonoid-map Data.MonoidMap No documentation available.
mapMState :: (MonadIO m, MonadIO n) => (m (a, t) -> n (b, t)) -> MState t m a -> MState t n bmstate Control.Concurrent.MState Map a stateful computation from one (return value, state) pair to another. See Control.Monad.State.Lazy for more information. Be aware that both MStates still share the same state.
mapMState_ :: MonadIO n => (m a -> n b) -> MState t m a -> MState t n bmstate Control.Concurrent.MState No documentation available.
mapBoolSpecIdent :: (String -> String) -> BoolSpec -> BoolSpecogma-language-smv Language.SMV.Substitution No documentation available.
mapNumExprIdent :: (String -> String) -> NumExpr -> NumExprogma-language-smv Language.SMV.Substitution No documentation available.
mapMaybe :: Fractional prob => (a -> Maybe b) -> T prob a -> T prob bprobability Numeric.Probability.Distribution No documentation available.
mapEntry :: (Functor f, HasField s "mapEntry" a) => LensLike' f s aproto-lens-protobuf-types Proto.Google.Protobuf.Descriptor_Fields No documentation available.
-
refined-containers Data.HashMap.Refined Thread an accumularing argument through the map in ascending order of hashes.
-
refined-containers Data.HashMap.Refined Thread an accumularing argument through the map in descending order of hashes.
-
refined-containers Data.HashMap.Refined Apply a function to all values in a map and collect the Left and Right results into separate (disjoint) maps.