--- jsr166/src/extra166y/CustomConcurrentHashMap.java	2011/03/15 19:47:02	1.17
+++ jsr166/src/extra166y/CustomConcurrentHashMap.java	2012/12/30 02:05:53	1.24
@@ -320,7 +320,7 @@ public class CustomConcurrentHashMap<K,
          * Returns the value established during the creation of this
          * node or, if since updated, the value set by the most
          * recent call to setValue, or throws an exception if
-         * value could not be computed
+         * value could not be computed.
          * @return the value
          * @throws RuntimeException or Error if computeValue failed
          */
@@ -544,7 +544,7 @@ public class CustomConcurrentHashMap<K,
     }
 
     /**
-     * Creates a new CustomConcurrentHashMap with the given parameters
+     * Creates a new CustomConcurrentHashMap with the given parameters.
      * @param keyStrength the strength for keys
      * @param keyEquivalence the Equivalence to use for keys
      * @param valueStrength the strength for values
@@ -573,7 +573,7 @@ public class CustomConcurrentHashMap<K,
 
     /**
      * Returns a new map using Integer keys and the given value
-     * parameters
+     * parameters.
      * @param valueStrength the strength for values
      * @param valueEquivalence the Equivalence to use for values
      * @param expectedSize an estimate of the number of elements
@@ -591,7 +591,7 @@ public class CustomConcurrentHashMap<K,
     }
 
     /**
-     * Returns a new map using the given key parameters and Integer values
+     * Returns a new map using the given key parameters and Integer values.
      * @param keyStrength the strength for keys
      * @param keyEquivalence the Equivalence to use for keys
      * @param expectedSize an estimate of the number of elements
@@ -609,7 +609,7 @@ public class CustomConcurrentHashMap<K,
     }
 
     /**
-     * Returns a new map using Integer keys and values
+     * Returns a new map using Integer keys and values.
      * @param expectedSize an estimate of the number of elements
      * that will be held in the map. If no estimate is known,
      * zero is an acceptable value.
@@ -623,7 +623,7 @@ public class CustomConcurrentHashMap<K,
     }
 
     /**
-     * Returns the segment for traversing table for key with given hash
+     * Returns the segment for traversing table for key with given hash.
      * @param hash the hash code for the key
      * @return the segment, or null if not yet initialized
      */
@@ -656,7 +656,7 @@ public class CustomConcurrentHashMap<K,
     }
 
     /**
-     * Returns node for key, or null if none
+     * Returns node for key, or null if none.
      */
     final Node findNode(Object key, int hash, Segment seg) {
         if (seg != null) {
@@ -697,7 +697,7 @@ public class CustomConcurrentHashMap<K,
     /**
      * Returns the value associated with a key equivalent to the given
      * key with respect to this map's key Equivalence, or {@code null}
-     * if no such mapping exists
+     * if no such mapping exists.
      *
      * @param  key   possible key
      * @return the value associated with the key or <tt>null</tt> if
@@ -942,7 +942,7 @@ public class CustomConcurrentHashMap<K,
     }
 
     /**
-     * Remove node if its key or value are null
+     * Removes node if its key or value are null.
      */
     final void removeIfReclaimed(Node r) {
         int hash = r.getLocator();
@@ -1551,8 +1551,8 @@ public class CustomConcurrentHashMap<K,
     }
 
     /**
-     * Save the state of the instance to a stream (i.e., serialize
-     * it).
+     * Saves the state of the instance to a stream (i.e., serializes it).
+     *
      * @param s the stream
      * @serialData
      * the key (Object) and value (Object)
@@ -1570,7 +1570,7 @@ public class CustomConcurrentHashMap<K,
     }
 
     /**
-     * Reconstitute the instance from a stream (i.e., deserialize it).
+     * Reconstitutes the instance from a stream (that is, deserializes it).
      * @param s the stream
      */
     private void readObject(java.io.ObjectInputStream s)
@@ -1600,7 +1600,7 @@ public class CustomConcurrentHashMap<K,
         final CustomConcurrentHashMap<K,K> cchm;
 
         /**
-         * Creates a set with the given parameters
+         * Creates a set with the given parameters.
          * @param strength the strength of elements
          * @param equivalence the Equivalence to use
          * @param expectedSize an estimate of the number of elements
@@ -1621,7 +1621,7 @@ public class CustomConcurrentHashMap<K,
          * exists, else adds and returns the given element.
          *
          * @param e the element
-         * @return e, or an element equivalent to e.
+         * @return e, or an element equivalent to e
          */
         public K intern(K e) {
             K oldElement = cchm.doPut(e, e, true);
@@ -3045,14 +3045,14 @@ public class CustomConcurrentHashMap<K,
     }
 
     // Fenced store into segment table array. Unneeded when we have Fences
-    static final  void storeNode(Node[] table,
-                                 int i, Node r) {
+    static final void storeNode(Node[] table,
+                                int i, Node r) {
         long nodeOffset = ((long) i << tableShift) + tableBase;
         UNSAFE.putOrderedObject(table, nodeOffset, r);
     }
 
-    static final  void storeSegment(Segment[] segs,
-                                    int i, Segment s) {
+    static final void storeSegment(Segment[] segs,
+                                   int i, Segment s) {
         long segmentOffset = ((long) i << segmentsShift) + segmentsBase;
         UNSAFE.putOrderedObject(segs, segmentOffset, s);
     }