Hoogle Search

Within LTS Haskell 24.28 (ghc-9.10.3)

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

Exact lookup

1. mapAccumM :: (Monad m, MonadPlus p) => (acc -> x -> m (acc, y)) -> acc -> [x] -> m (acc, p y)

   monadlist	Control.Monad.ListM

   No documentation available.

2. mapMP :: (Monad m, MonadPlus p) => (a -> m b) -> [a] -> m (p b)

   monadlist	Control.Monad.ListM

   No documentation available.

3. mapMonoidMap :: DecidablyEmpty b => (a -> b) -> MonoidMap k a -> MonoidMap k b

   monoid-map	Data.MonoidMap

   No documentation available.

4. mapMState :: (MonadIO m, MonadIO n) => (m (a, t) -> n (b, t)) -> MState t m a -> MState t n b

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

5. mapMState_ :: MonadIO n => (m a -> n b) -> MState t m a -> MState t n b

   mstate	Control.Concurrent.MState

   No documentation available.

6. mapBoolSpecIdent :: (String -> String) -> BoolSpec -> BoolSpec

   ogma-language-smv	Language.SMV.Substitution

   No documentation available.

7. mapNumExprIdent :: (String -> String) -> NumExpr -> NumExpr

   ogma-language-smv	Language.SMV.Substitution

   No documentation available.

8. mapMaybe :: Fractional prob => (a -> Maybe b) -> T prob a -> T prob b

   probability	Numeric.Probability.Distribution

   No documentation available.

9. mapEntry :: (Functor f, HasField s "mapEntry" a) => LensLike' f s a

   proto-lens-protobuf-types	Proto.Google.Protobuf.Descriptor_Fields

   No documentation available.

10. mapAccumLWithKey :: forall s k a b c . (a -> Key s k -> b -> (a, c)) -> a -> HashMap s k b -> (a, HashMap s k c)

    refined-containers	Data.HashMap.Refined

    Thread an accumularing argument through the map in ascending order of hashes.

Page 344 of many | Previous | Next