ShortAlgebra

@SerialVersionUID(0L)
class ShortAlgebra extends ShortIsEuclideanRing with ShortIsReal with Serializable
trait forCommutativeRing[Short]
trait forAdditiveCommutativeGroup[Short]
trait forAdditiveCommutativeMonoid[Short]
trait TruncatedDivision[Short]
trait IsIntegral[Short]
trait IsRational[Short]
trait IsAlgebraic[Short]
trait IsReal[Short]
trait Signed[Short]
trait Order[Short]
trait PartialOrder[Short]
trait Eq[Short]
trait EuclideanRing[Short]
trait GCDRing[Short]
trait CommutativeRing[Short]
trait CommutativeRng[Short]
trait CommutativeRig[Short]
trait MultiplicativeCommutativeMonoid[Short]
trait CommutativeSemiring[Short]
trait MultiplicativeCommutativeSemigroup[Short]
trait Ring[Short]
trait Rng[Short]
trait AdditiveCommutativeGroup[Short]
trait AdditiveGroup[Short]
trait Rig[Short]
trait MultiplicativeMonoid[Short]
trait Semiring[Short]
trait MultiplicativeSemigroup[Short]
trait AdditiveCommutativeMonoid[Short]
trait AdditiveCommutativeSemigroup[Short]
trait AdditiveMonoid[Short]
trait AdditiveSemigroup[Short]
trait Serializable
class Object
trait Matchable
class Any

Value members

Inherited methods

override
def abs(a: Short): Short
Definition Classes
ShortSigned -> Signed
Inherited from
ShortSigned
override
def additive: CommutativeGroup[Short]
Definition Classes
AdditiveCommutativeGroup -> AdditiveCommutativeMonoid -> AdditiveCommutativeSemigroup -> AdditiveGroup -> AdditiveMonoid -> AdditiveSemigroup
Inherited from
AdditiveCommutativeGroup
final override
def additiveCommutativeMonoid: AdditiveCommutativeMonoid[Short]
Definition Classes
forAdditiveCommutativeMonoid -> Signed
Inherited from
forAdditiveCommutativeMonoid
def ceil(a: Short): Short
Inherited from
IsIntegral
def compare(x: Short, y: Short): Int
Inherited from
ShortOrder
def comparison(x: Short, y: Short): Comparison

Like compare, but returns a cats.kernel.Comparison instead of an Int. Has the benefit of being able to pattern match on, but not as performant.

Like compare, but returns a cats.kernel.Comparison instead of an Int. Has the benefit of being able to pattern match on, but not as performant.

Inherited from
Order
def emod(a: Short, b: Short): Short
Inherited from
ShortIsEuclideanRing
def equot(a: Short, b: Short): Short
Inherited from
ShortIsEuclideanRing
override
def equotmod(a: Short, b: Short): (Short, Short)
Definition Classes
ShortIsEuclideanRing -> EuclideanRing
Inherited from
ShortIsEuclideanRing
override
def eqv(x: Short, y: Short): Boolean
Definition Classes
ShortOrder -> Order -> PartialOrder -> Eq
Inherited from
ShortOrder
def euclideanFunction(a: Short): BigInt
Inherited from
ShortIsEuclideanRing
def floor(a: Short): Short
Inherited from
IsIntegral
def fmod(x: Short, y: Short): Short
Inherited from
forCommutativeRing
def fquot(x: Short, y: Short): Short
Inherited from
forCommutativeRing
override
def fquotmod(x: Short, y: Short): (Short, Short)
Definition Classes
forCommutativeRing -> TruncatedDivision
Inherited from
forCommutativeRing
def fromBigInt(n: BigInt): Short

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.

Inherited from
Ring
override
def fromInt(n: Int): Short
Definition Classes
Inherited from
ShortIsEuclideanRing
override
def gcd(a: Short, b: Short)(implicit ev: Eq[Short]): Short
Definition Classes
ShortIsEuclideanRing -> EuclideanRing -> GCDRing
Inherited from
ShortIsEuclideanRing
override
def gt(x: Short, y: Short): Boolean
Definition Classes
ShortOrder -> Order -> PartialOrder
Inherited from
ShortOrder
override
def gteqv(x: Short, y: Short): Boolean
Definition Classes
ShortOrder -> Order -> PartialOrder
Inherited from
ShortOrder
def isOne(a: Short)(implicit ev: Eq[Short]): Boolean

Tests if a is one.

Tests if a is one.

Inherited from
MultiplicativeMonoid
def isSignNegative(a: Short): Boolean
Inherited from
Signed
def isSignNonNegative(a: Short): Boolean
Inherited from
Signed
def isSignNonPositive(a: Short): Boolean
Inherited from
Signed
def isSignNonZero(a: Short): Boolean
Inherited from
Signed
def isSignPositive(a: Short): Boolean
Inherited from
Signed
def isSignZero(a: Short): Boolean
Inherited from
Signed
def isWhole(a: Short): Boolean
Inherited from
IsIntegral
def isZero(a: Short)(implicit ev: Eq[Short]): Boolean

Tests if a is zero.

Tests if a is zero.

Inherited from
AdditiveMonoid
override
def lcm(a: Short, b: Short)(implicit ev: Eq[Short]): Short
Definition Classes
ShortIsEuclideanRing -> EuclideanRing -> GCDRing
Inherited from
ShortIsEuclideanRing
override
def lt(x: Short, y: Short): Boolean
Definition Classes
ShortOrder -> Order -> PartialOrder
Inherited from
ShortOrder
override
def lteqv(x: Short, y: Short): Boolean
Definition Classes
ShortOrder -> Order -> PartialOrder
Inherited from
ShortOrder
def max(x: Short, y: Short): Short

