ByteAlgebra

Instance Constructors

new ByteAlgebra()

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 abs(a: Byte): Byte

An idempotent function that ensures an object has a non-negative sign.
An idempotent function that ensures an object has a non-negative sign.

Definition Classes
ByteIsSigned → Signed
def additive: AbGroup[Byte]

Definition Classes
AdditiveAbGroup → AdditiveCMonoid → AdditiveCSemigroup → AdditiveGroup → AdditiveMonoid → AdditiveSemigroup
final def asInstanceOf[T0]: T0

Definition Classes
Any
def ceil(a: Byte): Byte

Definition Classes
IsIntegral → IsReal
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
def compare(x: Byte, y: Byte): Int

Definition Classes
ByteOrder → Order
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def eqv(x: Byte, y: Byte): Boolean

Returns true if x and y are equivalent, false otherwise.
Returns true if x and y are equivalent, false otherwise.

Definition Classes
ByteOrder → Order → PartialOrder → Eq
final def euclid(a: Byte, b: Byte)(implicit eq: Eq[Byte]): Byte

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 floor(a: Byte): Byte

Definition Classes
IsIntegral → IsReal
def fromInt(n: Int): Byte

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.

Definition Classes
ByteIsEuclideanRing → Ring
def gcd(a: Byte, b: Byte): Byte

Definition Classes
ByteIsEuclideanRing → EuclideanRing
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def gt(x: Byte, y: Byte): Boolean

Definition Classes
ByteOrder → Order → PartialOrder
def gteqv(x: Byte, y: Byte): Boolean

Definition Classes
ByteOrder → Order → PartialOrder
def hashCode(): Int

Definition Classes
AnyRef → Any
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def isOne(a: Byte)(implicit ev: Eq[Byte]): Boolean

Definition Classes
MultiplicativeMonoid
def isSignNegative(a: Byte): Boolean

Definition Classes
Signed
def isSignNonNegative(a: Byte): Boolean

Definition Classes
Signed
def isSignNonPositive(a: Byte): Boolean

Definition Classes
Signed
def isSignNonZero(a: Byte): Boolean

Definition Classes
Signed
def isSignPositive(a: Byte): Boolean

Definition Classes
Signed
def isSignZero(a: Byte): Boolean

Definition Classes
Signed
def isWhole(a: Byte): Boolean

Definition Classes
IsIntegral → IsReal
def isZero(a: Byte)(implicit ev: Eq[Byte]): Boolean

Tests if a is zero.
Tests if a is zero.

Definition Classes
AdditiveMonoid
def lcm(a: Byte, b: Byte): Byte

Definition Classes
EuclideanRing
def lt(x: Byte, y: Byte): Boolean

Definition Classes
ByteOrder → Order → PartialOrder
def lteqv(x: Byte, y: Byte): Boolean

Definition Classes
ByteOrder → Order → PartialOrder
def max(x: Byte, y: Byte): Byte

Definition Classes
Order
def min(x: Byte, y: Byte): Byte

Definition Classes
Order
def minus(a: Byte, b: Byte): Byte

Definition Classes
ByteIsEuclideanRing → AdditiveGroup
def mod(a: Byte, b: Byte): Byte

Definition Classes
ByteIsEuclideanRing → EuclideanRing
def multiplicative: CMonoid[Byte]

Definition Classes
MultiplicativeCMonoid → MultiplicativeCSemigroup → MultiplicativeMonoid → MultiplicativeSemigroup
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def negate(a: Byte): Byte

Definition Classes
ByteIsEuclideanRing → AdditiveGroup
def neqv(x: Byte, y: Byte): Boolean

Returns false if x and y are equivalent, true otherwise.
Returns false if x and y are equivalent, true otherwise.

Definition Classes
ByteOrder → Eq
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def on[B](f: (B) ⇒ Byte): Order[B]

Defines an order on B by mapping B to A using f and using As order to order B.
Defines an order on B by mapping B to A using f and using As order to order B.

Definition Classes
Order → PartialOrder → Eq
def one: Byte

Definition Classes
ByteIsEuclideanRing → MultiplicativeMonoid
def partialCompare(x: Byte, y: Byte): Double

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

Definition Classes
Order → PartialOrder
def plus(a: Byte, b: Byte): Byte

Definition Classes
ByteIsEuclideanRing → AdditiveSemigroup
def pmax(x: Byte, y: Byte): Option[Byte]

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.

Definition Classes
PartialOrder
def pmin(x: Byte, y: Byte): Option[Byte]

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.

Definition Classes
PartialOrder
def pow(a: Byte, b: Int): Byte

This is similar to Semigroup#pow, except that a pow 0 is defined to be the multiplicative identity.
This is similar to Semigroup#pow, except that a pow 0 is defined to be the multiplicative identity.

Definition Classes
ByteIsEuclideanRing → Rig → Semiring
def prod(as: TraversableOnce[Byte]): Byte

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[Byte]): Option[Byte]

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: Byte, n: Int): Byte

Return a multiplied with itself n times.
Return a multiplied with itself n times.

