sealed abstract
class
Reducer[C, M] extends AnyRef
Instance Constructors
-
new
Reducer()
Abstract Value Members
-
abstract
def
cons(c: C, m: M): M
-
implicit abstract
def
monoid: Monoid[M]
-
abstract
def
snoc(m: M, c: C): M
-
abstract
def
unit(c: C): M
Concrete Value Members
-
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
-
final
def
==(arg0: Any): Boolean
-
def
append(a1: M, a2: ⇒ M): M
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
compose[N](r: Reducer[C, N]): Reducer[C, (M, N)]
-
-
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
final
def
isInstanceOf[T0]: Boolean
-
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
final
def
unfoldl[B](seed: B)(f: (B) ⇒ Maybe[(B, C)]): M
-
def
unfoldr[B](seed: B)(f: (B) ⇒ Maybe[(C, B)]): M
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
zero: M
A
Reducer[C,M]is a scalaz.Monoid[M]that maps values of typeCthroughunitto values of typeM. AC-Reducermay also supply operations which tack on anotherCto an existingMonoidMon the left or right. These specialized reductions may be more efficient in some scenarios and are used when appropriate by a scalaz.Generator. The namesconsandsnocwork by analogy to the synonymous operations in the list monoid.Minimal definition:
unitorsnocBased on the Reducer Haskell library by Edward Kmett (https://hackage.haskell.org/package/reducers).