Field

abstract def div(x: A, y: A): A

abstract def gcd(a: A, b: A): A

abstract def mod(a: A, b: A): A

abstract def negate(x: A): A

abstract def one: A

abstract def plus(x: A, y: A): A

abstract def quot(a: A, b: A): A

abstract def times(x: A, y: A): A

abstract def zero: A

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

def additive: AbGroup[A]

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

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

def finalize(): Unit

def fromDouble(a: Double): A

This is implemented in terms of basic Field ops.

def fromInt(n: Int): A

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

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def lcm(a: A, b: A): A

def minus(x: A, y: A): A

def multiplicative: AbGroup[A]

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def pow(a: A, n: Int): A

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

def quotmod(a: A, b: A): (A, A)

def reciprocal(x: A): A

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

def toString(): String

final def wait(): Unit

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

final def wait(arg0: Long): Unit