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.

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

    rio RIO.Prelude

    An associative operation NOTE: This method is redundant and has the default implementation mappend = (<>) since base-4.11.0.0. Should it be implemented manually, since mappend is a synonym for (<>), it is expected that the two functions are defined the same way. In a future GHC release mappend will be removed from Monoid.

  2. mapAccumLOf :: LensLike (State acc) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)

    diagrams-lib Diagrams.Prelude

    This generalizes mapAccumL to an arbitrary Traversal. 

    mapAccumL ≡ mapAccumLOf traverse
    mapAccumLOf accumulates State from left to right. 
    mapAccumLOf :: Iso s t a b       -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)
mapAccumLOf :: Lens s t a b      -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)
mapAccumLOf :: Traversal s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)

    mapAccumLOf :: LensLike (State acc) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)
mapAccumLOf l f acc0 s = swap (runState (l (a -> state (acc -> swap (f acc a))) s) acc0)

  3. mapAccumROf :: LensLike (Backwards (State acc)) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)

    diagrams-lib Diagrams.Prelude

    This generalizes mapAccumR to an arbitrary Traversal. 

    mapAccumR ≡ mapAccumROf traverse
    mapAccumROf accumulates State from right to left. 
    mapAccumROf :: Iso s t a b       -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)
mapAccumROf :: Lens s t a b      -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)
mapAccumROf :: Traversal s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)

    mapAccumROf :: LensLike (Backwards (State acc)) s t a b -> (acc -> a -> (acc, b)) -> acc -> s -> (acc, t)

  4. mapEq :: forall k1 k2 (s :: k1) (t :: k2) (a :: k1) (b :: k2) f . AnEquality s t a b -> f s -> f a

    diagrams-lib Diagrams.Prelude

    We can use Equality to do substitution into anything.

  5. mapMOf :: LensLike (WrappedMonad m) s t a b -> (a -> m b) -> s -> m t

    diagrams-lib Diagrams.Prelude

    Map each element of a structure targeted by a Lens to a monadic action, evaluate these actions from left to right, and collect the results. 

    >>> mapMOf both (\x -> [x, x + 1]) (1,3)
[(1,3),(1,4),(2,3),(2,4)]

    mapM ≡ mapMOf traverse
imapMOf l ≡ forM l . Indexed

    mapMOf :: Monad m => Iso s t a b       -> (a -> m b) -> s -> m t
mapMOf :: Monad m => Lens s t a b      -> (a -> m b) -> s -> m t
mapMOf :: Monad m => Traversal s t a b -> (a -> m b) -> s -> m t

  6. mapMOf_ :: Monad m => Getting (Sequenced r m) s a -> (a -> m r) -> s -> m ()

    diagrams-lib Diagrams.Prelude

    Map each target of a Fold on a structure to a monadic action, evaluate these actions from left to right, and ignore the results. 

    >>> mapMOf_ both putStrLn ("hello","world")
hello
world

    mapM_ ≡ mapMOf_ folded

    mapMOf_ :: Monad m => Getter s a     -> (a -> m r) -> s -> m ()
mapMOf_ :: Monad m => Fold s a       -> (a -> m r) -> s -> m ()
mapMOf_ :: Monad m => Lens' s a      -> (a -> m r) -> s -> m ()
mapMOf_ :: Monad m => Iso' s a       -> (a -> m r) -> s -> m ()
mapMOf_ :: Monad m => Traversal' s a -> (a -> m r) -> s -> m ()
mapMOf_ :: Monad m => Prism' s a     -> (a -> m r) -> s -> m ()

  7. mapOf :: ASetter s t a b -> (a -> b) -> s -> t

    diagrams-lib Diagrams.Prelude

    mapOf is a deprecated alias for over.

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

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

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

Page 6 of many | Previous | Next