Hoogle Search

Within LTS Haskell 24.33 (ghc-9.10.3)

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

Exact lookup

1. mapTail :: (f a -> g a) -> T f a -> T g a

   non-empty	Data.NonEmpty

   No documentation available.

2. mapWithKey :: Ord k => (k -> a -> b) -> T k a -> T k b

   non-empty	Data.NonEmpty.Map

   No documentation available.

3. mapAdjacent :: (Cons f, Zip f) => (a -> a -> b) -> T f a -> f b

   non-empty	Data.NonEmpty.Mixed

   No documentation available.

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

   optics-core	Optics.Internal.Setter

   Internal implementation of mapped.

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

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

   optics-core	Optics.Setter

   Create a Setter for a Functor.

   over mapped ≡ fmap
   

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

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

9. mapRand :: ((a, g) -> (b, g)) -> Rand g a -> Rand g b

   MonadRandom	Control.Monad.Random.Lazy

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

   • runRand (mapRand f m) = f . runRand
     m

10. mapRandT :: (m (a, g) -> n (b, g)) -> RandT g m a -> RandT g n b

    MonadRandom	Control.Monad.Random.Lazy

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

    • runRandT (mapRandT f m) = f . runRandT
      m

Page 118 of many | Previous | Next