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.
mapWithKey :: (k -> v1 -> v2) -> Map k v1 -> Map k v2monoidmap-internal Data.MonoidMap.Internal.RecoveredMap No documentation available.
mapContM :: (a -> (b -> m c) -> m c) -> [a] -> ([b] -> m c) -> m cmtl-misc-yj Control.Monad.Cont.MiscYj No documentation available.
mapEither :: (Key -> Either Key Key) -> IntMultiSet -> (IntMultiSet, IntMultiSet)multiset Data.IntMultiSet mapMaybe :: (Key -> Maybe Key) -> IntMultiSet -> IntMultiSetmultiset Data.IntMultiSet O(n). Map and collect the Just results.
mapMonotonic :: (Key -> Key) -> IntMultiSet -> IntMultiSetmultiset Data.IntMultiSet O(n). mapMonotonic f s == map f s, but works only when f is strictly monotonic. The precondition is not checked. Semi-formally, we have:
and [x < y ==> f x < f y | x <- ls, y <- ls] ==> mapMonotonic f s == map f s where ls = toList s
mapEither :: (Ord b, Ord c) => (a -> Either b c) -> MultiSet a -> (MultiSet b, MultiSet c)multiset Data.MultiSet mapMaybe :: Ord b => (a -> Maybe b) -> MultiSet a -> MultiSet bmultiset Data.MultiSet O(n). Map and collect the Just results.
mapMonotonic :: (a -> b) -> MultiSet a -> MultiSet bmultiset Data.MultiSet O(n). mapMonotonic f s == map f s, but works only when f is strictly monotonic. The precondition is not checked. Semi-formally, we have:
and [x < y ==> f x < f y | x <- ls, y <- ls] ==> mapMonotonic f s == map f s where ls = toList s
-
multistate Control.Monad.Trans.MultiGST No documentation available.
-
multistate Control.Monad.Trans.MultiGST.Lazy No documentation available.