Searched refs:BigInt (Results 1 – 5 of 5) sorted by relevance
24 final class BigInt { class55 private static BigInt newBigInt() { in newBigInt()56 BigInt bi = new BigInt(); in newBigInt()62 static int cmp(BigInt a, BigInt b) { in cmp()67 void putCopy(BigInt from) { in putCopy()72 BigInt copy() { in copy()73 BigInt bi = new BigInt(); in copy()232 static BigInt shift(BigInt a, int n) { in shift()233 BigInt r = newBigInt(); in shift()250 static int remainderByPositiveInt(BigInt a, int w) { in remainderByPositiveInt()[all …]
47 private transient BigInt bigInt;94 BigInteger(BigInt bigInt) { in BigInteger()102 BigInt bigInt = new BigInt(); in BigInteger()177 BigInt prime = new BigInt(); in BigInteger()183 setBigInt(BigInt.generatePrimeDefault(bitLength)); in BigInteger()216 BigInt bigInt = new BigInt(); in BigInteger()239 BigInt bigInt = new BigInt(); in BigInteger()243 BigInt bigInt = new BigInt(); in BigInteger()283 BigInt bigInt = new BigInt(); in BigInteger()303 BigInt bigInt = new BigInt(); in BigInteger()[all …]
92 BigInt ni = n.getBigInt(); in nextProbablePrime()102 BigInt startPoint = ni.copy(); in nextProbablePrime()103 BigInt probPrime = new BigInt(); in nextProbablePrime()106 startPoint.addPositiveInt(BigInt.remainderByPositiveInt(ni, 2) + 1); in nextProbablePrime()116 modules[i] = BigInt.remainderByPositiveInt(startPoint, primes[i]) - gapSize; in nextProbablePrime()
92 BigInt bi = val.getBigInt().copy(); in multiplyByPositiveInt()
495 BigInt bi = new BigInt(); in BigDecimal()767 … BigInt bi = Multiplication.multiplyByTenPow(augend.getUnscaledValue(),diffScale).getBigInt(); in addAndMult10()