core/spire.math/PolynomialOverRing

PolynomialOverRing

trait PolynomialOverRing[@specialized(Double) C] extends PolynomialOverRng[C] with Ring[Polynomial[C]]
trait Ring[Polynomial[C]]
trait Rig[Polynomial[C]]
trait MultiplicativeMonoid[Polynomial[C]]
trait Rng[Polynomial[C]]
trait AdditiveCommutativeGroup[Polynomial[C]]
trait AdditiveGroup[Polynomial[C]]
trait Semiring[Polynomial[C]]
trait MultiplicativeSemigroup[Polynomial[C]]
trait AdditiveCommutativeMonoid[Polynomial[C]]
trait AdditiveCommutativeSemigroup[Polynomial[C]]
trait AdditiveMonoid[Polynomial[C]]
trait AdditiveSemigroup[Polynomial[C]]
trait Serializable
class Object
trait Matchable
class Any

Value members

Concrete methods

def one: Polynomial[C]

Inherited methods

override
def additive: CommutativeGroup[Polynomial[C]]
Definition Classes
AdditiveCommutativeGroup -> AdditiveCommutativeMonoid -> AdditiveCommutativeSemigroup -> AdditiveGroup -> AdditiveMonoid -> AdditiveSemigroup
Inherited from
AdditiveCommutativeGroup
def fromBigInt(n: BigInt): Polynomial[C]

Convert the given BigInt to an instance of A.

Convert the given BigInt to an instance of A.

This is equivalent to n repeated summations of this ring's one, or -n summations of -one if n is negative.

Most type class instances should consider overriding this method for performance reasons.

Inherited from
Ring
def fromInt(n: Int): Polynomial[C]

Convert the given integer to an instance of A.

Convert the given integer to an instance of A.

Defined to be equivalent to sumN(one, n).

That is, n repeated summations of this ring's one, or -n summations of -one if n is negative.

Most type class instances should consider overriding this method for performance reasons.

Inherited from
Ring
def isOne(a: Polynomial[C])(implicit ev: Eq[Polynomial[C]]): Boolean

Tests if a is one.

Tests if a is one.

Inherited from
MultiplicativeMonoid
def isZero(a: Polynomial[C])(implicit ev: Eq[Polynomial[C]]): Boolean

Tests if a is zero.

Tests if a is zero.

Inherited from
AdditiveMonoid
def minus(x: Polynomial[C], y: Polynomial[C]): Polynomial[C]
Inherited from
AdditiveGroup
override
def multiplicative: Monoid[Polynomial[C]]
Definition Classes
MultiplicativeMonoid -> MultiplicativeSemigroup
Inherited from
MultiplicativeMonoid
def negate(x: Polynomial[C]): Polynomial[C]
Inherited from
PolynomialOverRng
def plus(x: Polynomial[C], y: Polynomial[C]): Polynomial[C]
override
def pow(a: Polynomial[C], n: Int): Polynomial[C]
Definition Classes
MultiplicativeMonoid -> MultiplicativeSemigroup
Inherited from
MultiplicativeMonoid
@nowarn("msg=deprecated")
def product(as: IterableOnce[Polynomial[C]]): Polynomial[C]

Given a sequence of as, compute the product.

Given a sequence of as, compute the product.

Inherited from
MultiplicativeMonoid
@nowarn("msg=deprecated")
def sum(as: IterableOnce[Polynomial[C]]): Polynomial[C]

Given a sequence of as, compute the sum.

Given a sequence of as, compute the sum.

Inherited from
AdditiveMonoid
override
def sumN(a: Polynomial[C], n: Int): Polynomial[C]
Definition Classes
AdditiveGroup -> AdditiveMonoid -> AdditiveSemigroup
Inherited from
AdditiveGroup
def times(x: Polynomial[C], y: Polynomial[C]): Polynomial[C]
def timesl(r: C, v: Polynomial[C]): Polynomial[C]
Inherited from
PolynomialOverRng
@nowarn("msg=deprecated")
override
def tryProduct(as: IterableOnce[Polynomial[C]]): Option[Polynomial[C]]
Definition Classes
MultiplicativeMonoid -> MultiplicativeSemigroup
Inherited from
MultiplicativeMonoid
@nowarn("msg=deprecated")
override
def trySum(as: IterableOnce[Polynomial[C]]): Option[Polynomial[C]]
Definition Classes
AdditiveMonoid -> AdditiveSemigroup
Inherited from
AdditiveMonoid
def zero: Polynomial[C]

Implicits

Implicits

implicit override
val scalar: Ring[C]

Inherited implicits

implicit
def ct: ClassTag[C]
implicit
def eq: Eq[C]