Searched defs:bitLength (Results 1 - 5 of 5) sorted by relevance
/libcore/luni/src/main/java/java/math/ |
H A D | BitLevel.java | 40 /** @see BigInteger#bitLength() */ 41 static int bitLength(BigInteger val) { method in class:BitLevel 89 * must be in the range {@code [0, val.bitLength()-1]} 93 // PRE: 0 <= n < val.bitLength()
|
H A D | BigInt.java | 217 int actualByteCount = (NativeBN.bitLength(this.bignum) + 7) / 8; 221 int bitLength() { method in class:BigInt 222 return NativeBN.bitLength(this.bignum); 337 static BigInt generatePrimeDefault(int bitLength) { argument 339 NativeBN.BN_generate_prime_ex(r.bignum, bitLength, false, 0, 0);
|
H A D | NativeBN.java | 74 public static native int bitLength(long a); method in class:NativeBN
|
H A D | BigInteger.java | 149 * pow(2, bitLength)-1]} which is probably prime. The probability that the 154 * {@code bitLength >= 16}, where this implementation will use OpenSSL's 157 * @param bitLength length of the new {@code BigInteger} in bits. 159 * @throws ArithmeticException if {@code bitLength < 2}. 163 public BigInteger(int bitLength, int certainty, Random random) { argument 164 if (bitLength < 2) { 165 throw new ArithmeticException("bitLength < 2: " + bitLength); 167 if (bitLength < 16) { 171 candidate = random.nextInt() & ((1 << bitLength) 518 public int bitLength() { method in class:BigInteger 1061 probablePrime(int bitLength, Random random) argument [all...] |
H A D | BigDecimal.java | 185 LONG_FIVE_POW_BIT_LENGTH[i] = bitLength(LONG_FIVE_POW[i]); 188 LONG_POWERS_OF_TEN_BIT_LENGTH[i] = bitLength(MathUtils.LONG_POWERS_OF_TEN[i]); 217 private transient int bitLength; field in class:BigDecimal 240 this.bitLength = bitLength(smallValue); 246 this.bitLength = bitLength(smallValue); 345 bitLength = bitLength(smallValue); 489 int mantissaBits = bitLength(mantiss 2961 private static int bitLength(long smallValue) { method in class:BigDecimal 2968 private static int bitLength(int smallValue) { method in class:BigDecimal [all...] |
Completed in 146 milliseconds