--- jsr166/src/jsr166e/ConcurrentHashMapV8.java	2013/06/19 14:55:40	1.102
+++ jsr166/src/jsr166e/ConcurrentHashMapV8.java	2013/06/19 17:11:57	1.106
@@ -228,7 +228,7 @@ public class ConcurrentHashMapV8<K,V>
      * java.util.Spliterator.
      */
     public static interface ConcurrentHashMapSpliterator<T> {
-        /** 
+        /**
          * If possible, returns a new spliterator covering
          * approximately one half of the elements, which will not be
          * covered by this spliterator. Returns null if cannot be
@@ -735,11 +735,11 @@ public class ConcurrentHashMapV8<K,V>
                                         Node<K,V> c, Node<K,V> v) {
         return U.compareAndSwapObject(tab, ((long)i << ASHIFT) + ABASE, c, v);
     }
-    
+
     static final <K,V> void setTabAt(Node<K,V>[] tab, int i, Node<K,V> v) {
         U.putOrderedObject(tab, ((long)i << ASHIFT) + ABASE, v);
     }
-    
+
     /* ---------------- Fields -------------- */
 
     /**
@@ -2422,10 +2422,10 @@ public class ConcurrentHashMapV8<K,V>
                                     ++hc;
                                 }
                             }
-                            ln = (lc <= UNTREEIFY_THRESHOLD ?  untreeify(lo) :
-                                  (hc != 0) ? new TreeBin<K,V>(lo) : t);
-                            hn = (hc <= UNTREEIFY_THRESHOLD ? untreeify(hi) :
-                                  (lc != 0) ? new TreeBin<K,V>(hi) : t);
+                            ln = (lc <= UNTREEIFY_THRESHOLD) ? untreeify(lo) :
+                                (hc != 0) ? new TreeBin<K,V>(lo) : t;
+                            hn = (hc <= UNTREEIFY_THRESHOLD) ? untreeify(hi) :
+                                (lc != 0) ? new TreeBin<K,V>(hi) : t;
                         }
                         else
                             ln = hn = null;
@@ -2475,7 +2475,7 @@ public class ConcurrentHashMapV8<K,V>
     }
 
     /**
-     * Returns a list on non-TreeNodes replacing those in given list
+     * Returns a list on non-TreeNodes replacing those in given list.
      */
     static <K,V> Node<K,V> untreeify(Node<K,V> b) {
         Node<K,V> hd = null, tl = null;
@@ -2530,13 +2530,13 @@ public class ConcurrentHashMapV8<K,V>
                         return p;
                     else if (pl == null && pr == null)
                         break;
-                    else if ((kc != null || 
+                    else if ((kc != null ||
                               (kc = comparableClassFor(k)) != null) &&
                              (dir = compareComparables(kc, k, pk)) != 0)
                         p = (dir < 0) ? pl : pr;
                     else if (pl == null)
                         p = pr;
-                    else if (pr == null || 
+                    else if (pr == null ||
                              (q = pr.findTreeNode(h, k, kc)) == null)
                         p = pl;
                     else
@@ -2613,7 +2613,7 @@ public class ConcurrentHashMapV8<K,V>
         }
 
         /**
-         * Acquires write lock for tree restructuring
+         * Acquires write lock for tree restructuring.
          */
         private final void lockRoot() {
             if (!U.compareAndSwapInt(this, LOCKSTATE, 0, WRITER))
@@ -2621,14 +2621,14 @@ public class ConcurrentHashMapV8<K,V>
         }
 
         /**
-         * Releases write lock for tree restructuring
+         * Releases write lock for tree restructuring.
          */
         private final void unlockRoot() {
             lockState = 0;
         }
 
         /**
-         * Possibly blocks awaiting root lock
+         * Possibly blocks awaiting root lock.
          */
         private final void contendedLock() {
             boolean waiting = false;
@@ -2751,7 +2751,7 @@ public class ConcurrentHashMapV8<K,V>
          * that are accessible independently of lock. So instead we
          * swap the tree linkages.
          *
-         * @return true if now too small so should be untreeified.
+         * @return true if now too small, so should be untreeified
          */
         final boolean removeTreeNode(TreeNode<K,V> p) {
             TreeNode<K,V> next = (TreeNode<K,V>)p.next;
@@ -3034,6 +3034,7 @@ public class ConcurrentHashMapV8<K,V>
                 }
             }
         }
+
         /**
          * Recursive invariant check
          */
@@ -3145,7 +3146,7 @@ public class ConcurrentHashMapV8<K,V>
 
     /**
      * Base of key, value, and entry Iterators. Adds fields to
-     * Traverser to support iterator.remove
+     * Traverser to support iterator.remove.
      */
     static class BaseIterator<K,V> extends Traverser<K,V> {
         final ConcurrentHashMapV8<K,V> map;
@@ -5985,7 +5986,7 @@ public class ConcurrentHashMapV8<K,V>
     }
 
     /**
-     * Generates initial value for per-thread CounterHashCodes
+     * Generates initial value for per-thread CounterHashCodes.
      */
     static final AtomicInteger counterHashCodeGenerator = new AtomicInteger();