If x > y, return x, else return y.

If x > y, return x, else return y.

Inherited from
Order
def min(x: Short, y: Short): Short

If x < y, return x, else return y.

If x < y, return x, else return y.

Inherited from
Order
override
def minus(a: Short, b: Short): Short
Definition Classes
ShortIsEuclideanRing -> AdditiveGroup
Inherited from
ShortIsEuclideanRing
override
def multiplicative: CommutativeMonoid[Short]
Definition Classes
MultiplicativeCommutativeMonoid -> MultiplicativeCommutativeSemigroup -> MultiplicativeMonoid -> MultiplicativeSemigroup
Inherited from
MultiplicativeCommutativeMonoid
def negate(a: Short): Short
Inherited from
ShortIsEuclideanRing
override
def neqv(x: Short, y: Short): Boolean
Definition Classes
ShortOrder -> Order -> Eq
Inherited from
ShortOrder
def one: Short
Inherited from
ShortIsEuclideanRing
def order: Order[Short]
Inherited from
ShortSigned
def partialCompare(x: Short, y: Short): Double
Inherited from
Order
def partialComparison(x: Short, y: Short): Option[Comparison]

Like partialCompare, but returns a cats.kernel.Comparison instead of an Double. Has the benefit of being able to pattern match on, but not as performant.

Like partialCompare, but returns a cats.kernel.Comparison instead of an Double. Has the benefit of being able to pattern match on, but not as performant.

Inherited from
PartialOrder
def plus(a: Short, b: Short): Short
Inherited from
ShortIsEuclideanRing
def pmax(x: Short, y: Short): Option[Short]

Returns Some(x) if x >= y, Some(y) if x < y, otherwise None.

Returns Some(x) if x >= y, Some(y) if x < y, otherwise None.

Inherited from
PartialOrder
def pmin(x: Short, y: Short): Option[Short]

Returns Some(x) if x <= y, Some(y) if x > y, otherwise None.

Returns Some(x) if x <= y, Some(y) if x > y, otherwise None.

Inherited from
PartialOrder
override
def pow(a: Short, n: Int): Short
Definition Classes
MultiplicativeMonoid -> MultiplicativeSemigroup
Inherited from
MultiplicativeMonoid
@nowarn("msg=deprecated")
def product(as: IterableOnce[Short]): Short

Given a sequence of as, compute the product.

Given a sequence of as, compute the product.

Inherited from
MultiplicativeMonoid
def round(a: Short): Short
Inherited from
IsIntegral
def sign(a: Short): Sign

Returns Zero if a is 0, Positive if a is positive, and Negative is a is negative.

Returns Zero if a is 0, Positive if a is positive, and Negative is a is negative.

Inherited from
Signed
override
def signum(a: Short): Int
Definition Classes
ShortSigned -> Signed
Inherited from
ShortSigned
@nowarn("msg=deprecated")
def sum(as: IterableOnce[Short]): Short

Given a sequence of as, compute the sum.

Given a sequence of as, compute the sum.

Inherited from
AdditiveMonoid
override
def sumN(a: Short, n: Int): Short
Definition Classes
AdditiveGroup -> AdditiveMonoid -> AdditiveSemigroup
Inherited from
AdditiveGroup
override
def times(a: Short, b: Short): Short
Definition Classes
ShortIsEuclideanRing -> MultiplicativeSemigroup
Inherited from
ShortIsEuclideanRing
def tmod(x: Short, y: Short): Short
def toAlgebraic(a: Short): Algebraic
Inherited from
IsRational
def toBigInt(n: Short): BigInt
Inherited from
ShortIsReal
def toBigIntOpt(x: Short): Opt[BigInt]
def toDouble(n: Short): Double
Inherited from
ShortIsReal
def toOrdering: Ordering[Short]

Convert a Order[A] to a scala.math.Ordering[A] instance.

Convert a Order[A] to a scala.math.Ordering[A] instance.

Inherited from
Order
def toRational(a: Short): Rational
Inherited from
IsIntegral
def toReal(a: Short): Real
Inherited from
IsAlgebraic
def tquot(x: Short, y: Short): Short
def tquotmod(x: Short, y: Short): (Short, Short)
Inherited from
TruncatedDivision
def tryCompare(x: Short, y: Short): Option[Int]

Result of comparing x with y. Returns None if operands are not comparable. If operands are comparable, returns Some[Int] where the Int sign is:

Result of comparing x with y. Returns None if operands are not comparable. If operands are comparable, returns Some[Int] where the Int sign is:

  • negative iff x < y
  • zero iff x = y
  • positive iff x > y
Inherited from
PartialOrder
@nowarn("msg=deprecated")
override
def tryProduct(as: IterableOnce[Short]): Option[Short]
Definition Classes
MultiplicativeMonoid -> MultiplicativeSemigroup
Inherited from
MultiplicativeMonoid
@nowarn("msg=deprecated")
override
def trySum(as: IterableOnce[Short]): Option[Short]
Definition Classes
AdditiveMonoid -> AdditiveSemigroup
Inherited from
AdditiveMonoid
def zero: Short
Inherited from
ShortIsEuclideanRing