Hoogle Search

Within LTS Haskell 24.4 (ghc-9.10.2)

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

Exact lookup

1. mapThese :: ((a, b) -> (a, b)) -> These a b -> These a b

   these	Data.These.Combinators

   No documentation available.

2. mapThis :: (a -> a) -> These a b -> These a b

   these	Data.These.Combinators

   No documentation available.

3. mapC :: Constructor -> Converter

   haskell-gi	Data.GI.CodeGen.Conversions

   No documentation available.

4. mapM_ :: Monad m => (a -> m ()) -> FoldM m a ()

   foldl	Control.Foldl

   Converts an effectful function to a fold. Specialized version of sink.

5. mapped__ :: (Mapping p, Functor f) => Optic__ p i i (f a) (f b) a b

   optics-core	Optics.Internal.Setter

   Internal implementation of mapped.

6. mapping :: forall (is :: IxList) . (MappingOptic k f g s t a b, AcceptsEmptyIndices "mapping" is) => Optic k is s t a b -> Optic (MappedOptic k) is (f s) (g t) (f a) (g b)

   optics-core	Optics.Mapping

   The mapping can be used to lift optic through a Functor.

   mapping :: Iso    s t a b -> Iso    (f s) (g t) (f a) (g b)
   mapping :: Lens   s   a   -> Getter (f s)       (f a)
   mapping :: Getter s   a   -> Getter (f s)       (f a)
   mapping :: Prism    t   b -> Review       (g t)       (g b)
   mapping :: Review   t   b -> Review       (g t)       (g b)
   

7. mapped :: Functor f => Setter (f a) (f b) a b

   optics-core	Optics.Setter

   Create a Setter for a Functor.

   over mapped ≡ fmap
   

8. mapAccumLOf :: forall k (is :: IxList) s t a b acc . Is k A_Traversal => Optic k is s t a b -> (acc -> a -> (b, acc)) -> acc -> s -> (t, acc)

   optics-core	Optics.Traversal

   This generalizes mapAccumL to an arbitrary Traversal.

   mapAccumL ≡ mapAccumLOf traverse
   

   mapAccumLOf accumulates State from left to right.

9. mapAccumROf :: forall k (is :: IxList) s t a b acc . Is k A_Traversal => Optic k is s t a b -> (acc -> a -> (b, acc)) -> acc -> s -> (t, acc)

   optics-core	Optics.Traversal

   This generalizes mapAccumR to an arbitrary Traversal.

   mapAccumR ≡ mapAccumROf traversed
   

   mapAccumROf accumulates State from right to left.

10. mapState :: forall (g :: Type -> Type) a b . Functor g => ((a, Rep g) -> (b, Rep g)) -> State g a -> State g b

    adjunctions	Control.Monad.Representable.State

    Map both the return value and final state of a computation using the given function.

    • runState (mapState f m) = f . runState
      m

Page 116 of many | Previous | Next