trait PolynomialRing[C] extends PolynomialRng[C] with Ring[Polynomial[C]]
- Alphabetic
- By Inheritance
- PolynomialRing
- Ring
- Rig
- MultiplicativeMonoid
- PolynomialRng
- RingAlgebra
- Rng
- Module
- AdditiveAbGroup
- AdditiveCMonoid
- AdditiveCSemigroup
- AdditiveGroup
- PolynomialSemiring
- Semiring
- MultiplicativeSemigroup
- AdditiveMonoid
- AdditiveSemigroup
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Abstract Value Members
-
implicit abstract
def
ct: ClassTag[C]
- Definition Classes
- PolynomialSemiring
-
implicit abstract
def
eq: Eq[C]
- Definition Classes
- PolynomialSemiring
-
implicit abstract
val
scalar: Ring[C]
- Definition Classes
- PolynomialRing → PolynomialRng → Module → PolynomialSemiring
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[Polynomial[C]]
- 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
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
fromInt(n: Int): Polynomial[C]
Defined to be equivalent to
additive.sumn(one, n).Defined to be equivalent to
additive.sumn(one, n). That is,nrepeated summations of this ring'sone, or-oneifnis negative.- Definition Classes
- Ring
-
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: Polynomial[C])(implicit ev: Eq[Polynomial[C]]): Boolean
- Definition Classes
- MultiplicativeMonoid
-
def
isZero(a: Polynomial[C])(implicit ev: Eq[Polynomial[C]]): Boolean
Tests if
ais zero.Tests if
ais zero.- Definition Classes
- AdditiveMonoid
-
def
minus(x: Polynomial[C], y: Polynomial[C]): Polynomial[C]
- Definition Classes
- AdditiveGroup
-
def
multiplicative: Monoid[Polynomial[C]]
- Definition Classes
- MultiplicativeMonoid → MultiplicativeSemigroup
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
negate(x: Polynomial[C]): Polynomial[C]
- Definition Classes
- PolynomialRng → AdditiveGroup
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
one: Polynomial[C]
- Definition Classes
- PolynomialRing → MultiplicativeMonoid
-
def
plus(x: Polynomial[C], y: Polynomial[C]): Polynomial[C]
- Definition Classes
- PolynomialSemiring → AdditiveSemigroup
-
def
pow(a: Polynomial[C], n: Int): Polynomial[C]
This is similar to
Semigroup#pow, except thata pow 0is defined to be the multiplicative identity. -
def
prod(as: TraversableOnce[Polynomial[C]]): Polynomial[C]
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[Polynomial[C]]): Option[Polynomial[C]]
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: Polynomial[C], n: Int): Polynomial[C]
Return
amultiplied with itselfntimes.Return
amultiplied with itselfntimes.- Definition Classes
- MultiplicativeMonoid → MultiplicativeSemigroup
-
def
prodnAboveOne(a: Polynomial[C], n: Int): Polynomial[C]
- Attributes
- protected
- Definition Classes
- MultiplicativeSemigroup
-
def
sum(as: TraversableOnce[Polynomial[C]]): Polynomial[C]
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[Polynomial[C]]): Option[Polynomial[C]]
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: Polynomial[C], n: Int): Polynomial[C]
Return
aadded with itselfntimes.Return
aadded with itselfntimes.- Definition Classes
- AdditiveGroup → AdditiveMonoid → AdditiveSemigroup
-
def
sumnAboveOne(a: Polynomial[C], n: Int): Polynomial[C]
- Attributes
- protected
- Definition Classes
- AdditiveSemigroup
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
times(x: Polynomial[C], y: Polynomial[C]): Polynomial[C]
- Definition Classes
- PolynomialSemiring → MultiplicativeSemigroup
-
def
timesl(r: C, v: Polynomial[C]): Polynomial[C]
- Definition Classes
- PolynomialRng → Module
-
def
timesr(v: Polynomial[C], r: C): Polynomial[C]
- Definition Classes
- Module
-
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: Polynomial[C]
- Definition Classes
- PolynomialSemiring → AdditiveMonoid