class
Reducer
[C, M]
extends AnyRef
Instance Constructors
-
new
Reducer
()(implicit mm: Monoid[M])
Value Members
-
def
!=
(arg0: AnyRef): Boolean
-
def
!=
(arg0: Any): Boolean
-
def
##
(): Int
-
def
&&&
[N]
(r: Reducer[C, N]): Reducer[C, (M, N)]
-
def
==
(arg0: AnyRef): Boolean
-
def
==
(arg0: Any): Boolean
-
def
asInstanceOf
[T0]
: T0
-
def
clone
(): AnyRef
-
def
cons
(c: C, m: M): M
-
def
eq
(arg0: AnyRef): Boolean
-
def
equals
(arg0: Any): Boolean
-
def
finalize
(): Unit
-
def
getClass
(): java.lang.Class[_]
-
def
hashCode
(): Int
-
def
isInstanceOf
[T0]
: Boolean
-
val
monoid
: Monoid[M]
-
def
ne
(arg0: AnyRef): Boolean
-
def
notify
(): Unit
-
def
notifyAll
(): Unit
-
def
snoc
(m: M, c: C): M
-
def
synchronized
[T0]
(arg0: ⇒ T0): T0
-
def
toString
(): String
-
def
unit
(c: C): M
-
def
wait
(): Unit
-
def
wait
(arg0: Long, arg1: Int): Unit
-
def
wait
(arg0: Long): Unit
Inherited from AnyRef
Inherited from Any
A Reducer[C,M] is a Monoid[M] that maps values of type C through
unitto 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 'Generator'. The names 'cons' and 'snoc' work by analogy to the synonymous operations in the list monoid.Minimal definition: 'unit' or 'snoc'
Based on a Haskell library by Edward Kmett