Definition Classes
MultiplicativeMonoid → MultiplicativeSemigroup
def prodnAboveOne(a: Byte, n: Int): Byte

Attributes
protected
Definition Classes
MultiplicativeSemigroup
def quot(a: Byte, b: Byte): Byte

Definition Classes
ByteIsEuclideanRing → EuclideanRing
def quotmod(a: Byte, b: Byte): (Byte, Byte)

Definition Classes
EuclideanRing
def reverse: Order[Byte]

Defines an ordering on A where all arrows switch direction.
Defines an ordering on A where all arrows switch direction.

Definition Classes
Order → PartialOrder
def round(a: Byte): Byte

Definition Classes
IsIntegral → IsReal
def sign(a: Byte): Sign

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.

Definition Classes
Signed
def signum(a: Byte): Int

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.

Definition Classes
ByteIsSigned → Signed
def sum(as: TraversableOnce[Byte]): Byte

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[Byte]): Option[Byte]

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: Byte, n: Int): Byte

Return a added with itself n times.
Return a added with itself n times.

Definition Classes
AdditiveGroup → AdditiveMonoid → AdditiveSemigroup
def sumnAboveOne(a: Byte, n: Int): Byte

Attributes
protected
Definition Classes
AdditiveSemigroup
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def times(a: Byte, b: Byte): Byte

Definition Classes
ByteIsEuclideanRing → MultiplicativeSemigroup
def toDouble(n: Byte): Double

Definition Classes
ByteIsReal → IsReal
def toString(): String

Definition Classes
AnyRef → Any
def tryCompare(x: Byte, y: Byte): Option[Int]

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

Definition Classes
PartialOrder
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: Byte

Definition Classes
ByteIsEuclideanRing → AdditiveMonoid

Related Doc: package std

class ByteAlgebra extends ByteIsEuclideanRing with ByteIsReal with Serializable

Instance Constructors

new ByteAlgebra()

Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

def abs(a: Byte): Byte

def additive: AbGroup[Byte]

final def asInstanceOf[T0]: T0

def ceil(a: Byte): Byte

def clone(): AnyRef

def compare(x: Byte, y: Byte): Int

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def eqv(x: Byte, y: Byte): Boolean

final def euclid(a: Byte, b: Byte)(implicit eq: Eq[Byte]): Byte

def finalize(): Unit

def floor(a: Byte): Byte

def fromInt(n: Int): Byte

def gcd(a: Byte, b: Byte): Byte

final def getClass(): Class[_]

def gt(x: Byte, y: Byte): Boolean

def gteqv(x: Byte, y: Byte): Boolean

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

def isOne(a: Byte)(implicit ev: Eq[Byte]): Boolean

def isSignNegative(a: Byte): Boolean

def isSignNonNegative(a: Byte): Boolean

def isSignNonPositive(a: Byte): Boolean

def isSignNonZero(a: Byte): Boolean

def isSignPositive(a: Byte): Boolean

def isSignZero(a: Byte): Boolean

def isWhole(a: Byte): Boolean

def isZero(a: Byte)(implicit ev: Eq[Byte]): Boolean

def lcm(a: Byte, b: Byte): Byte

def lt(x: Byte, y: Byte): Boolean

def lteqv(x: Byte, y: Byte): Boolean

def max(x: Byte, y: Byte): Byte

def min(x: Byte, y: Byte): Byte

def minus(a: Byte, b: Byte): Byte

def mod(a: Byte, b: Byte): Byte

def multiplicative: CMonoid[Byte]

final def ne(arg0: AnyRef): Boolean

def negate(a: Byte): Byte

def neqv(x: Byte, y: Byte): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def on[B](f: (B) ⇒ Byte): Order[B]

def one: Byte

def partialCompare(x: Byte, y: Byte): Double

def plus(a: Byte, b: Byte): Byte

def pmax(x: Byte, y: Byte): Option[Byte]

def pmin(x: Byte, y: Byte): Option[Byte]

def pow(a: Byte, b: Int): Byte

def prod(as: TraversableOnce[Byte]): Byte

def prodOption(as: TraversableOnce[Byte]): Option[Byte]

def prodn(a: Byte, n: Int): Byte

def prodnAboveOne(a: Byte, n: Int): Byte

def quot(a: Byte, b: Byte): Byte

def quotmod(a: Byte, b: Byte): (Byte, Byte)

def reverse: Order[Byte]

def round(a: Byte): Byte

def sign(a: Byte): Sign

def signum(a: Byte): Int

def sum(as: TraversableOnce[Byte]): Byte

def sumOption(as: TraversableOnce[Byte]): Option[Byte]

def sumn(a: Byte, n: Int): Byte

def sumnAboveOne(a: Byte, n: Int): Byte

final def synchronized[T0](arg0: ⇒ T0): T0

def times(a: Byte, b: Byte): Byte

def toDouble(n: Byte): Double

def toString(): String

def tryCompare(x: Byte, y: Byte): Option[Int]

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

def zero: Byte