ByteIsEuclideanRing

Value Members

1. final def !=(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

2. final def !=(arg0: Any): Boolean

   Definition Classes

   Any

3. final def ##(): Int

   Definition Classes

   AnyRef → Any

4. final def ==(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

5. final def ==(arg0: Any): Boolean

   Definition Classes

   Any

6. def additive: AbGroup[Byte]

   Definition Classes

   AdditiveAbGroup → AdditiveCMonoid → AdditiveCSemigroup → AdditiveGroup → AdditiveMonoid → AdditiveSemigroup

7. final def asInstanceOf[T0]: T0

   Definition Classes

   Any

8. def clone(): AnyRef

   Attributes

   protected[java.lang]

   Definition Classes

   AnyRef

   Annotations

   @throws( ... )

9. final def eq(arg0: AnyRef): Boolean

   Definition Classes

   AnyRef

10. def equals(arg0: Any): Boolean

    Definition Classes

    AnyRef → Any

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

    Attributes

    protected[this]

    Definition Classes

    EuclideanRing

    Annotations

    @tailrec()

12. def finalize(): Unit

    Attributes

    protected[java.lang]

    Definition Classes

    AnyRef

    Annotations

    @throws( classOf[java.lang.Throwable] )

13. 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

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

    Definition Classes

    ByteIsEuclideanRing → EuclideanRing

15. final def getClass(): Class[_]

    Definition Classes

    AnyRef → Any

16. def hashCode(): Int

    Definition Classes

    AnyRef → Any

17. final def isInstanceOf[T0]: Boolean

    Definition Classes

    Any

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

    Definition Classes

    MultiplicativeMonoid

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

    Tests if a is zero.

    Tests if a is zero.

    Definition Classes

    AdditiveMonoid

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

    Definition Classes

    EuclideanRing

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

    Definition Classes

    ByteIsEuclideanRing → AdditiveGroup

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

    Definition Classes

    ByteIsEuclideanRing → EuclideanRing

23. def multiplicative: CMonoid[Byte]

    Definition Classes

    MultiplicativeCMonoid → MultiplicativeCSemigroup → MultiplicativeMonoid → MultiplicativeSemigroup

24. final def ne(arg0: AnyRef): Boolean

    Definition Classes

    AnyRef

25. def negate(a: Byte): Byte

    Definition Classes

    ByteIsEuclideanRing → AdditiveGroup

26. final def notify(): Unit

    Definition Classes

    AnyRef

27. final def notifyAll(): Unit

    Definition Classes

    AnyRef

28. def one: Byte

    Definition Classes

    ByteIsEuclideanRing → MultiplicativeMonoid

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

    Definition Classes

    ByteIsEuclideanRing → AdditiveSemigroup

30. 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

31. 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

32. 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

33. 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

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

    Attributes

    protected

    Definition Classes

    MultiplicativeSemigroup

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

    Definition Classes

    ByteIsEuclideanRing → EuclideanRing

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

    Definition Classes

    EuclideanRing

37. 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

38. 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

39. 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

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

    Attributes

    protected

    Definition Classes

    AdditiveSemigroup

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

    Definition Classes

    AnyRef

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

    Definition Classes

    ByteIsEuclideanRing → MultiplicativeSemigroup

43. def toString(): String

    Definition Classes

    AnyRef → Any

44. final def wait(): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

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

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

46. final def wait(arg0: Long): Unit

    Definition Classes

    AnyRef

    Annotations

    @throws( ... )

47. def zero: Byte

    Definition Classes

    ByteIsEuclideanRing → AdditiveMonoid