Packages

object IdealInt

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. IdealInt
  2. AnyRef
  3. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. final def !=(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  2. final def ##: Int
    Definition Classes
    AnyRef → Any
  3. final def ==(arg0: Any): Boolean
    Definition Classes
    AnyRef → Any
  4. val MINUS_ONE: IdealInt
  5. val ONE: IdealInt
  6. val ZERO: IdealInt
  7. def apply(intString: String, b: Int): IdealInt

    Translates the String representation of an IdealInt with base b into an IdealInt.

  8. def apply(intString: String): IdealInt

    Translates the decimal String representation of an IdealInt into an IdealInt.

  9. def apply(i: BigInteger): IdealInt
  10. def apply(i: Long): IdealInt
  11. def apply(i: Int): IdealInt

    Constructs a IdealInt whose value is equal to that of the specified integer value.

  12. final def asInstanceOf[T0]: T0
    Definition Classes
    Any
  13. def clone(): AnyRef
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.CloneNotSupportedException]) @HotSpotIntrinsicCandidate() @native()
  14. final def eq(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  15. def equals(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef → Any
  16. def gcd(vals: Iterator[IdealInt]): IdealInt

    The gcd of a collection of IdealInt.

  17. def gcd(vals: Iterable[IdealInt]): IdealInt

    The gcd of a collection of IdealInt.

  18. def gcdAndCofactors(vals: Seq[IdealInt]): (IdealInt, Seq[IdealInt])

    Extended Euclidean algorithm for computing both the gcd and the cofactors of a sequence of IdealInt.

  19. def gcdAndCofactors(_a: IdealInt, _b: IdealInt): (IdealInt, IdealInt, IdealInt)

    Extended Euclidean algorithm for computing both the gcd and the cofactors of two IdealInt.

  20. final def getClass(): Class[_ <: AnyRef]
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  21. def hashCode(): Int
    Definition Classes
    AnyRef → Any
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  22. implicit def int2idealInt(i: Int): IdealInt

    Implicit conversion from Int to IdealInt.

  23. final def isInstanceOf[T0]: Boolean
    Definition Classes
    Any
  24. def lcm(vals: Iterator[IdealInt]): IdealInt

    The lcm of a collection of IdealInt.

  25. def lcm(vals: Iterable[IdealInt]): IdealInt

    The lcm of a collection of IdealInt.

  26. def log2(n: IdealInt): Option[Int]

    If n = 2^k, return Some(k), otherwise None.

  27. implicit def long2idealInt(l: Long): IdealInt

    Implicit conversion from Long to IdealInt

  28. def max(els: Iterable[IdealInt]): IdealInt
  29. def max(it: Iterator[IdealInt]): IdealInt

    Compute the maximum of a sequence of IdealInt.

    Compute the maximum of a sequence of IdealInt. If the sequence is empty, ZERO is returned

  30. def min(els: Iterable[IdealInt]): IdealInt
  31. def min(it: Iterator[IdealInt]): IdealInt

    Compute the maximum of a sequence of IdealInt.

    Compute the maximum of a sequence of IdealInt. If the sequence is empty, ZERO is returned

  32. final def ne(arg0: AnyRef): Boolean
    Definition Classes
    AnyRef
  33. final def notify(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  34. final def notifyAll(): Unit
    Definition Classes
    AnyRef
    Annotations
    @HotSpotIntrinsicCandidate() @native()
  35. def parseString(intString: String): Option[IdealInt]
  36. def pow2(exp: IdealInt): IdealInt

    Compute 2^exp.

  37. def pow2(exp: Int): IdealInt

    Compute 2^exp.

  38. def pow2MinusOne(exp: IdealInt): IdealInt

    Compute 2^exp - 1.

  39. def pow2MinusOne(exp: Int): IdealInt

    Compute 2^exp - 1.

  40. def pow2Mod(exp: IdealInt, modulus: IdealInt): IdealInt

    Compute 2^exp % modulus.

  41. def sum(it: Iterator[IdealInt]): IdealInt
  42. def sum(it: Iterable[IdealInt]): IdealInt

    Compute the sum of a sequence of IdealInt

  43. final def synchronized[T0](arg0: => T0): T0
    Definition Classes
    AnyRef
  44. def toString(): String
    Definition Classes
    AnyRef → Any
  45. def unapply(n: IdealInt): Option[Int]

    Extract a 32-bit integer from an IdealInt.

  46. final def wait(arg0: Long, arg1: Int): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  47. final def wait(arg0: Long): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException]) @native()
  48. final def wait(): Unit
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.InterruptedException])
  49. implicit object IdealIntIsIntegral extends Integral[IdealInt]

Deprecated Value Members

  1. def finalize(): Unit
    Attributes
    protected[lang]
    Definition Classes
    AnyRef
    Annotations
    @throws(classOf[java.lang.Throwable]) @Deprecated
    Deprecated

    (Since version 9)

Inherited from AnyRef

Inherited from Any

Ungrouped