UnitReducer

implicit abstract def monoid: Monoid[M]

abstract def unit(c: C): M

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

Distribute Cs to M and N.

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

Faster append(unit(c), m).

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

def snoc(m: M, c: C): M

Faster append(m, unit(c)).

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