Searched refs:inv (Results 1 – 2 of 2) sorted by relevance
/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 | 2768 private static int[] montgomeryMultiply(int[] a, int[] b, int[] n, int len, long inv, in montgomeryMultiply() argument 2774 return montReduce(product, n, len, (int)inv); in montgomeryMultiply() 2776 return implMontgomeryMultiply(a, b, n, len, inv, materialize(product, len)); in montgomeryMultiply() 2779 private static int[] montgomerySquare(int[] a, int[] n, int len, long inv, in montgomerySquare() argument 2785 return montReduce(product, n, len, (int)inv); in montgomerySquare() 2787 return implMontgomerySquare(a, n, len, inv, materialize(product, len)); in montgomerySquare() 2822 long inv, int[] product) { in implMontgomeryMultiply() argument 2824 return montReduce(product, n, len, (int)inv); in implMontgomeryMultiply() 2827 long inv, int[] product) { in implMontgomerySquare() argument 2829 return montReduce(product, n, len, (int)inv); in implMontgomerySquare() [all …]
|