trait LongIsEuclideanRing extends EuclideanRing[Long]
- Alphabetic
- By Inheritance
- LongIsEuclideanRing
- EuclideanRing
- CRing
- MultiplicativeCMonoid
- MultiplicativeCSemigroup
- Ring
- Rng
- AdditiveAbGroup
- AdditiveCMonoid
- AdditiveCSemigroup
- AdditiveGroup
- Rig
- MultiplicativeMonoid
- Semiring
- MultiplicativeSemigroup
- AdditiveMonoid
- AdditiveSemigroup
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Value Members
-
final
def
!=(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
##(): Int
- Definition Classes
- AnyRef → Any
-
final
def
==(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
additive: AbGroup[Long]
- Definition Classes
- AdditiveAbGroup → AdditiveCMonoid → AdditiveCSemigroup → AdditiveGroup → AdditiveMonoid → AdditiveSemigroup
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
final
def
euclid(a: Long, b: Long)(implicit eq: Eq[Long]): Long
- Attributes
- protected[this]
- Definition Classes
- EuclideanRing
- Annotations
- @tailrec()
-
def
finalize(): Unit
- Attributes
- protected[java.lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( classOf[java.lang.Throwable] )
-
def
fromInt(n: Int): Long
Defined to be equivalent to
additive.sumn(one, n).Defined to be equivalent to
additive.sumn(one, n). That is,nrepeated summations of this ring'sone, or-oneifnis negative.- Definition Classes
- LongIsEuclideanRing → Ring
-
def
gcd(a: Long, b: Long): Long
- Definition Classes
- LongIsEuclideanRing → EuclideanRing
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isOne(a: Long)(implicit ev: Eq[Long]): Boolean
- Definition Classes
- MultiplicativeMonoid
-
def
isZero(a: Long)(implicit ev: Eq[Long]): Boolean
Tests if
ais zero.Tests if
ais zero.- Definition Classes
- AdditiveMonoid
-
def
lcm(a: Long, b: Long): Long
- Definition Classes
- EuclideanRing
-
def
minus(a: Long, b: Long): Long
- Definition Classes
- LongIsEuclideanRing → AdditiveGroup
-
def
mod(a: Long, b: Long): Long
- Definition Classes
- LongIsEuclideanRing → EuclideanRing
-
def
multiplicative: CMonoid[Long]
- Definition Classes
- MultiplicativeCMonoid → MultiplicativeCSemigroup → MultiplicativeMonoid → MultiplicativeSemigroup
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
negate(a: Long): Long
- Definition Classes
- LongIsEuclideanRing → AdditiveGroup
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
-
def
one: Long
- Definition Classes
- LongIsEuclideanRing → MultiplicativeMonoid
-
def
plus(a: Long, b: Long): Long
- Definition Classes
- LongIsEuclideanRing → AdditiveSemigroup
-
def
pow(a: Long, b: Int): Long
This is similar to
Semigroup#pow, except thata pow 0is defined to be the multiplicative identity.This is similar to
Semigroup#pow, except thata pow 0is defined to be the multiplicative identity.- Definition Classes
- LongIsEuclideanRing → Rig → Semiring
-
def
prod(as: TraversableOnce[Long]): Long
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.- Definition Classes
- MultiplicativeMonoid
-
def
prodOption(as: TraversableOnce[Long]): Option[Long]
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).
- Definition Classes
- MultiplicativeSemigroup
-
def
prodn(a: Long, n: Int): Long
Return
amultiplied with itselfntimes.Return
amultiplied with itselfntimes.- Definition Classes
- MultiplicativeMonoid → MultiplicativeSemigroup
-
def
prodnAboveOne(a: Long, n: Int): Long
- Attributes
- protected
- Definition Classes
- MultiplicativeSemigroup
-
def
quot(a: Long, b: Long): Long
- Definition Classes
- LongIsEuclideanRing → EuclideanRing
-
def
quotmod(a: Long, b: Long): (Long, Long)
- Definition Classes
- EuclideanRing
-
def
sum(as: TraversableOnce[Long]): Long
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.- Definition Classes
- AdditiveMonoid
-
def
sumOption(as: TraversableOnce[Long]): Option[Long]
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).
- Definition Classes
- AdditiveSemigroup
-
def
sumn(a: Long, n: Int): Long
Return
aadded with itselfntimes.Return
aadded with itselfntimes.- Definition Classes
- AdditiveGroup → AdditiveMonoid → AdditiveSemigroup
-
def
sumnAboveOne(a: Long, n: Int): Long
- Attributes
- protected
- Definition Classes
- AdditiveSemigroup
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
times(a: Long, b: Long): Long
- Definition Classes
- LongIsEuclideanRing → MultiplicativeSemigroup
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
zero: Long
- Definition Classes
- LongIsEuclideanRing → AdditiveMonoid