--- jsr166/src/jsr166e/ConcurrentHashMapV8.java	2012/07/06 21:39:18	1.48
+++ jsr166/src/jsr166e/ConcurrentHashMapV8.java	2012/07/18 01:30:54	1.51
@@ -648,7 +648,7 @@ public class ConcurrentHashMapV8<K, V>
      * TreeBins also maintain a separate locking discipline than
      * regular bins. Because they are forwarded via special MOVED
      * nodes at bin heads (which can never change once established),
-     * we cannot use use those nodes as locks. Instead, TreeBin
+     * we cannot use those nodes as locks. Instead, TreeBin
      * extends AbstractQueuedSynchronizer to support a simple form of
      * read-write lock. For update operations and table validation,
      * the exclusive form of lock behaves in the same way as bin-head
@@ -2330,8 +2330,8 @@ public class ConcurrentHashMapV8<K, V>
         if (initialCapacity < concurrencyLevel)   // Use at least as many bins
             initialCapacity = concurrencyLevel;   // as estimated threads
         long size = (long)(1.0 + (long)initialCapacity / loadFactor);
-        int cap = ((size >= (long)MAXIMUM_CAPACITY) ?
-                   MAXIMUM_CAPACITY: tableSizeFor((int)size));
+        int cap = (size >= (long)MAXIMUM_CAPACITY) ?
+            MAXIMUM_CAPACITY : tableSizeFor((int)size);
         this.counter = new LongAdder();
         this.sizeCtl = cap;
     }
@@ -2940,8 +2940,8 @@ public class ConcurrentHashMapV8<K, V>
 
         /**
          * Sets our entry's value and writes through to the map. The
-         * value to return is somewhat arbitrary here. Since a we do
-         * not necessarily track asynchronous changes, the most recent
+         * value to return is somewhat arbitrary here. Since we do not
+         * necessarily track asynchronous changes, the most recent
          * "previous" value could be different from what we return (or
          * could even have been removed in which case the put will
          * re-establish). We do not and cannot guarantee more.