This is implemented in terms of basic Field ops.
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 is overriden.
This is possible because a Double is a rational number.
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.
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.
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.