Modulereducers-3.12.5Haskell2010

Data.Semigroup.Applicative

Semigroups for working with Applicative Functors.

Synopsis

newtype Traversal
newtype Ap

Packagereducers-3.12.5
Exports2
LanguageHaskell2010
LicenceBSD-3-Clause
SourceApplicative.hs

newtypenewtype Traversal (f :: Type -> Type)

A Traversal uses an glues together Applicative actions with (*>) in the manner of traverse_ from Data.Foldable. Any values returned by reduced actions are discarded.

Constructors

Traversal
- getTraversal :: f ()

Instances3Semigroup, Monoid, Reducer

Applicative f => Semigroup (Traversal f)Defined in reducers-3.12.5 · Data.Semigroup.Applicative
Applicative f => Monoid (Traversal f)Defined in reducers-3.12.5 · Data.Semigroup.Applicative
Applicative f => Reducer (f a) (Traversal f)Defined in reducers-3.12.5 · Data.Semigroup.Applicative

newtypenewtype Ap (f :: Type -> Type) m

Constructors

Ap
- getAp :: f m

Instances5Functor, Applicative, Reducer, Semigroup, Monoid

Functor f => Functor (Ap f)Defined in reducers-3.12.5 · Data.Semigroup.Applicative
Applicative f => Applicative (Ap f)Defined in reducers-3.12.5 · Data.Semigroup.Applicative
(Applicative f, Reducer c m) => Reducer (f c) (Ap f m)Defined in reducers-3.12.5 · Data.Semigroup.Applicative
(Applicative f, Semigroup m) => Semigroup (Ap f m)Defined in reducers-3.12.5 · Data.Semigroup.Applicative
(Applicative f, Monoid m) => Monoid (Ap f m)Defined in reducers-3.12.5 · Data.Semigroup.Applicative