ZAlgebra

abstract def getClass(): Class[_]

implicit abstract def scalar: Ring[Int]

implicit abstract def vector: Ring[V]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def additive: AbGroup[V]

final def asInstanceOf[T0]: T0

def equals(arg0: Any): Boolean

def fromInt(n: Int): V

Defined to be equivalent to additive.sumn(one, n).

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def isOne(a: V)(implicit ev: Eq[V]): Boolean

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

Tests if a is zero.

def minus(v: V, w: V): V

def multiplicative: Monoid[V]

def negate(v: V): V

def one: V

def plus(v: V, w: V): V

def pow(a: V, n: Int): V

This is similar to Semigroup#pow, except that a pow 0 is defined to be the multiplicative identity.

def prod(as: TraversableOnce[V]): V

Given a sequence of as, sum them using the monoid and return the total.

def prodOption(as: TraversableOnce[V]): Option[V]

Given a sequence of as, sum them using the semigroup and return the total.

def prodn(a: V, n: Int): V

Return a multiplied with itself n times.

def prodnAboveOne(a: V, n: Int): V

def sum(as: TraversableOnce[V]): V

Given a sequence of as, sum them using the monoid and return the total.

def sumOption(as: TraversableOnce[V]): Option[V]

Given a sequence of as, sum them using the semigroup and return the total.

def sumn(a: V, n: Int): V

Return a added with itself n times.

def sumnAboveOne(a: V, n: Int): V

def times(v: V, w: V): V

def timesl(r: Int, v: V): V

def timesr(v: V, r: Int): V

def toString(): String

def zero: V