given_Field_Rational

coulomb.ops.algebra.cats.rational$.given_Field_Rational$

Attributes

Source:
rational.scala
Graph
Supertypes
Self type

Members list

Concise view

Value members

Concrete methods

Attributes

Source:
rational.scala
override def minus(x: Rational, y: Rational): Rational

Attributes

Definition Classes
Source:
rational.scala

Attributes

Source:
rational.scala

Attributes

Source:
rational.scala

Attributes

Source:
rational.scala
override def pow(x: Rational, n: Int): Rational

Attributes

Source:
rational.scala

Attributes

Source:
rational.scala

Inherited methods

def emod(a: Rational, b: Rational): A

Attributes

Inherited from:
Field
Source:
Field.scala

Attributes

Inherited from:
Field
Source:
Field.scala
override def equotmod(a: Rational, b: Rational): (A, A)

Attributes

Definition Classes
Inherited from:
Field
Source:
Field.scala

Attributes

Inherited from:
Field
Source:
Field.scala

Convert the given BigInt to an instance of A.

Convert the given BigInt to an instance of A.

This is equivalent to n repeated summations of this ring's one, or -n summations of -one if n is negative.

Most type class instances should consider overriding this method for performance reasons.

Attributes

Inherited from:
Ring
Source:
Ring.scala
override def fromDouble(a: Double): A

This is implemented in terms of basic Ring ops. However, this is probably significantly less efficient than can be done with a specific type. So, it is recommended that this method be overriden.

This is implemented in terms of basic Ring ops. However, this is probably significantly less efficient than can be done with a specific type. So, it is recommended that this method be overriden.

This is possible because a Double is a rational number.

Attributes

Definition Classes
Inherited from:
Field
Source:
Field.scala
def fromInt(n: Int): A

Convert the given integer to an instance of A.

Convert the given integer to an instance of A.

Defined to be equivalent to sumN(one, n).

That is, n repeated summations of this ring's one, or -n summations of -one if n is negative.

Most type class instances should consider overriding this method for performance reasons.

Attributes

Inherited from:
Ring
Source:
Ring.scala
override def gcd(a: Rational, b: Rational)(implicit eqA: Eq[Rational]): A

Attributes

Definition Classes
Inherited from:
Field
Source:
Field.scala
def isOne(a: Rational)(implicit ev: Eq[Rational]): Boolean

Tests if a is one.

Tests if a is one.

Attributes

Inherited from:
MultiplicativeMonoid
Source:
Multiplicative.scala
def isZero(a: Rational)(implicit ev: Eq[Rational]): Boolean

Tests if a is zero.

Tests if a is zero.

Attributes

Inherited from:
AdditiveMonoid
Source:
Additive.scala
override def lcm(a: Rational, b: Rational)(implicit eqA: Eq[Rational]): A

Attributes

Definition Classes
Inherited from:
Field
Source:
Field.scala

Given a sequence of as, compute the product.

Given a sequence of as, compute the product.

Attributes

Inherited from:
MultiplicativeMonoid
Source:
Multiplicative.scala

Attributes

Inherited from:
MultiplicativeGroup
Source:
Multiplicative.scala

Given a sequence of as, compute the sum.

Given a sequence of as, compute the sum.

Attributes

Inherited from:
AdditiveMonoid
Source:
Additive.scala
override def sumN(a: Rational, n: Int): A

Attributes

Definition Classes
Inherited from:
AdditiveGroup
Source:
Additive.scala

Given a sequence of as, combine them and return the total.

Given a sequence of as, combine them and return the total.

If the sequence is empty, returns None. Otherwise, returns Some(total).

Attributes

Definition Classes
Inherited from:
MultiplicativeMonoid
Source:
Multiplicative.scala
override def trySum(as: IterableOnce[Rational]): Option[A]

Given a sequence of as, combine them and return the total.

Given a sequence of as, combine them and return the total.

If the sequence is empty, returns None. Otherwise, returns Some(total).

Attributes

Definition Classes
Inherited from:
AdditiveMonoid
Source:
Additive.scala