core/spire.math/PolynomialOverCRing

PolynomialOverCRing

trait PolynomialOverCRing[@specialized(Double) C] extends CommutativeRing[Polynomial[C]] with PolynomialOverRing[C] with RingAssociativeAlgebra[Polynomial[C], C]
trait CModule[Polynomial[C], C]
trait RightModule[Polynomial[C], C]
trait LeftModule[Polynomial[C], C]
trait Ring[Polynomial[C]]
trait Rng[Polynomial[C]]
trait Rig[Polynomial[C]]
class Object
trait Matchable
class Any

Value members

Inherited methods

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
def negate(x: Polynomial[C]): Polynomial[C]
Inherited from:
PolynomialOverRng
def one: Polynomial[C]
Inherited from:
PolynomialOverRing
def plus(x: Polynomial[C], y: Polynomial[C]): Polynomial[C]
Inherited from:
PolynomialOverSemiring
override def pow(a: Polynomial[C], n: Int): Polynomial[C]
@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
Inherited from:
AdditiveGroup
def times(x: Polynomial[C], y: Polynomial[C]): Polynomial[C]
Inherited from:
PolynomialOverSemiring
def timesl(r: C, v: Polynomial[C]): Polynomial[C]
Inherited from:
PolynomialOverRng
override def timesr(v: Polynomial[C], r: C): Polynomial[C]
Definition Classes
Inherited from:
CModule
@nowarn("msg=deprecated")
override def tryProduct(as: IterableOnce[Polynomial[C]]): Option[Polynomial[C]]
@nowarn("msg=deprecated")
override def trySum(as: IterableOnce[Polynomial[C]]): Option[Polynomial[C]]
Definition Classes
Inherited from:
AdditiveMonoid
def zero: Polynomial[C]
Inherited from:
PolynomialOverSemiring

Implicits

Implicits

implicit override val scalar: CommutativeRing[C]

Inherited implicits

implicit def ct: ClassTag[C]
Inherited from:
PolynomialOverSemiring
implicit def eq: Eq[C]
Inherited from:
PolynomialOverSemiring