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. mapped :: forall (f :: Type -> Type) a b . Functor f => Setter (f a) (f b) a b

   diagrams-lib	Diagrams.Prelude

   This Setter can be used to map over all of the values in a Functor.

   fmap ≡ over mapped
   fmapDefault ≡ over traverse
   (<$) ≡ set mapped
   

   >>> over mapped f [a,b,c]
   [f a,f b,f c]
   

   >>> over mapped (+1) [1,2,3]
   [2,3,4]
   

   >>> set mapped x [a,b,c]
   [x,x,x]
   

   >>> [[a,b],[c]] & mapped.mapped +~ x
   [[a + x,b + x],[c + x]]
   

   >>> over (mapped._2) length [("hello","world"),("leaders","!!!")]
   [("hello",5),("leaders",3)]
   

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

   If you want an IndexPreservingSetter use setting fmap.

2. mapping :: forall (f :: Type -> Type) (g :: Type -> Type) s t a b . (Functor f, Functor g) => AnIso s t a b -> Iso (f s) (g t) (f a) (g b)

   diagrams-lib	Diagrams.Prelude

   This can be used to lift any Iso into an arbitrary Functor.

3. mappingNamer :: (String -> [String]) -> FieldNamer

   diagrams-lib	Diagrams.Prelude

   Create a FieldNamer from a mapping function. If the function returns [], it creates no lens for the field.

4. mapSegmentVectors :: (v n -> v' n') -> Segment c v n -> Segment c v' n'

   diagrams-lib	Diagrams.Segment

   Map over the vectors of each segment.

5. mapAccumL :: TextualMonoid t => (a -> Char -> (a, Char)) -> a -> t -> (a, t)

   monoid-subclasses	Data.Monoid.Textual

   Equivalent to mapAccumL from Data.List when applied to a String, but preserves all non-character data.

6. mapAccumR :: TextualMonoid t => (a -> Char -> (a, Char)) -> a -> t -> (a, t)

   monoid-subclasses	Data.Monoid.Textual

   Equivalent to mapAccumR from Data.List when applied to a String, but preserves all non-character data.

7. mapM :: (Factorial a, Semigroup b, Monoid b, Monad m) => (a -> m b) -> a -> m b

   monoid-subclasses	Data.Semigroup.Factorial

   A mapM equivalent.

8. mapM_ :: (Factorial a, Applicative m) => (a -> m b) -> a -> m ()

   monoid-subclasses	Data.Semigroup.Factorial

   A mapM_ equivalent.

9. mapMaybe :: (a -> Maybe b) -> [a] -> [b]

   Cabal-syntax	Distribution.Compat.Prelude

   No documentation available.

10. mappend :: Monoid a => a -> a -> a

    Cabal-syntax	Distribution.Compat.Prelude

    No documentation available.

Page 132 of many | Previous | Next