Revert "Formatting"

This reverts commit 32150d3ee32f8ac27118af7c792794b538c78a2f.

1 files changed, 27 insertions, 25 deletions

diff --git a/pki/base/util/src/netscape/security/util/ByteArrayLexOrder.java b/pki/base/util/src/netscape/security/util/ByteArrayLexOrder.java
index 9621deee0..60aede101 100644
--- a/pki/base/util/src/netscape/security/util/ByteArrayLexOrder.java
+++ b/pki/base/util/src/netscape/security/util/ByteArrayLexOrder.java
@@ -21,41 +21,43 @@ import java.util.Comparator;
 
 /**
  * Compare two byte arrays in lexicographical order.
- * 
+ *
  * @version 1.4 97/12/10
  * @author D. N. Hoover
  */
 public class ByteArrayLexOrder implements Comparator {
 
     /**
-     * Perform lexicographical comparison of two byte arrays, regarding each
-     * byte as unsigned. That is, compare array entries in order until they
-     * differ--the array with the smaller entry is "smaller". If array entries
-     * are equal till one array ends, then the longer array is "bigger".
-     * 
-     * @param obj1 first byte array to compare.
-     * @param obj2 second byte array to compare.
-     * @return negative number if obj1 < obj2, 0 if obj1 == obj2, positive
-     *         number if obj1 > obj2.
-     * 
-     * @exception <code>ClassCastException</code> if either argument is not a
-     *            byte array.
+     * Perform lexicographical comparison of two byte arrays,
+     * regarding each byte as unsigned.  That is, compare array entries 
+     * in order until they differ--the array with the smaller entry 
+     * is "smaller". If array entries are 
+     * equal till one array ends, then the longer array is "bigger".
+     *
+     * @param  obj1 first byte array to compare.
+     * @param  obj2 second byte array to compare.
+     * @return negative number if obj1 < obj2, 0 if obj1 == obj2, 
+     * positive number if obj1 > obj2.  
+     *
+     * @exception <code>ClassCastException</code> 
+     * if either argument is not a byte array.
      */
     public final int compare(Object obj1, Object obj2) {
 
-        byte[] bytes1 = (byte[]) obj1;
-        byte[] bytes2 = (byte[]) obj2;
+	byte[] bytes1 = (byte[]) obj1;
+	byte[] bytes2 = (byte[]) obj2;
 
-        int diff;
-        for (int i = 0; i < bytes1.length && i < bytes2.length; i++) {
-            diff = (bytes1[i] & 0xFF) - (bytes2[i] & 0xFF);
-            if (diff != 0) {
-                return diff;
-            }
-        }
-        // if array entries are equal till the first ends, then the
-        // longer is "bigger"
-        return bytes1.length - bytes2.length;
+	int diff;
+	for (int i = 0; i < bytes1.length && i < bytes2.length; i++) {
+	    diff = (bytes1[i] & 0xFF) - (bytes2[i] & 0xFF);
+	    if (diff != 0) {
+		return diff;
+	    }
+	}
+	// if array entries are equal till the first ends, then the
+	// longer is "bigger"
+	return bytes1.length - bytes2.length;
     }
+	
 
 }