Searched refs:inv (Results 1 – 4 of 4) sorted by relevance
| /libcore/ojluni/src/test/java/math/BigInteger/ |
| D | ModInvTime.java | 52 public static void check(BigInteger val, BigInteger mod, BigInteger inv) { in check() argument
53 BigInteger r = inv.multiply(val).remainder(mod); in check()
|
| D | BigIntegerTest.java | 722 BigInteger inv = x.modInverse(m); in modInv() local
723 BigInteger prod = inv.multiply(x).remainder(m); in modInv()
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/ |
| D | BigIntegerTest.java | 364 BigInteger a = zero, mod, inv; in test_modInverseLjava_math_BigInteger() local
370 inv = a.modInverse(mod); in test_modInverseLjava_math_BigInteger()
372 + " equals " + inv, one.equals(a.multiply(inv).mod( in test_modInverseLjava_math_BigInteger()
375 + " inv mod " + mod + " equals " + inv, inv in test_modInverseLjava_math_BigInteger()
378 + mod + " equals " + inv, inv in test_modInverseLjava_math_BigInteger()
391 inv = a.modInverse(mod); in test_modInverseLjava_math_BigInteger()
393 + " equals " + inv, one.equals(a.multiply(inv).mod( in test_modInverseLjava_math_BigInteger()
396 + " inv mod " + mod + " equals " + inv, inv in test_modInverseLjava_math_BigInteger()
399 + mod + " equals " + inv, inv in test_modInverseLjava_math_BigInteger()
|
| /libcore/ojluni/src/main/java/java/math/ |
| D | BigInteger.java | 2967 private static int[] montgomeryMultiply(int[] a, int[] b, int[] n, int len, long inv, in montgomeryMultiply() argument
2973 return montReduce(product, n, len, (int)inv); in montgomeryMultiply()
2975 return implMontgomeryMultiply(a, b, n, len, inv, materialize(product, len)); in montgomeryMultiply()
2978 private static int[] montgomerySquare(int[] a, int[] n, int len, long inv, in montgomerySquare() argument
2984 return montReduce(product, n, len, (int)inv); in montgomerySquare()
2986 return implMontgomerySquare(a, n, len, inv, materialize(product, len)); in montgomerySquare()
3022 long inv, int[] product) { in implMontgomeryMultiply() argument
3024 return montReduce(product, n, len, (int)inv); in implMontgomeryMultiply()
3028 long inv, int[] product) { in implMontgomerySquare() argument
3030 return montReduce(product, n, len, (int)inv); in implMontgomerySquare()
[all …]
|