Hoogle Search

Within LTS Haskell 24.62 (ghc-9.10.3)

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

Exact lookup

1. mapWS :: forall r ix b r' a s m . (Source r' a, Manifest r b, Index ix, MonadUnliftIO m, PrimMonad m) => WorkerStates s -> (a -> s -> m b) -> Array r' ix a -> m (Array r ix b)

   massiv	Data.Massiv.Array

   Same as imapWS, but without the index.

2. mapStencil :: (Index ix, Manifest r e) => Border e -> Stencil ix e a -> Array r ix e -> Array DW ix a

   massiv	Data.Massiv.Array.Stencil

   Map a constructed stencil over an array. Resulting array must be computed in order to be useful.

3. mappendL :: m -> (m :+: n) -> m :+: n

   monoid-extras	Data.Monoid.Coproduct

   Prepend a value from the left monoid.

4. mappendR :: n -> (m :+: n) -> m :+: n

   monoid-extras	Data.Monoid.Coproduct

   Prepend a value from the right monoid.

5. mapKeys :: (Eq k', Hashable k') => (k -> k') -> InsOrdHashMap k v -> InsOrdHashMap k' v

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   Order preserving mapping of keys.

6. mapMaybe :: (v1 -> Maybe v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   No documentation available.

7. mapMaybeWithKey :: (k -> v1 -> Maybe v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   No documentation available.

8. mapWithKey :: (k -> v1 -> v2) -> InsOrdHashMap k v1 -> InsOrdHashMap k v2

   openapi3	Data.HashMap.Strict.InsOrd.Compat

   No documentation available.

9. mapping :: HasMapping s a => Lens' s a

   openapi3	Data.OpenApi.Lens

   No documentation available.

10. mapInstr :: forall instr1 instr2 (m :: Type -> Type) a . Monad m => (forall x . () => instr1 x -> instr2 x) -> ProgramT instr1 m a -> ProgramT instr2 m a

    operational	Control.Monad.Operational

    Extend a mapping of instructions to a mapping of ProgramT.

Page 201 of many | Previous | Next