DistRing

abstract def alg: Ring[A]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def additive: AbGroup[Dist[A]]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

def fromInt(n: Int): Dist[A]

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

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

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

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

Tests if a is zero.

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

def multiplicative: Monoid[Dist[A]]

final def ne(arg0: AnyRef): Boolean

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

final def notify(): Unit

final def notifyAll(): Unit

def one: Dist[A]

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

def pow(a: Dist[A], n: Int): Dist[A]

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

def prod(as: TraversableOnce[Dist[A]]): Dist[A]

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

def prodOption(as: TraversableOnce[Dist[A]]): Option[Dist[A]]

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

def prodn(a: Dist[A], n: Int): Dist[A]

Return a multiplied with itself n times.

def prodnAboveOne(a: Dist[A], n: Int): Dist[A]

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

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

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

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

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

Return a added with itself n times.

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

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

def times(x: Dist[A], y: Dist[A]): Dist[A]

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit

def zero: Dist[A]