DistEuclideanRing

Abstract Value Members

abstract def alg: EuclideanRing[A]

Definition Classes
DistEuclideanRing → DistRing → DistRng → DistSemiring

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def additive: AbGroup[Dist[A]]

Definition Classes
AdditiveAbGroup → AdditiveCMonoid → AdditiveCSemigroup → AdditiveGroup → AdditiveMonoid → AdditiveSemigroup
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def euclid(a: Dist[A], b: Dist[A])(implicit eq: Eq[Dist[A]]): Dist[A]

Attributes
protected[this]
Definition Classes
EuclideanRing
Annotations
@tailrec()
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
def fromInt(n: Int): Dist[A]

Defined to be equivalent to additive.sumn(one, n).
Defined to be equivalent to additive.sumn(one, n). That is, n repeated summations of this ring's one, or -one if n is negative.

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

Definition Classes
DistEuclideanRing → EuclideanRing
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

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

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

Tests if a is zero.
Tests if a is zero.

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

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

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

Definition Classes
DistEuclideanRing → EuclideanRing
def multiplicative: CMonoid[Dist[A]]

Definition Classes
MultiplicativeCMonoid → MultiplicativeCSemigroup → MultiplicativeMonoid → MultiplicativeSemigroup
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def negate(x: Dist[A]): Dist[A]

Definition Classes
DistRng → AdditiveGroup
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def one: Dist[A]

Definition Classes
DistRing → MultiplicativeMonoid
def plus(x: Dist[A], y: Dist[A]): Dist[A]

Definition Classes
DistSemiring → AdditiveSemigroup
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.
This is similar to Semigroup#pow, except that a pow 0 is defined to be the multiplicative identity.

Definition Classes
Rig → Semiring
def prod(as: TraversableOnce[Dist[A]]): Dist[A]

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

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

Given a sequence of as, sum them using the semigroup and return the total.
Given a sequence of as, sum them using the semigroup and return the total.
If the sequence is empty, returns None. Otherwise, returns Some(total).

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

Return a multiplied with itself n times.
Return a multiplied with itself n times.

Definition Classes
MultiplicativeMonoid → MultiplicativeSemigroup
def prodnAboveOne(a: Dist[A], n: Int): Dist[A]

Attributes
protected
Definition Classes
MultiplicativeSemigroup
def quot(x: Dist[A], y: Dist[A]): Dist[A]

Definition Classes
DistEuclideanRing → EuclideanRing
def quotmod(a: Dist[A], b: Dist[A]): (Dist[A], Dist[A])

Definition Classes
EuclideanRing
def sum(as: TraversableOnce[Dist[A]]): Dist[A]

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

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

Given a sequence of as, sum them using the semigroup and return the total.
Given a sequence of as, sum them using the semigroup and return the total.
If the sequence is empty, returns None. Otherwise, returns Some(total).

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

Return a added with itself n times.
Return a added with itself n times.

Definition Classes
AdditiveGroup → AdditiveMonoid → AdditiveSemigroup
def sumnAboveOne(a: Dist[A], n: Int): Dist[A]

Attributes
protected
Definition Classes
AdditiveSemigroup
final def synchronized[T0](arg0: ⇒ T0): T0

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

Definition Classes
DistSemiring → MultiplicativeSemigroup
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
def zero: Dist[A]

Definition Classes
DistSemiring → AdditiveMonoid

Related Doc: package random

trait DistEuclideanRing[A] extends EuclideanRing[Dist[A]] with DistRing[A]

Abstract Value Members

abstract def alg: EuclideanRing[A]

Concrete Value Members

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]

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

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

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]

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

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

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

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

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

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

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

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

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

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]

Inherited from DistRing[A]

Inherited from DistRng[A]

Inherited from DistSemiring[A]

Inherited from EuclideanRing[Dist[A]]

Inherited from CRing[Dist[A]]

Inherited from MultiplicativeCMonoid[Dist[A]]

Inherited from MultiplicativeCSemigroup[Dist[A]]

Inherited from Ring[Dist[A]]

Inherited from Rng[Dist[A]]

Inherited from AdditiveAbGroup[Dist[A]]

Inherited from AdditiveCMonoid[Dist[A]]

Inherited from AdditiveCSemigroup[Dist[A]]

Inherited from AdditiveGroup[Dist[A]]

Inherited from Rig[Dist[A]]

Inherited from MultiplicativeMonoid[Dist[A]]

Inherited from Semiring[Dist[A]]

Inherited from MultiplicativeSemigroup[Dist[A]]

Inherited from AdditiveMonoid[Dist[A]]

Inherited from AdditiveSemigroup[Dist[A]]

Inherited from AnyRef

Inherited from Any

Ungrouped