/libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/ |
D | OldBigIntegerTest.java | 86 assertEquals(i, bi.bitLength()); in test_ConstructorIILjava_util_Random() 176 for (int bitLength = 100; bitLength <= 600; bitLength += 100) { in test_isProbablePrimeI() 177 BigInteger a = BigInteger.probablePrime(bitLength, rand); in test_isProbablePrimeI() 178 BigInteger b = BigInteger.probablePrime(bitLength, rand); in test_isProbablePrimeI() 182 " (bitLength = " + bitLength + ")", in test_isProbablePrimeI() 222 for (int bitLength = 50; bitLength <= 1050; bitLength += 100) { in test_probablePrime() 223 BigInteger a = BigInteger.probablePrime(bitLength, rand); in test_probablePrime()
|
D | BigIntegerConstructorsTest.java | 745 assertTrue("incorrect bitLength", aNumber.bitLength() <= bitLen); in testConstructorRandom() 757 assertEquals(b.toString(), bits, b.bitLength()); in testConstructorPrime() 762 assertEquals(b.toString(), bits, b.bitLength()); in testConstructorPrime() 767 assertEquals(b.toString(), bits, b.bitLength()); in testConstructorPrime() 773 assertEquals(b.toString(), bits, b.bitLength()); in testConstructorPrime() 778 assertTrue(b.toString(), b.bitLength() <= bits); in testConstructorPrime() 783 assertTrue(b.toString(), b.bitLength() <= bits); in testConstructorPrime()
|
D | BigIntegerTest.java | 756 int len = Math.max(i1.bitLength(), i2.bitLength()) + 66; in test_andLjava_math_BigInteger() 772 int len = Math.max(i1.bitLength(), i2.bitLength()) + 66; in test_orLjava_math_BigInteger() 788 int len = Math.max(i1.bitLength(), i2.bitLength()) + 66; in test_xorLjava_math_BigInteger() 803 int len = i1.bitLength() + 66; in test_not() 817 int len = Math.max(i1.bitLength(), i2.bitLength()) + 66; in test_andNotLjava_math_BigInteger()
|
D | BigIntegerHashCodeTest.java | 44 aNumber1.divide(aNumber2).bitLength(); in testSameObject()
|
D | BigIntegerOperateBitsTest.java | 61 assertEquals(0, aNumber.bitLength()); in testBitLengthZero() 71 assertEquals(108, aNumber.bitLength()); in testBitLengthPositive1() 81 assertEquals(96, aNumber.bitLength()); in testBitLengthPositive2() 91 assertEquals(81, aNumber.bitLength()); in testBitLengthPositive3() 101 assertEquals(108, aNumber.bitLength()); in testBitLengthNegative1() 111 assertEquals(96, aNumber.bitLength()); in testBitLengthNegative2() 121 assertEquals(80, aNumber.bitLength()); in testBitLengthNegative3()
|
/libcore/luni/src/test/java/libcore/java/math/ |
D | BigIntegerTest.java | 93 assertTrue(b.toString() + " " + b.bitLength(), b.bitLength() <= 128); in test_Constructor_ILjava_util_Random() 96 assertTrue(b.toString() + " " + b.bitLength(), b.bitLength() <= 16); in test_Constructor_ILjava_util_Random() 99 assertTrue(b.toString() + " " + b.bitLength(), b.bitLength() <= 5); in test_Constructor_ILjava_util_Random() 108 assertEquals(b.toString(), 128, b.bitLength()); in test_Constructor_IILjava_util_Random() 112 assertEquals(b.toString(), 16, b.bitLength()); in test_Constructor_IILjava_util_Random() 116 assertEquals(b.toString(), 5, b.bitLength()); in test_Constructor_IILjava_util_Random() 126 assertEquals(b.toString(), 2, b.bitLength()); in test_Constructor_IILjava_util_Random() 147 assertEquals(b.toString(), 128, b.bitLength()); in test_probablePrime() 151 assertEquals(b.toString(), 16, b.bitLength()); in test_probablePrime() 155 assertEquals(b.toString(), 5, b.bitLength()); in test_probablePrime()
|
/libcore/ojluni/src/main/java/sun/security/util/ |
D | KeyUtil.java | 77 size = pubk.getModulus().bitLength(); in getKeySize() 89 size = params.getOrder().bitLength(); in getKeySize() 95 size = (params != null) ? params.getP().bitLength() : -1; in getKeySize() 98 size = pubk.getParams().getP().bitLength(); in getKeySize()
|
/libcore/ojluni/src/test/java/math/BigInteger/ |
D | BitLengthOverflow.java | 40 x.bitLength()); in test() 55 if (x.bitLength() != (1L << 31)) { in main() 57 x.bitLength()); in main()
|
D | LargeValueExceptions.java | 116 long m = MAX_BITS - x.bitLength(); in multiplyIndefiniteOverflowSuccess() 119 long n = MAX_BITS - y.bitLength(); in multiplyIndefiniteOverflowSuccess() 132 long m = MAX_BITS - x.bitLength(); in multiplyIndefiniteOverflowFailure() 135 long n = MAX_BITS - y.bitLength(); in multiplyIndefiniteOverflowFailure()
|
D | ModInvTime.java | 39 s.bitLength(), prime.bitLength()); in main()
|
D | BigIntegerTest.java | 538 private static void bitLength() { in bitLength() method in BigIntegerTest 543 int tmp = x, bitLength, j; in bitLength() local 546 bitLength = 32 - j; in bitLength() 548 Assert.assertEquals(bigX.bitLength(), bitLength); in bitLength() local 560 for (int j=0; j<x.bitLength(); j++) in bitOps() 565 for (int j=0; j<x.bitLength(); j++) in bitOps() 573 for (int j=0; j<x.bitLength(); j++) in bitOps() 589 for (j=0; j<z.bitLength() && !z.testBit(j); j++) in bitOps() 1049 bitLength(); in testBitLength()
|
/libcore/ojluni/src/main/java/java/math/ |
D | BigInteger.java | 745 public BigInteger(int bitLength, int certainty, Random rnd) { in BigInteger() argument 748 if (bitLength < 2) in BigInteger() 750 prime = (bitLength < SMALL_PRIME_THRESHOLD in BigInteger() 751 ? smallPrime(bitLength, certainty, rnd) in BigInteger() 752 : largePrime(bitLength, certainty, rnd)); in BigInteger() 778 public static BigInteger probablePrime(int bitLength, Random rnd) { in probablePrime() argument 779 if (bitLength < 2) in probablePrime() 782 return (bitLength < SMALL_PRIME_THRESHOLD ? in probablePrime() 783 smallPrime(bitLength, DEFAULT_PRIME_CERTAINTY, rnd) : in probablePrime() 784 largePrime(bitLength, DEFAULT_PRIME_CERTAINTY, rnd)); in probablePrime() [all …]
|
D | MutableBigInteger.java | 1266 … int sigma = (int) Math.max(0, n32 - b.bitLength()); // step 3: sigma = max{T | (2^T)*B < beta^n} in divideAndRemainderBurnikelZiegler() 1273 int t = (int) ((aShifted.bitLength()+n32) / n32); in divideAndRemainderBurnikelZiegler() 1430 long bitLength() { in bitLength() method in MutableBigInteger 1897 if (bitLength() <= 63) { 1919 int bitLength = (int) this.bitLength(); 1920 if (bitLength != this.bitLength()) { 1925 int shift = bitLength - 63;
|
D | BigDecimal.java | 4408 int r = (int)((((long)b.bitLength() + 1) * 646456993) >>> 31);
|
/libcore/ojluni/src/test/java/security/KeyAgreement/ |
D | KeySizeTest.java | 133 if (p.bitLength() != keySize) { in testKeyAttributes() 135 + "%s/%s", p.bitLength(), keySize)); in testKeyAttributes() 154 if (p.bitLength() != keySize) { in testKeyAttributes() 156 + "%s/%s", p.bitLength(), keySize)); in testKeyAttributes()
|
/libcore/ojluni/src/main/java/java/security/spec/ |
D | ECFieldFp.java | 65 return p.bitLength(); in getFieldSize()
|
D | EllipticCurve.java | 63 if (c.bitLength() > m) { in checkValidity()
|
/libcore/ojluni/annotations/sdk/nullability/java/math/ |
D | BigInteger.annotated.java | 45 …public BigInteger(int bitLength, int certainty, @libcore.util.NonNull java.util.Random rnd) { thro… in BigInteger() argument 47 …@libcore.util.NonNull public static BigInteger probablePrime(int bitLength, @libcore.util.NonNull … in probablePrime() argument 119 public int bitLength() { return 0; } in bitLength() method in BigInteger
|
/libcore/support/src/test/java/libcore/javax/net/ssl/ |
D | RandomPrivateKeyX509ExtendedKeyManager.java | 58 int keyLengthBits = originalKeySpec.getModulus().bitLength(); in getPrivateKey()
|
/libcore/ojluni/src/test/java/lang/StrictMath/ |
D | ExactArithTests.java | 296 if (resultBig.bitLength() <= 32) { in testLongExact() 327 return value.bitLength() <= 63; in inLongRange()
|
/libcore/ojluni/src/test/java/lang/Math/ |
D | ExactArithTests.java | 525 if (resultBig.bitLength() <= 32) { in testLongExact() 554 return value.bitLength() <= 63; in inLongRange()
|
/libcore/ojluni/src/main/java/java/text/ |
D | NumberFormat.java | 280 ((BigInteger)number).bitLength() < 64)) { in format()
|
D | DecimalFormat.java | 643 ((BigInteger)number).bitLength () < 64)) { in format()
|
/libcore/ojluni/src/main/java/java/time/ |
D | Duration.java | 1020 if (divRem[0].bitLength() > 63) { in create()
|
/libcore/ojluni/src/main/java/java/time/format/ |
D | DateTimeFormatterBuilder.java | 2958 if (totalBig.bitLength() > 63) { in parse()
|