trait
EuclideanRingFunctions[R[T] <: EuclideanRing[T]] extends RingFunctions[R]
Value Members
-
final
def
!=(arg0: Any): Boolean
-
final
def
##(): Int
-
final
def
==(arg0: Any): Boolean
-
final
def
asInstanceOf[T0]: T0
-
def
clone(): AnyRef
-
final
def
eq(arg0: AnyRef): Boolean
-
def
equals(arg0: Any): Boolean
-
def
finalize(): Unit
-
def
fromInt[A](n: Int)(implicit ev: R[A]): A
-
final
def
getClass(): Class[_]
-
def
hashCode(): Int
-
def
isAdditiveCommutative[A](implicit ev: R[A]): Boolean
-
final
def
isInstanceOf[T0]: Boolean
-
def
isMultiplicativeCommutative[A](implicit ev: R[A]): Boolean
-
def
isOne[A](a: A)(implicit ev0: R[A], ev1: Eq[A]): Boolean
-
def
isZero[A](a: A)(implicit ev0: R[A], ev1: Eq[A]): Boolean
-
def
minus[A](x: A, y: A)(implicit ev: R[A]): A
-
def
mod[A](x: A, y: A)(implicit ev: R[A]): A
-
final
def
ne(arg0: AnyRef): Boolean
-
def
negate[A](x: A)(implicit ev: R[A]): A
-
final
def
notify(): Unit
-
final
def
notifyAll(): Unit
-
def
one[A](implicit ev: R[A]): A
-
def
plus[A](x: A, y: A)(implicit ev: R[A]): A
-
def
pow[A](a: A, n: Int)(implicit ev: R[A]): A
-
def
product[A](as: TraversableOnce[A])(implicit ev: R[A]): A
-
def
quot[A](x: A, y: A)(implicit ev: R[A]): A
-
def
quotmod[A](x: A, y: A)(implicit ev: R[A]): (A, A)
-
def
sum[A](as: TraversableOnce[A])(implicit ev: R[A]): A
-
def
sumN[A](a: A, n: Int)(implicit ev: R[A]): A
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
-
def
times[A](x: A, y: A)(implicit ev: R[A]): A
-
def
toString(): String
-
def
tryProduct[A](as: TraversableOnce[A])(implicit ev: R[A]): Option[A]
-
def
trySum[A](as: TraversableOnce[A])(implicit ev: R[A]): Option[A]
-
final
def
wait(): Unit
-
final
def
wait(arg0: Long, arg1: Int): Unit
-
final
def
wait(arg0: Long): Unit
-
def
zero[A](implicit ev: R[A]): A
Inherited from AnyRef
Inherited from Any
