Hoogle Search

Within LTS Haskell 24.36 (ghc-9.10.3)

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

  1. bifoldMap1 :: (Bifoldable1 t, Semigroup m) => (a -> m) -> (b -> m) -> t a b -> m

    base Data.Bifoldable1

    No documentation available.

  2. bimap :: Bifunctor p => (a -> b) -> (c -> d) -> p a c -> p b d

    base Data.Bifunctor

    Map over both arguments at the same time. 

    bimap f g ≡ first f . second g

    Examples

    >>> bimap toUpper (+1) ('j', 3)
('J',4)

    >>> bimap toUpper (+1) (Left 'j')
Left 'J'

    >>> bimap toUpper (+1) (Right 3)
Right 4

  3. bifoldMapDefault :: (Bitraversable t, Monoid m) => (a -> m) -> (b -> m) -> t a b -> m

    base Data.Bitraversable

    A default definition of bifoldMap in terms of the Bitraversable operations. 

    bifoldMapDefault f g ≡
getConst . bitraverse (Const . f) (Const . g)

  4. bimapAccumL :: Bitraversable t => (a -> b -> (a, c)) -> (a -> d -> (a, e)) -> a -> t b d -> (a, t c e)

    base Data.Bitraversable

    The bimapAccumL function behaves like a combination of bimap and bifoldl; it traverses a structure from left to right, threading a state of type a and using the given actions to compute new elements for the structure.

    Examples

    Basic usage: 
    >>> bimapAccumL (\acc bool -> (acc + 1, show bool)) (\acc string -> (acc * 2, reverse string)) 3 (True, "foo")
(8,("True","oof"))

  5. bimapAccumR :: Bitraversable t => (a -> b -> (a, c)) -> (a -> d -> (a, e)) -> a -> t b d -> (a, t c e)

    base Data.Bitraversable

    The bimapAccumR function behaves like a combination of bimap and bifoldr; it traverses a structure from right to left, threading a state of type a and using the given actions to compute new elements for the structure.

    Examples

    Basic usage: 
    >>> bimapAccumR (\acc bool -> (acc + 1, show bool)) (\acc string -> (acc * 2, reverse string)) 3 (True, "foo")
(7,("True","oof"))

  6. bimapDefault :: Bitraversable t => (a -> b) -> (c -> d) -> t a c -> t b d

    base Data.Bitraversable

    A default definition of bimap in terms of the Bitraversable operations. 

    bimapDefault f g ≡
runIdentity . bitraverse (Identity . f) (Identity . g)

  7. bimapM :: (Bitraversable t, Applicative f) => (a -> f c) -> (b -> f d) -> t a b -> f (t c d)

    base Data.Bitraversable

    Alias for bitraverse.

  8. gmapM :: (Data a, Monad m) => (forall d . Data d => d -> m d) -> a -> m a

    base Data.Data

    A generic monadic transformation that maps over the immediate subterms The default definition instantiates the type constructor c in the type of gfoldl to the monad datatype constructor, defining injection and projection using return and >>=.

  9. gmapMo :: (Data a, MonadPlus m) => (forall d . Data d => d -> m d) -> a -> m a

    base Data.Data

    Transformation of one immediate subterm with success

  10. gmapMp :: (Data a, MonadPlus m) => (forall d . Data d => d -> m d) -> a -> m a

    base Data.Data

    Transformation of at least one immediate subterm does not fail

Page 398 of many | Previous | Next