svn commit: r493586 - /harmony/enhanced/classlib/trunk/modules/math/src/main/java/java/math/Division.java

[te...@apache.org]

Author: tellison
Date: Sat Jan  6 13:57:24 2007
New Revision: 493586

URL: http://svn.apache.org/viewvc?view=rev&rev=493586
Log:
Apply patch for HARMONY-2864 ([Classlib][math] Wrong words in math module)

Modified:
    harmony/enhanced/classlib/trunk/modules/math/src/main/java/java/math/Division.java

Modified: harmony/enhanced/classlib/trunk/modules/math/src/main/java/java/math/Division.java
URL: http://svn.apache.org/viewvc/harmony/enhanced/classlib/trunk/modules/math/src/main/java/java/math/Division.java?view=diff&rev=493586&r1=493585&r2=493586
==============================================================================
--- harmony/enhanced/classlib/trunk/modules/math/src/main/java/java/math/Division.java (original)
+++ harmony/enhanced/classlib/trunk/modules/math/src/main/java/java/math/Division.java Sat Jan  6 13:57:24 2007
@@ -303,7 +303,7 @@
     }
 
     /**
-     * Computes the quotient and the remainder after a divison by an {@code int}
+     * Computes the quotient and the remainder after a division by an {@code int}
      * number.
      * 
      * @return an array of the form {@code [quotient, remainder]}.
@@ -343,7 +343,7 @@
     }
 
     /**
-     * Multipies an array by int and subtracts it from a subarray of another
+     * Multiplies an array by int and subtracts it from a subarray of another
      * array.
      * 
      * @param a the array to subtract from
@@ -451,9 +451,9 @@
      * type.
      * 
      * @param op1
-     *            a postive number
+     *            a positive number
      * @param op2
-     *            a postive number
+     *            a positive number
      * @see #gcdBinary(BigInteger, BigInteger)
      * @return <code>GCD(op1, op2)</code>
      */
@@ -486,7 +486,7 @@
     
     /**
      * Calculates a.modInverse(p) Based on: Savas, E; Koc, C "The Montgomery Modular
-     * Inverse - Revisted"
+     * Inverse - Revised"
      */
     static BigInteger modInverseMontgomery(BigInteger a, BigInteger p) {
 
@@ -576,7 +576,7 @@
 
         r.sign = 1;
         while (v.signum() > 0) {
-            // INV v >= 0, u >= 0, v odd, u odd (excepto last iteration when v is even (0))
+            // INV v >= 0, u >= 0, v odd, u odd (except last iteration when v is even (0))
     
             while (u.compareTo(v) > BigInteger.EQUALS) {
                 Elementary.inplaceSubtract(u, v);
@@ -681,7 +681,7 @@
         int k;
         while (!isPowerOfTwo(u, coefU) && !isPowerOfTwo(v, coefV)) {
             
-            // modification of orignal algorithm: I calculate how many times the algorithm will enter in the same branch of if
+            // modification of original algorithm: I calculate how many times the algorithm will enter in the same branch of if
             k = howManyIterations(u, n);
             
             if (k != 0) {
@@ -815,7 +815,7 @@
     
     /**
      * Performs modular exponentiation using the Montgomery Reduction. It
-     * requires that all parameters be postivive and the mudulus be odd. >
+     * requires that all parameters be positive and the modulus be odd. >
      * 
      * @see BigInteger#modPow(BigInteger, BigInteger)
      * @see #monPro(BigInteger, BigInteger, BigInteger, long)
@@ -858,7 +858,7 @@
 
     /**
      * Performs modular exponentiation using the Montgomery Reduction. It
-     * requires that all parameters be postivive and the mudulus be even. Based
+     * requires that all parameters be positive and the modulus be even. Based
      * <i>The square and multiply algorithm and the Montgomery Reduction C. K.
      * Koc - Montgomery Reduction with Even Modulus</i>. The square and
      * multiply algorithm and the Montgomery Reduction.
@@ -891,7 +891,7 @@
     }
 
     /**
-     * It requires that all parameters be postivive.
+     * It requires that all parameters be positive.
      * 
      * @return {@code base<sup>exponent</sup> mod (2<sup>j</sup>)}.
      * @see BigInteger#modPow(BigInteger, BigInteger)
@@ -997,12 +997,12 @@
     
     /**
      * Implements the Montgomery Product of two integers represented by
-     * {@code int} arrays. The arrays are suposed in <i>little
+     * {@code int} arrays. The arrays are supposed in <i>little
      * endian</i> notation.
      * 
      * @param a The first factor of the product.
      * @param b The second factor of the product.
-     * @param modulus The modululus of the oprations. Z<sub>modulus</sub>.
+     * @param modulus The modulus of the operations. Z<sub>modulus</sub>.
      * @param n2 The digit modulus'[0].
      * @ar.org.fitc.ref "C. K. Koc - Analyzing and Comparing Montgomery
      *                  Multiplication Algorithms"