Defined to be equivalent to additive.sumn(one, n)
.
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
multiplied with itself n
times.
Return a
multiplied 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.
Given any
Ring[A]
we can construct aRingAlgebra[A, Int]
. This is possible since we can definefromInt
onRing
generally.