DistEuclideanRing

abstract def alg: EuclideanRing[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

final def euclid(a: Dist[A], b: Dist[A])(implicit eq: Eq[Dist[A]]): Dist[A]

def finalize(): Unit

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

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

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

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def lcm(a: Dist[A], b: Dist[A]): Dist[A]

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

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

def multiplicative: CMonoid[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 quot(x: Dist[A], y: Dist[A]): Dist[A]

def quotmod(a: Dist[A], b: Dist[A]): (Dist[A], 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]