class LongAlgebra extends CommutativeRing[Long] with Serializable
- Source
- long.scala
- Alphabetic
- By Inheritance
- LongAlgebra
- CommutativeRing
- CommutativeRng
- CommutativeRig
- MultiplicativeCommutativeMonoid
- CommutativeSemiring
- MultiplicativeCommutativeSemigroup
- Ring
- Rng
- AdditiveCommutativeGroup
- AdditiveGroup
- Rig
- MultiplicativeMonoid
- Semiring
- MultiplicativeSemigroup
- AdditiveCommutativeMonoid
- AdditiveCommutativeSemigroup
- AdditiveMonoid
- AdditiveSemigroup
- Serializable
- Serializable
- AnyRef
- Any
- Hide All
- Show All
- Public
- All
Instance Constructors
- new LongAlgebra()
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: CommutativeGroup[Long]
- Definition Classes
- AdditiveCommutativeGroup → AdditiveCommutativeMonoid → AdditiveCommutativeSemigroup → AdditiveGroup → AdditiveMonoid → AdditiveSemigroup
-
final
def
asInstanceOf[T0]: T0
- Definition Classes
- Any
-
def
clone(): AnyRef
- Attributes
- protected[lang]
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native() @HotSpotIntrinsicCandidate()
-
final
def
eq(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
equals(arg0: Any): Boolean
- Definition Classes
- AnyRef → Any
-
def
fromBigInt(n: BigInt): Long
Convert the given BigInt to an instance of A.
Convert the given BigInt to an instance of A.
This is equivalent to
nrepeated summations of this ring'sone, or-nsummations of-oneifnis negative.Most type class instances should consider overriding this method for performance reasons.
- Definition Classes
- LongAlgebra → Ring
-
def
fromInt(n: Int): Long
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,
nrepeated summations of this ring'sone, or-nsummations of-oneifnis negative.Most type class instances should consider overriding this method for performance reasons.
- Definition Classes
- LongAlgebra → Ring
-
final
def
getClass(): Class[_]
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
hashCode(): Int
- Definition Classes
- AnyRef → Any
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
isInstanceOf[T0]: Boolean
- Definition Classes
- Any
-
def
isOne(a: Long)(implicit ev: Eq[Long]): Boolean
Tests if
ais one.Tests if
ais one.- Definition Classes
- MultiplicativeMonoid
-
def
isZero(a: Long)(implicit ev: Eq[Long]): Boolean
Tests if
ais zero.Tests if
ais zero.- Definition Classes
- AdditiveMonoid
-
def
minus(x: Long, y: Long): Long
- Definition Classes
- LongAlgebra → AdditiveGroup
-
def
multiplicative: CommutativeMonoid[Long]
- Definition Classes
- MultiplicativeCommutativeMonoid → MultiplicativeCommutativeSemigroup → MultiplicativeMonoid → MultiplicativeSemigroup
-
final
def
ne(arg0: AnyRef): Boolean
- Definition Classes
- AnyRef
-
def
negate(x: Long): Long
- Definition Classes
- LongAlgebra → AdditiveGroup
-
final
def
notify(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
final
def
notifyAll(): Unit
- Definition Classes
- AnyRef
- Annotations
- @native() @HotSpotIntrinsicCandidate()
-
def
one: Long
- Definition Classes
- LongAlgebra → MultiplicativeMonoid
-
def
plus(x: Long, y: Long): Long
- Definition Classes
- LongAlgebra → AdditiveSemigroup
-
def
positivePow(a: Long, n: Int): Long
- Attributes
- protected[this]
- Definition Classes
- MultiplicativeSemigroup
-
def
positiveSumN(a: Long, n: Int): Long
- Attributes
- protected[this]
- Definition Classes
- AdditiveSemigroup
-
def
pow(x: Long, y: Int): Long
- Definition Classes
- LongAlgebra → MultiplicativeMonoid → MultiplicativeSemigroup
-
def
product(as: TraversableOnce[Long]): Long
Given a sequence of
as, compute the product.Given a sequence of
as, compute the product.- Definition Classes
- MultiplicativeMonoid
-
def
sum(as: TraversableOnce[Long]): Long
Given a sequence of
as, compute the sum.Given a sequence of
as, compute the sum.- Definition Classes
- AdditiveMonoid
-
def
sumN(a: Long, n: Int): Long
- Definition Classes
- AdditiveGroup → AdditiveMonoid → AdditiveSemigroup
-
final
def
synchronized[T0](arg0: ⇒ T0): T0
- Definition Classes
- AnyRef
-
def
times(x: Long, y: Long): Long
- Definition Classes
- LongAlgebra → MultiplicativeSemigroup
-
def
toString(): String
- Definition Classes
- AnyRef → Any
-
def
tryProduct(as: TraversableOnce[Long]): Option[Long]
Given a sequence of
as, combine them and return the total.Given a sequence of
as, combine them and return the total.If the sequence is empty, returns None. Otherwise, returns Some(total).
- Definition Classes
- MultiplicativeMonoid → MultiplicativeSemigroup
-
def
trySum(as: TraversableOnce[Long]): Option[Long]
Given a sequence of
as, combine them and return the total.Given a sequence of
as, combine them and return the total.If the sequence is empty, returns None. Otherwise, returns Some(total).
- Definition Classes
- AdditiveMonoid → AdditiveSemigroup
-
final
def
wait(arg0: Long, arg1: Int): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
final
def
wait(arg0: Long): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... ) @native()
-
final
def
wait(): Unit
- Definition Classes
- AnyRef
- Annotations
- @throws( ... )
-
def
zero: Long
- Definition Classes
- LongAlgebra → AdditiveMonoid