JavaScript is disabled on your browser.
Description
Method Summary
Method Details
identity()
reduceLeft(Iterable)
reduceRight(Iterable)
foldMap(Fn1, Iterable)
foldLeft(A, Iterable)
foldRight(A, Iterable)
flip()
monoid(Semigroup, A)
monoid(Semigroup, Fn0)
Type Parameters:
A - the element type this Monoid is formed over
All Superinterfaces:
Applicative <Fn1 <A,A>,Fn1 <A,?>>, Cartesian <A,Fn1 <A,A>,Fn1 <?,?>>, Cocartesian <A,Fn1 <A,A>,Fn1 <?,?>>, Contravariant <A, Profunctor <?,Fn1 <A,A>,Fn1 <?,?>>>, Fn1 <A,Fn1 <A,A>>, Fn2 <A,A,A>, Functor <Fn1 <A,A>,Fn1 <A,?>>, Monad <Fn1 <A,A>,Fn1 <A,?>>, MonadReader <A,Fn1 <A,A>,Fn1 <A,?>>, MonadRec <Fn1 <A,A>,Fn1 <A,?>>, MonadWriter <A,Fn1 <A,A>,Fn1 <A,?>>, Profunctor <A,Fn1 <A,A>,Fn1 <?,?>>, Semigroup <A>
All Known Implementing Classes:
And , Concat , Endo , First , Join , Last , MergeHMaps , Or , PutAll , Trivial , Union , Xor
Method Summary
All Methods Static Methods Instance Methods Abstract Methods Default Methods
Flip the order of the arguments.
Catamorphism under this semigroup using
FoldLeft, where the binary operator is this semigroup, and the
starting accumulator is provided.
Homomorphism combined with catamorphism.
Catamorphism under this semigroup using
FoldRight, where the binary operator is this semigroup, and the
starting accumulator is provided.
The identity element of this monoid.
Catamorphism under this monoid using
ReduceLeft, where the result is the reduction, or, if empty, the
identity of this monoid.
Catamorphism under this monoid using
ReduceRight, where the result is the reduction, or, if empty, the
identity of this monoid.
Methods inherited from interface Fn1
andThen , carry , cartesian , censor , choose , cocartesian , diMap , diMapR , discardL , flatMap , fmap , lazyZip , listens , local , pure , self , thunk , toFunction , trampolineM , zip , zip
Methods inherited from interface Fn2
apply , apply , checkedApply , checkedApply , compose , contraMap , diMapL , discardR , toBiFunction , uncurry , widen