DistVectorSpace

implicit abstract def alg: VectorSpace[V, K]

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def additive: AbGroup[Dist[V]]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def divr(v: Dist[V], k: Dist[K]): Dist[V]

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

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

Tests if a is zero.

def minus(x: Dist[V], y: Dist[V]): Dist[V]

final def ne(arg0: AnyRef): Boolean

def negate(x: Dist[V]): Dist[V]

final def notify(): Unit

final def notifyAll(): Unit

def plus(x: Dist[V], y: Dist[V]): Dist[V]

def scalar: Field[Dist[K]]

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

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

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

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

def sumn(a: Dist[V], n: Int): Dist[V]

Return a added with itself n times.

def sumnAboveOne(a: Dist[V], n: Int): Dist[V]

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

def timesl(k: Dist[K], v: Dist[V]): Dist[V]

def timesr(k: Dist[K], v: Dist[V]): Dist[V]

def timesr(v: Dist[V], r: Dist[K]): Dist[V]

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def zero: Dist[V]