PolynomialEuclideanRing

implicit abstract def ct: ClassTag[C]

implicit abstract def eq: Eq[C]

implicit abstract val scalar: Field[C]

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def additive: AbGroup[Polynomial[C]]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

def divr(x: Polynomial[C], k: C): Polynomial[C]

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def euclid(a: Polynomial[C], b: Polynomial[C])(implicit eq: Eq[Polynomial[C]]): Polynomial[C]

def finalize(): Unit

def fromInt(n: Int): Polynomial[C]

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

final def gcd(x: Polynomial[C], y: Polynomial[C]): Polynomial[C]

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def lcm(a: Polynomial[C], b: Polynomial[C]): Polynomial[C]

def minus(x: Polynomial[C], y: Polynomial[C]): Polynomial[C]

def mod(x: Polynomial[C], y: Polynomial[C]): Polynomial[C]

def multiplicative: CMonoid[Polynomial[C]]

final def ne(arg0: AnyRef): Boolean

def negate(x: Polynomial[C]): Polynomial[C]

final def notify(): Unit

final def notifyAll(): Unit

def one: Polynomial[C]

def plus(x: Polynomial[C], y: Polynomial[C]): Polynomial[C]

def pow(a: Polynomial[C], n: Int): Polynomial[C]

This is similar to Semigroup#pow, except that a pow 0 is defined to be the multiplicative identity.

def quot(x: Polynomial[C], y: Polynomial[C]): Polynomial[C]

def quotmod(x: Polynomial[C], y: Polynomial[C]): (Polynomial[C], Polynomial[C])

final def synchronized[T0](arg0: ⇒ T0): T0

def times(x: Polynomial[C], y: Polynomial[C]): Polynomial[C]

def timesl(r: C, v: Polynomial[C]): Polynomial[C]

def timesr(v: Polynomial[C], r: C): Polynomial[C]

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def zero: Polynomial[C]