- Companion
- object
Value members
Inherited methods
An idempotent function that ensures an object has a non-negative sign.
An idempotent function that ensures an object has a non-negative sign.
- Inherited from
- Signed
- Definition Classes
- AdditiveCommutativeGroup -> AdditiveCommutativeMonoid -> AdditiveCommutativeSemigroup -> AdditiveGroup -> AdditiveMonoid -> AdditiveSemigroup
- Inherited from
- AdditiveCommutativeGroup
Rounds a
the nearest integer that is greater than or equal to a
.
Rounds a
the nearest integer that is greater than or equal to a
.
- Inherited from
- IsReal
Result of comparing x
with y
. Returns an Int whose sign is:
Result of comparing x
with y
. Returns an Int whose sign is:
- negative iff
x < y
- zero iff
x = y
- positive iff
x > y
- Inherited from
- Order
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
Returns true if x
= y
, false otherwise.
Returns true if x
= y
, false otherwise.
- Definition Classes
- Order -> PartialOrder -> Eq
- Inherited from
- Order
Rounds a
the nearest integer that is less than or equal to a
.
Rounds a
the nearest integer that is less than or equal to a
.
- Inherited from
- IsReal
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
This is implemented in terms of basic Field 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 Field 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.
- Inherited from
- Field
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.
- Inherited from
- Ring
Returns true if x
> y
, false otherwise.
Returns true if x
> y
, false otherwise.
- Definition Classes
- Order -> PartialOrder
- Inherited from
- Order
Returns true if x
>= y
, false otherwise.
Returns true if x
>= y
, false otherwise.
- Definition Classes
- Order -> PartialOrder
- Inherited from
- Order
Returns true if x
< y
, false otherwise.
Returns true if x
< y
, false otherwise.
- Definition Classes
- Order -> PartialOrder
- Inherited from
- Order
Returns true if x
<= y
, false otherwise.
Returns true if x
<= y
, false otherwise.
- Definition Classes
- Order -> PartialOrder
- Inherited from
- Order
- Definition Classes
- MultiplicativeCommutativeGroup -> MultiplicativeCommutativeMonoid -> MultiplicativeCommutativeSemigroup -> MultiplicativeGroup -> MultiplicativeMonoid -> MultiplicativeSemigroup
- Inherited from
- MultiplicativeCommutativeGroup
Returns true if x
!= y
, false otherwise.
Returns true if x
!= y
, false otherwise.
Note: this default implementation provided by Order is the same as the one defined in Eq, but for purposes of binary compatibility, the override in Order has not yet been removed. See this discussion.
- Definition Classes
- Order -> Eq
- Inherited from
- Order
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
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
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
- Definition Classes
- MultiplicativeGroup -> MultiplicativeMonoid -> MultiplicativeSemigroup
- Inherited from
- MultiplicativeGroup
Given a sequence of as
, compute the product.
Given a sequence of as
, compute the product.
- Inherited from
- MultiplicativeMonoid
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
Returns 0 if a
is 0, 1 if a
is positive, and -1 is a
is negative.
Returns 0 if a
is 0, 1 if a
is positive, and -1 is a
is negative.
- Inherited from
- Signed
Given a sequence of as
, compute the sum.
Given a sequence of as
, compute the sum.
- Inherited from
- AdditiveMonoid
- Definition Classes
- AdditiveGroup -> AdditiveMonoid -> AdditiveSemigroup
- Inherited from
- AdditiveGroup
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
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
- Definition Classes
- MultiplicativeMonoid -> MultiplicativeSemigroup
- Inherited from
- MultiplicativeMonoid