@sitevision/api 2023.2.1 → 2023.2.2-beta.1

package/types/java/math/BigDecimal/index.js

@@ -0,0 +1,50 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports["default"] = void 0;
+var _default = {
+  valueOf: function valueOf() {},
+  add: function add() {},
+  subtract: function subtract() {},
+  multiply: function multiply() {},
+  divide: function divide() {},
+  divideToIntegralValue: function divideToIntegralValue() {},
+  remainder: function remainder() {},
+  divideAndRemainder: function divideAndRemainder() {},
+  pow: function pow() {},
+  abs: function abs() {},
+  negate: function negate() {},
+  plus: function plus() {},
+  signum: function signum() {},
+  scale: function scale() {},
+  precision: function precision() {},
+  unscaledValue: function unscaledValue() {},
+  round: function round() {},
+  setScale: function setScale() {},
+  movePointLeft: function movePointLeft() {},
+  movePointRight: function movePointRight() {},
+  scaleByPowerOfTen: function scaleByPowerOfTen() {},
+  stripTrailingZeros: function stripTrailingZeros() {},
+  compareTo: function compareTo() {},
+  equals: function equals() {},
+  min: function min() {},
+  max: function max() {},
+  hashCode: function hashCode() {},
+  toString: function toString() {},
+  toEngineeringString: function toEngineeringString() {},
+  toPlainString: function toPlainString() {},
+  toBigInteger: function toBigInteger() {},
+  toBigIntegerExact: function toBigIntegerExact() {},
+  longValue: function longValue() {},
+  longValueExact: function longValueExact() {},
+  intValue: function intValue() {},
+  intValueExact: function intValueExact() {},
+  shortValueExact: function shortValueExact() {},
+  byteValueExact: function byteValueExact() {},
+  floatValue: function floatValue() {},
+  doubleValue: function doubleValue() {},
+  ulp: function ulp() {}
+};
+exports["default"] = _default;

package/types/java/math/BigInteger/index.d.ts

