| /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 | BigIntegerHashCodeTest.java | 44 aNumber1.divide(aNumber2).bitLength(); in testSameObject()
|
| 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 | 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/main/java/java/math/ |
| D | BigInteger.java | 174 private int bitLength; field in BigInteger
664 public BigInteger(int bitLength, int certainty, @NonNull Random rnd) { in BigInteger() argument
667 if (bitLength < 2) in BigInteger()
669 prime = (bitLength < SMALL_PRIME_THRESHOLD in BigInteger()
670 ? smallPrime(bitLength, certainty, rnd) in BigInteger()
671 : largePrime(bitLength, certainty, rnd)); in BigInteger()
697 @NonNull public static BigInteger probablePrime(int bitLength, @NonNull Random rnd) { in probablePrime() argument
698 if (bitLength < 2) in probablePrime()
701 return (bitLength < SMALL_PRIME_THRESHOLD ? in probablePrime()
702 smallPrime(bitLength, DEFAULT_PRIME_CERTAINTY, rnd) : in probablePrime()
[all …]
|
| D | MutableBigInteger.java | 1261 … int sigma = (int) Math.max(0, n32 - b.bitLength()); // step 3: sigma = max{T | (2^T)*B < beta^n} in divideAndRemainderBurnikelZiegler()
1268 int t = (int) ((aShifted.bitLength()+n32) / n32); in divideAndRemainderBurnikelZiegler()
1425 long bitLength() { in bitLength() method in MutableBigInteger
|
| D | BigDecimal.java | 3850 int r = (int)((((long)b.bitLength() + 1) * 646456993) >>> 31); in bigDigitLength()
|
| /libcore/ojluni/src/main/java/java/security/spec/ |
| D | EllipticCurve.java | 63 if (c.bitLength() > m) { in checkValidity()
|
| /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 | 246 if (resultBig.bitLength() <= 32) { in testLongExact()
276 return value.bitLength() <= 63; in inLongRange()
|
| /libcore/ojluni/src/test/java/lang/Math/ |
| D | ExactArithTests.java | 304 if (resultBig.bitLength() <= 32) { in testLongExact()
334 return value.bitLength() <= 63; in inLongRange()
|
| /libcore/ojluni/src/main/java/java/text/ |
| D | NumberFormat.java | 241 ((BigInteger)number).bitLength() < 64)) { in format()
|
| D | DecimalFormat.java | 631 ((BigInteger)number).bitLength () < 64)) { in format()
|
| /libcore/ojluni/src/main/java/java/time/ |
| D | Duration.java | 1019 if (divRem[0].bitLength() > 63) { in create()
|