Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
-
def
apply[C](c: C, e: Int)(implicit arg0: Semiring[C], arg1: Eq[C], arg2: ClassTag[C]): PolySparse[C]
-
def
apply[C](terms: Iterable[Term[C]])(implicit arg0: Semiring[C], arg1: Eq[C], arg2: ClassTag[C]): PolySparse[C]
-
def
apply[C](data: Map[Int, C])(implicit arg0: Semiring[C], arg1: Eq[C], arg2: ClassTag[C]): PolySparse[C]
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
def
constant[C](c: C)(implicit arg0: Eq[C], arg1: Semiring[C], arg2: ClassTag[C]): Polynomial[C]
-
def
cubic[C](c: C)(implicit arg0: Eq[C], arg1: Semiring[C], arg2: ClassTag[C]): Polynomial[C]
-
def
dense[C](coeffs: Array[C])(implicit arg0: Semiring[C], arg1: Eq[C], arg2: ClassTag[C]): PolyDense[C]
-
implicit
def
eq[C](implicit arg0: ClassTag[C], arg1: Semiring[C], arg2: Eq[C]): PolynomialEq[C] { ... /* 3 definitions in type refinement */ }
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
implicit
def
euclideanRing[C](implicit arg0: ClassTag[C], arg1: Field[C], arg2: Eq[C]): PolynomialEuclideanRing[C] { ... /* 2 definitions in type refinement */ }
-
def
finalize(): Unit
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
interpolate[C](points: (C, C)*)(implicit arg0: Field[C], arg1: Eq[C], arg2: ClassTag[C]): Polynomial[C]
-
final
def
isInstanceOf[T0]: Boolean
-
def
linear[C](c: C)(implicit arg0: Eq[C], arg1: Semiring[C], arg2: ClassTag[C]): Polynomial[C]
-
final
def
ne(arg0: AnyRef): Boolean
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
one[C](implicit arg0: Eq[C], arg1: Rig[C], arg2: ClassTag[C]): Polynomial[C]
-
def
quadratic[C](c: C)(implicit arg0: Eq[C], arg1: Semiring[C], arg2: ClassTag[C]): Polynomial[C]
-
implicit
def
rig[C](implicit arg0: ClassTag[C], arg1: Rig[C], arg2: Eq[C]): PolynomialRig[C] { ... /* 2 definitions in type refinement */ }
-
implicit
def
ring[C](implicit arg0: ClassTag[C], arg1: Ring[C], arg2: Eq[C]): PolynomialRing[C] { ... /* 2 definitions in type refinement */ }
-
implicit
def
rng[C](implicit arg0: ClassTag[C], arg1: Rng[C], arg2: Eq[C]): PolynomialRng[C] { ... /* 2 definitions in type refinement */ }
-
implicit
def
semiring[C](implicit arg0: ClassTag[C], arg1: Semiring[C], arg2: Eq[C]): PolynomialSemiring[C] { ... /* 3 definitions in type refinement */ }
-
def
sparse[C](data: Map[Int, C])(implicit arg0: Semiring[C], arg1: Eq[C], arg2: ClassTag[C]): PolySparse[C]
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
toString(): String
-
def
twox[C](implicit arg0: Eq[C], arg1: Rig[C], arg2: ClassTag[C]): Polynomial[C]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
x[C](implicit arg0: Eq[C], arg1: Rig[C], arg2: ClassTag[C]): Polynomial[C]
-
def
zero[C](implicit arg0: Eq[C], arg1: Semiring[C], arg2: ClassTag[C]): Polynomial[C]
Inherited from AnyRef
Inherited from Any
Polynomial A univariate polynomial class and EuclideanRing extension trait for arithmetic operations. Polynomials can be instantiated using any type C for which a Ring[C] and Signed[C] are in scope, with exponents given by Int values. Some operations require a Field[C] to be in scope.