@@ -0,0 +1,592 @@
+import type { Random } from "../../util/Random";
+
+import type { Object } from "../../lang/Object";
+import type { String } from "../../lang/String";
+
+import type { Number } from "../../lang/Number";
+import type { Comparable } from "../../lang/Comparable";
+
+/**
+ * Immutable arbitrary-precision integers.  All operations behave as if
+ *  BigIntegers were represented in two's-complement notation (like Java's
+ *  primitive integer types).  BigInteger provides analogues to all of Java's
+ *  primitive integer operators, and all relevant methods from java.lang.Math.
+ *  Additionally, BigInteger provides operations for modular arithmetic, GCD
+ *  calculation, primality testing, prime generation, bit manipulation,
+ *  and a few other miscellaneous operations.
+ *
+ *  <p>Semantics of arithmetic operations exactly mimic those of Java's integer
+ *  arithmetic operators, as defined in <i>The Java Language Specification</i>.
+ *  For example, division by zero throws an {@code ArithmeticException}, and
+ *  division of a negative by a positive yields a negative (or zero) remainder.
+ *  All of the details in the Spec concerning overflow are ignored, as
+ *  BigIntegers are made as large as necessary to accommodate the results of an
+ *  operation.
+ *
+ *  <p>Semantics of shift operations extend those of Java's shift operators
+ *  to allow for negative shift distances.  A right-shift with a negative
+ *  shift distance results in a left shift, and vice-versa.  The unsigned
+ *  right shift operator ({@code >>>}) is omitted, as this operation makes
+ *  little sense in combination with the "infinite word size" abstraction
+ *  provided by this class.
+ *
+ *  <p>Semantics of bitwise logical operations exactly mimic those of Java's
+ *  bitwise integer operators.  The binary operators ({@code and},
+ *  {@code or}, {@code xor}) implicitly perform sign extension on the shorter
+ *  of the two operands prior to performing the operation.
+ *
+ *  <p>Comparison operations perform signed integer comparisons, analogous to
+ *  those performed by Java's relational and equality operators.
+ *
+ *  <p>Modular arithmetic operations are provided to compute residues, perform
+ *  exponentiation, and compute multiplicative inverses.  These methods always
+ *  return a non-negative result, between {@code 0} and {@code (modulus - 1)},
+ *  inclusive.
+ *
+ *  <p>Bit operations operate on a single bit of the two's-complement
+ *  representation of their operand.  If necessary, the operand is sign-
+ *  extended so that it contains the designated bit.  None of the single-bit
+ *  operations can produce a BigInteger with a different sign from the
+ *  BigInteger being operated on, as they affect only a single bit, and the
+ *  "infinite word size" abstraction provided by this class ensures that there
+ *  are infinitely many "virtual sign bits" preceding each BigInteger.
+ *
+ *  <p>For the sake of brevity and clarity, pseudo-code is used throughout the
+ *  descriptions of BigInteger methods.  The pseudo-code expression
+ *  {@code (i + j)} is shorthand for "a BigInteger whose value is
+ *  that of the BigInteger {@code i} plus that of the BigInteger {@code j}."
+ *  The pseudo-code expression {@code (i == j)} is shorthand for
+ *  "{@code true} if and only if the BigInteger {@code i} represents the same
+ *  value as the BigInteger {@code j}."  Other pseudo-code expressions are
+ *  interpreted similarly.
+ *
+ *  <p>All methods and constructors in this class throw
+ *  {@code NullPointerException} when passed
+ *  a null object reference for any input parameter.
+ *
+ *  BigInteger must support values in the range
+ *  -2<sup>{@code Integer.MAX_VALUE}</sup> (exclusive) to
+ *  +2<sup>{@code Integer.MAX_VALUE}</sup> (exclusive)
+ *  and may support values outside of that range.
+ *
+ *  The range of probable prime values is limited and may be less than
+ *  the full supported positive range of {@code BigInteger}.
+ *  The range must be at least 1 to 2<sup>500000000</sup>.
+ * @implNote BigInteger constructors and operations throw {@code ArithmeticException} when&#xA; the result is out of the supported range of&#xA; -2<sup>{@code Integer.MAX_VALUE}</sup> (exclusive) to&#xA; +2<sup>{@code Integer.MAX_VALUE}</sup> (exclusive).
+ * @see BigDecimal
+ * @author Josh Bloch
+ * @author Michael McCloskey
+ * @author Alan Eliasen
+ * @author Timothy Buktu
+ * @since JDK1.1
+ */
+export type BigInteger = Number &
+  Comparable & {
+    /**
+     * Returns a positive BigInteger that is probably prime, with the
+     *  specified bitLength. The probability that a BigInteger returned
+     *  by this method is composite does not exceed 2<sup>-100</sup>.
+     * @param bitLength bitLength of the returned BigInteger.
+     * @param rnd source of random bits used to select candidates to be&#xA; tested for primality.
+     * @return a BigInteger of {@code bitLength} bits that is probably prime
+     * @throws ArithmeticException {@code bitLength < 2} or {@code bitLength} is too large.
+     * @see #bitLength()
+     * @since 1.4
+     */
+    probablePrime(bitLength: number, rnd: Random): BigInteger;
+
+    /**
+     * Returns the first integer greater than this {@code BigInteger} that
+     *  is probably prime.  The probability that the number returned by this
+     *  method is composite does not exceed 2<sup>-100</sup>. This method will
+     *  never skip over a prime when searching: if it returns {@code p}, there
+     *  is no prime {@code q} such that {@code this < q < p}.
+     * @return the first integer greater than this {@code BigInteger} that&#xA; is probably prime.
+     * @throws ArithmeticException {@code this < 0} or {@code this} is too large.
+     * @since 1.5
+     */
+    nextProbablePrime(): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is equal to that of the
+     *  specified {@code long}.  This "static factory method" is
+     *  provided in preference to a ({@code long}) constructor
+     *  because it allows for reuse of frequently used BigIntegers.
+     * @param val value of the BigInteger to return.
+     * @return a BigInteger with the specified value.
+     */
+    valueOf(val: number): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is {@code (this + val)}.
+     * @param val value to be added to this BigInteger.
+     * @return {@code this + val}
+     */
+    add(val: BigInteger): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is {@code (this - val)}.
+     * @param val value to be subtracted from this BigInteger.
+     * @return {@code this - val}
+     */
+    subtract(val: BigInteger): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is {@code (this * val)}.
+     * @implNote An implementation may offer better algorithmic&#xA; performance when {@code val == this}.
+     * @param val value to be multiplied by this BigInteger.
+     * @return {@code this * val}
+     */
+    multiply(val: BigInteger): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is {@code (this / val)}.
+     * @param val value by which this BigInteger is to be divided.
+     * @return {@code this / val}
+     * @throws ArithmeticException if {@code val} is zero.
+     */
+    divide(val: BigInteger): BigInteger;
+
+    /**
+     * Returns an array of two BigIntegers containing {@code (this / val)}
+     *  followed by {@code (this % val)}.
+     * @param val value by which this BigInteger is to be divided, and the&#xA; remainder computed.
+     * @return an array of two BigIntegers: the quotient {@code (this / val)}&#xA; is the initial element, and the remainder {@code (this % val)}&#xA; is the final element.
+     * @throws ArithmeticException if {@code val} is zero.
+     */
+    divideAndRemainder(val: BigInteger): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is {@code (this % val)}.
+     * @param val value by which this BigInteger is to be divided, and the&#xA; remainder computed.
+     * @return {@code this % val}
+     * @throws ArithmeticException if {@code val} is zero.
+     */
+    remainder(val: BigInteger): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is <tt>(this<sup>exponent</sup>)</tt>.
+     *  Note that {@code exponent} is an integer rather than a BigInteger.
+     * @param exponent exponent to which this BigInteger is to be raised.
+     * @return <tt>this<sup>exponent</sup></tt>
+     * @throws ArithmeticException {@code exponent} is negative. (This would&#xA; cause the operation to yield a non-integer value.)
+     */
+    pow(exponent: number): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is the greatest common divisor of
+     *  {@code abs(this)} and {@code abs(val)}.  Returns 0 if
+     *  {@code this == 0 && val == 0}.
+     * @param val value with which the GCD is to be computed.
+     * @return {@code GCD(abs(this), abs(val))}
+     */
+    gcd(val: BigInteger): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is the absolute value of this
+     *  BigInteger.
+     * @return {@code abs(this)}
+     */
+    abs(): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is {@code (-this)}.
+     * @return {@code -this}
+     */
+    negate(): BigInteger;
+
+    /**
+     * Returns the signum function of this BigInteger.
+     * @return -1, 0 or 1 as the value of this BigInteger is negative, zero or&#xA; positive.
+     */
+    signum(): number;
+
+    /**
+     * Returns a BigInteger whose value is {@code (this mod m}).  This method
+     *  differs from {@code remainder} in that it always returns a
+     *  <i>non-negative</i> BigInteger.
+     * @param m the modulus.
+     * @return {@code this mod m}
+     * @throws ArithmeticException {@code m} &le; 0
+     * @see #remainder
+     */
+    mod(m: BigInteger): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is
+     *  <tt>(this<sup>exponent</sup> mod m)</tt>.  (Unlike {@code pow}, this
+     *  method permits negative exponents.)
+     * @param exponent the exponent.
+     * @param m the modulus.
+     * @return <tt>this<sup>exponent</sup> mod m</tt>
+     * @throws ArithmeticException {@code m} &le; 0 or the exponent is&#xA; negative and this BigInteger is not <i>relatively&#xA; prime</i> to {@code m}.
+     * @see #modInverse
+     */
+    modPow(exponent: BigInteger, m: BigInteger): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is {@code (this}<sup>-1</sup> {@code mod m)}.
+     * @param m the modulus.
+     * @return {@code this}<sup>-1</sup> {@code mod m}.
+     * @throws ArithmeticException {@code m} &le; 0, or this BigInteger&#xA; has no multiplicative inverse mod m (that is, this BigInteger&#xA; is not <i>relatively prime</i> to m).
+     */
+    modInverse(m: BigInteger): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is {@code (this << n)}.
+     *  The shift distance, {@code n}, may be negative, in which case
+     *  this method performs a right shift.
+     *  (Computes <tt>floor(this * 2<sup>n</sup>)</tt>.)
+     * @param n shift distance, in bits.
+     * @return {@code this << n}
+     * @see #shiftRight
+     */
+    shiftLeft(n: number): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is {@code (this >> n)}.  Sign
+     *  extension is performed.  The shift distance, {@code n}, may be
+     *  negative, in which case this method performs a left shift.
+     *  (Computes <tt>floor(this / 2<sup>n</sup>)</tt>.)
+     * @param n shift distance, in bits.
+     * @return {@code this >> n}
+     * @see #shiftLeft
+     */
+    shiftRight(n: number): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is {@code (this & val)}.  (This
+     *  method returns a negative BigInteger if and only if this and val are
+     *  both negative.)
+     * @param val value to be AND'ed with this BigInteger.
+     * @return {@code this & val}
+     */
+    and(val: BigInteger): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is {@code (this | val)}.  (This method
+     *  returns a negative BigInteger if and only if either this or val is
+     *  negative.)
+     * @param val value to be OR'ed with this BigInteger.
+     * @return {@code this | val}
+     */
+    or(val: BigInteger): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is {@code (this ^ val)}.  (This method
+     *  returns a negative BigInteger if and only if exactly one of this and
+     *  val are negative.)
+     * @param val value to be XOR'ed with this BigInteger.
+     * @return {@code this ^ val}
+     */
+    xor(val: BigInteger): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is {@code (~this)}.  (This method
+     *  returns a negative value if and only if this BigInteger is
+     *  non-negative.)
+     * @return {@code ~this}
+     */
+    not(): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is {@code (this & ~val)}.  This
+     *  method, which is equivalent to {@code and(val.not())}, is provided as
+     *  a convenience for masking operations.  (This method returns a negative
+     *  BigInteger if and only if {@code this} is negative and {@code val} is
+     *  positive.)
+     * @param val value to be complemented and AND'ed with this BigInteger.
+     * @return {@code this & ~val}
+     */
+    andNot(val: BigInteger): BigInteger;
+
+    /**
+     * Returns {@code true} if and only if the designated bit is set.
+     *  (Computes {@code ((this & (1<<n)) != 0)}.)
+     * @param n index of bit to test.
+     * @return {@code true} if and only if the designated bit is set.
+     * @throws ArithmeticException {@code n} is negative.
+     */
+    testBit(n: number): boolean;
+
+    /**
+     * Returns a BigInteger whose value is equivalent to this BigInteger
+     *  with the designated bit set.  (Computes {@code (this | (1<<n))}.)
+     * @param n index of bit to set.
+     * @return {@code this | (1<<n)}
+     * @throws ArithmeticException {@code n} is negative.
+     */
+    setBit(n: number): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is equivalent to this BigInteger
+     *  with the designated bit cleared.
+     *  (Computes {@code (this & ~(1<<n))}.)
+     * @param n index of bit to clear.
+     * @return {@code this & ~(1<<n)}
+     * @throws ArithmeticException {@code n} is negative.
+     */
+    clearBit(n: number): BigInteger;
+
+    /**
+     * Returns a BigInteger whose value is equivalent to this BigInteger
+     *  with the designated bit flipped.
+     *  (Computes {@code (this ^ (1<<n))}.)
+     * @param n index of bit to flip.
+     * @return {@code this ^ (1<<n)}
+     * @throws ArithmeticException {@code n} is negative.
+     */
+    flipBit(n: number): BigInteger;
+
+    /**
+     * Returns the index of the rightmost (lowest-order) one bit in this
+     *  BigInteger (the number of zero bits to the right of the rightmost
+     *  one bit).  Returns -1 if this BigInteger contains no one bits.
+     *  (Computes {@code (this == 0? -1 : log2(this & -this))}.)
+     * @return index of the rightmost one bit in this BigInteger.
+     */
+    getLowestSetBit(): number;
+
+    /**
+     * Returns the number of bits in the minimal two's-complement
+     *  representation of this BigInteger, <i>excluding</i> a sign bit.
+     *  For positive BigIntegers, this is equivalent to the number of bits in
+     *  the ordinary binary representation.  (Computes
+     *  {@code (ceil(log2(this < 0 ? -this : this+1)))}.)
+     * @return number of bits in the minimal two's-complement&#xA; representation of this BigInteger, <i>excluding</i> a sign bit.
+     */
+    bitLength(): number;
+
+    /**
+     * Returns the number of bits in the two's complement representation
+     *  of this BigInteger that differ from its sign bit.  This method is
+     *  useful when implementing bit-vector style sets atop BigIntegers.
+     * @return number of bits in the two's complement representation&#xA; of this BigInteger that differ from its sign bit.
+     */
+    bitCount(): number;
+
+    /**
+     * Returns {@code true} if this BigInteger is probably prime,
+     *  {@code false} if it's definitely composite.  If
+     *  {@code certainty} is &le; 0, {@code true} is
+     *  returned.
+     * @param certainty a measure of the uncertainty that the caller is&#xA; willing to tolerate: if the call returns {@code true}&#xA; the probability that this BigInteger is prime exceeds&#xA; (1 - 1/2<sup>{@code certainty}</sup>). The execution time of&#xA; this method is proportional to the value of this parameter.
+     * @return {@code true} if this BigInteger is probably prime,&#xA; {@code false} if it's definitely composite.
+     */
+    isProbablePrime(certainty: number): boolean;
+
+    /**
+     * Compares this BigInteger with the specified BigInteger.  This
+     *  method is provided in preference to individual methods for each
+     *  of the six boolean comparison operators ({@literal <}, ==,
+     *  {@literal >}, {@literal >=}, !=, {@literal <=}).  The suggested
+     *  idiom for performing these comparisons is: {@code
+     *  (x.compareTo(y)} &lt;<i>op</i>&gt; {@code 0)}, where
+     *  &lt;<i>op</i>&gt; is one of the six comparison operators.
+     * @param val BigInteger to which this BigInteger is to be compared.
+     * @return -1, 0 or 1 as this BigInteger is numerically less than, equal&#xA; to, or greater than {@code val}.
+     */
+    compareTo(val: BigInteger): number;
+
+    /**
+     * Compares this BigInteger with the specified Object for equality.
+     * @param x Object to which this BigInteger is to be compared.
+     * @return {@code true} if and only if the specified Object is a&#xA; BigInteger whose value is numerically equal to this BigInteger.
+     */
+    equals(x: unknown): boolean;
+
+    /**
+     * Returns the minimum of this BigInteger and {@code val}.
+     * @param val value with which the minimum is to be computed.
+     * @return the BigInteger whose value is the lesser of this BigInteger and&#xA; {@code val}. If they are equal, either may be returned.
+     */
+    min(val: BigInteger): BigInteger;
+
+    /**
+     * Returns the maximum of this BigInteger and {@code val}.
+     * @param val value with which the maximum is to be computed.
+     * @return the BigInteger whose value is the greater of this and&#xA; {@code val}. If they are equal, either may be returned.
+     */
+    max(val: BigInteger): BigInteger;
+
+    /**
+     * Returns the hash code for this BigInteger.
+     * @return hash code for this BigInteger.
+     */
+    hashCode(): number;
+
+    /**
+     * Returns the String representation of this BigInteger in the
+     *  given radix.  If the radix is outside the range from {@link
+     *  Character#MIN_RADIX} to {@link Character#MAX_RADIX} inclusive,
+     *  it will default to 10 (as is the case for
+     *  {@code Integer.toString}).  The digit-to-character mapping
+     *  provided by {@code Character.forDigit} is used, and a minus
+     *  sign is prepended if appropriate.  (This representation is
+     *  compatible with the {@link #BigInteger(String, int) (String,
+     *  int)} constructor.)
+     * @param radix radix of the String representation.
+     * @return String representation of this BigInteger in the given radix.
+     * @see Integer#toString
+     * @see Character#forDigit
+     * @see #BigInteger(java.lang.String, int)
+     */
+    toString(radix: number): string;
+
+    /**
+     * Returns the decimal String representation of this BigInteger.
+     *  The digit-to-character mapping provided by
+     *  {@code Character.forDigit} is used, and a minus sign is
+     *  prepended if appropriate.  (This representation is compatible
+     *  with the {@link #BigInteger(String) (String)} constructor, and
+     *  allows for String concatenation with Java's + operator.)
+     * @return decimal String representation of this BigInteger.
+     * @see Character#forDigit
+     * @see #BigInteger(java.lang.String)
+     */
+    toString(): string;
+
+    /**
+     * Returns a byte array containing the two's-complement
+     *  representation of this BigInteger.  The byte array will be in
+     *  <i>big-endian</i> byte-order: the most significant byte is in
+     *  the zeroth element.  The array will contain the minimum number
+     *  of bytes required to represent this BigInteger, including at
+     *  least one sign bit, which is {@code (ceil((this.bitLength() +
+     *  1)/8))}.  (This representation is compatible with the
+     *  {@link #BigInteger(byte[]) (byte[])} constructor.)
+     * @return a byte array containing the two's-complement representation of&#xA; this BigInteger.
+     * @see #BigInteger(byte[])
+     */
+    toByteArray(): unknown;
+
+    /**
+     * Converts this BigInteger to an {@code int}.  This
+     *  conversion is analogous to a
+     *  <i>narrowing primitive conversion</i> from {@code long} to
+     *  {@code int} as defined in section 5.1.3 of
+     *  <cite>The Java&trade; Language Specification</cite>:
+     *  if this BigInteger is too big to fit in an
+     *  {@code int}, only the low-order 32 bits are returned.
+     *  Note that this conversion can lose information about the
+     *  overall magnitude of the BigInteger value as well as return a
+     *  result with the opposite sign.
+     * @return this BigInteger converted to an {@code int}.
+     * @see #intValueExact()
+     */
+    intValue(): number;
+
+    /**
+     * Converts this BigInteger to a {@code long}.  This
+     *  conversion is analogous to a
+     *  <i>narrowing primitive conversion</i> from {@code long} to
+     *  {@code int} as defined in section 5.1.3 of
+     *  <cite>The Java&trade; Language Specification</cite>:
+     *  if this BigInteger is too big to fit in a
+     *  {@code long}, only the low-order 64 bits are returned.
+     *  Note that this conversion can lose information about the
+     *  overall magnitude of the BigInteger value as well as return a
+     *  result with the opposite sign.
+     * @return this BigInteger converted to a {@code long}.
+     * @see #longValueExact()
+     */
+    longValue(): number;
+
+    /**
+     * Converts this BigInteger to a {@code float}.  This
+     *  conversion is similar to the
+     *  <i>narrowing primitive conversion</i> from {@code double} to
+     *  {@code float} as defined in section 5.1.3 of
+     *  <cite>The Java&trade; Language Specification</cite>:
+     *  if this BigInteger has too great a magnitude
+     *  to represent as a {@code float}, it will be converted to
+     *  {@link Float#NEGATIVE_INFINITY} or {@link
+     *  Float#POSITIVE_INFINITY} as appropriate.  Note that even when
+     *  the return value is finite, this conversion can lose
+     *  information about the precision of the BigInteger value.
+     * @return this BigInteger converted to a {@code float}.
+     */
+    floatValue(): number;
+
+    /**
+     * Converts this BigInteger to a {@code double}.  This
+     *  conversion is similar to the
+     *  <i>narrowing primitive conversion</i> from {@code double} to
+     *  {@code float} as defined in section 5.1.3 of
+     *  <cite>The Java&trade; Language Specification</cite>:
+     *  if this BigInteger has too great a magnitude
+     *  to represent as a {@code double}, it will be converted to
+     *  {@link Double#NEGATIVE_INFINITY} or {@link
+     *  Double#POSITIVE_INFINITY} as appropriate.  Note that even when
+     *  the return value is finite, this conversion can lose
+     *  information about the precision of the BigInteger value.
+     * @return this BigInteger converted to a {@code double}.
+     */
+    doubleValue(): number;
+
+    /**
+     * Converts this {@code BigInteger} to a {@code long}, checking
+     *  for lost information.  If the value of this {@code BigInteger}
+     *  is out of the range of the {@code long} type, then an
+     *  {@code ArithmeticException} is thrown.
+     * @return this {@code BigInteger} converted to a {@code long}.
+     * @throws ArithmeticException if the value of {@code this} will&#xA; not exactly fit in a {@code long}.
+     * @see BigInteger#longValue
+     * @since 1.8
+     */
+    longValueExact(): number;
+
+    /**
+     * Converts this {@code BigInteger} to an {@code int}, checking
+     *  for lost information.  If the value of this {@code BigInteger}
+     *  is out of the range of the {@code int} type, then an
+     *  {@code ArithmeticException} is thrown.
+     * @return this {@code BigInteger} converted to an {@code int}.
+     * @throws ArithmeticException if the value of {@code this} will&#xA; not exactly fit in a {@code int}.
+     * @see BigInteger#intValue
+     * @since 1.8
+     */
+    intValueExact(): number;
+
+    /**
+     * Converts this {@code BigInteger} to a {@code short}, checking
+     *  for lost information.  If the value of this {@code BigInteger}
+     *  is out of the range of the {@code short} type, then an
+     *  {@code ArithmeticException} is thrown.
+     * @return this {@code BigInteger} converted to a {@code short}.
+     * @throws ArithmeticException if the value of {@code this} will&#xA; not exactly fit in a {@code short}.
+     * @see BigInteger#shortValue
+     * @since 1.8
+     */
+    shortValueExact(): number;
+
+    /**
+     * Converts this {@code BigInteger} to a {@code byte}, checking
+     *  for lost information.  If the value of this {@code BigInteger}
+     *  is out of the range of the {@code byte} type, then an
+     *  {@code ArithmeticException} is thrown.
+     * @return this {@code BigInteger} converted to a {@code byte}.
+     * @throws ArithmeticException if the value of {@code this} will&#xA; not exactly fit in a {@code byte}.
+     * @see BigInteger#byteValue
+     * @since 1.8
+     */
+    byteValueExact(): unknown;
+
+    /**
+     * The BigInteger constant zero.
+     * @since 1.2
+     */
+    ZERO: BigInteger;
+
+    /**
+     * The BigInteger constant one.
+     * @since 1.2
+     */
+    ONE: BigInteger;
+
+    /**
+     * The BigInteger constant ten.
+     * @since 1.5
+     */
+    TEN: BigInteger;
+  };