Reducer

A Reducer[C,M] is a scalaz.Monoid[M] that maps values of type C through unit to values of type M. A C-Reducer may also supply operations which tack on another C to an existing Monoid M on the left or right. These specialized reductions may be more efficient in some scenarios and are used when appropriate by a scalaz.Generator. The names cons and snoc work by analogy to the synonymous operations in the list monoid.

Minimal definition: unit or snoc

Based on the Reducer Haskell library by Edward Kmett (https://hackage.haskell.org/package/reducers).

Source: Reducer.scala

Linear Supertypes

AnyRef, Any

Known Subclasses

UnitReducer

Type Members

trait ReducerLaw extends AnyRef

Abstract Value Members

abstract def cons(c: C, m: M): M

Faster append(unit(c), m).
implicit abstract def monoid: Monoid[M]
abstract def snoc(m: M, c: C): M

Faster append(m, unit(c)).
abstract def unit(c: C): M

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def append(a1: M, a2: ⇒ M): M
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def compose[N](r: Reducer[C, N]): Reducer[C, (M, N)]

Distribute Cs to M and N.
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def reducerLaw: ReducerLaw
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
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

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def zero: M

Related Docs: object Reducer | package scalaz

sealed abstract class Reducer[C, M] extends AnyRef

Type Members

trait ReducerLaw extends AnyRef

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)]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def reducerLaw: ReducerLaw

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

Inherited from AnyRef

Inherited from Any

Ungrouped