An idempotent function that ensures an object has a non-negative sign.
An idempotent function that ensures an object has a non-negative sign.
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
.
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
.
Returns true
iff a
is a an integer.
Returns true
iff a
is a an integer.
Rounds a
to the nearest integer.
Rounds a
to the nearest integer.
Returns 0 if a
is 0, > 0 if a
is positive, and < 0 is a
is negative.
Returns 0 if a
is 0, > 0 if a
is positive, and < 0 is a
is negative.
Approximates a
as a Double
.
Approximates a
as a Double
.
Returns true
if x
and y
are equivalent, false
otherwise.
Returns true
if x
and y
are equivalent, false
otherwise.
Defined to be equivalent to additive.sumn(one, n)
.
Defined to be equivalent to additive.sumn(one, n)
. That is, n
repeated summations of this ring's one
, or -one
if n
is
negative.
Tests if a
is zero.
Tests if a
is zero.
Returns false
if x
and y
are equivalent, true
otherwise.
Returns false
if x
and y
are equivalent, true
otherwise.
Defines an order on B
by mapping B
to A
using f
and using A
s
order to order B
.
Defines an order on B
by mapping B
to A
using f
and using A
s
order to order B
.
Result of comparing x
with y
.
Result of comparing x
with y
. Returns NaN if operands
are not comparable. If operands are comparable, returns a
Double whose sign is:
- negative iff x < y
- zero iff x === y
- positive iff x > y
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.
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.
This is similar to Semigroup#pow
, except that a pow 0
is defined to be
the multiplicative identity.
Given a sequence of as
, sum them using the monoid and return the total.
Given a sequence of as
, sum them using the monoid and return the total.
Given a sequence of as
, sum them using the semigroup and return the total.
Given a sequence of as
, sum them using the semigroup and return the total.
If the sequence is empty, returns None. Otherwise, returns Some(total).
Return a
multiplicated with itself n
times.
Return a
multiplicated with itself n
times.
Defines an ordering on A
where all arrows switch direction.
Defines an ordering on A
where all arrows switch direction.
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.
Given a sequence of as
, sum them using the monoid and return the total.
Given a sequence of as
, sum them using the monoid and return the total.
Given a sequence of as
, sum them using the semigroup and return the total.
Given a sequence of as
, sum them using the semigroup and return the total.
If the sequence is empty, returns None. Otherwise, returns Some(total).
Return a
added with itself n
times.
Return a
added with itself n
times.
Result of comparing x
with y
.
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
TODO 3. LiteralOps? Literal conversions? 4. Review operator symbols? 5. Support for more operators? 6. Start to worry about things like e.g. pow(BigInt, BigInt)