Hoogle Search

Within LTS Haskell 24.40 (ghc-9.10.3)

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

Exact lookup

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

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

   mstate	Control.Concurrent.MState

   No documentation available.

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

   ogma-language-smv	Language.SMV.Substitution

   No documentation available.

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

   ogma-language-smv	Language.SMV.Substitution

   No documentation available.

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

   probability	Numeric.Probability.Distribution

   No documentation available.

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

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

   No documentation available.

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

8. mapAccumRWithKey :: 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 descending order of hashes.

9. mapEither :: forall s k a b c . Hashable k => (a -> Either b c) -> HashMap s k a -> Some2HashMapWith (PartitionProof 'Hashed s k) k b c

   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.

10. mapEitherWithKey :: forall s k a b c . Hashable k => (Key s k -> a -> Either b c) -> HashMap s k a -> Some2HashMapWith (PartitionProof 'Hashed s k) k b c

    refined-containers	Data.HashMap.Refined

    Apply a function to all values in a map, together with their corresponding keys, and collect the Left and Right results into separate (disjoint) maps.

Page 348 of many | Previous | Next