Monoid

abstract def plus(x: T, y: T): T

abstract def zero: T

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def additive: algebra.Monoid[T]

These are from algebra.Monoid

final def asInstanceOf[T0]: T0

def assertNotZero(v: T): Unit

def clone(): AnyRef

def combine(l: T, r: T): T

def combineAll(t: TraversableOnce[T]): T

def combineAllOption(as: IterableOnce[T]): Option[T]

def combineN(a: T, n: Int): T

def empty: T

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def hashCode(): Int

def isEmpty(a: T)(implicit ev: Eq[T]): Boolean

final def isInstanceOf[T0]: Boolean

def isNonZero(v: T): Boolean

def isZero(a: T)(implicit ev: Eq[T]): Boolean

final def ne(arg0: AnyRef): Boolean

def nonZeroOption(v: T): Option[T]

final def notify(): Unit

final def notifyAll(): Unit

def positiveSumN(a: T, n: Int): T

def repeatedCombineN(a: T, n: Int): T

def sum(vs: TraversableOnce[T]): T

def sumN(a: T, n: Int): T

def sumOption(iter: TraversableOnce[T]): Option[T]

Returns an instance of T calculated by summing all instances in iter in one pass.

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

def trySum(as: TraversableOnce[T]): Option[T]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit