--- jsr166/src/jsr166x/ConcurrentSkipListMap.java	2013/02/18 03:15:10	1.31
+++ jsr166/src/jsr166x/ConcurrentSkipListMap.java	2015/09/03 22:54:46	1.35
@@ -212,7 +212,7 @@ public class ConcurrentSkipListMap<K,V>
      * highly contended cases.
      *
      * Unlike most skip-list implementations, index insertion and
-     * deletion here require a separate traversal pass occuring after
+     * deletion here require a separate traversal pass occurring after
      * the base-level action, to add or remove index nodes.  This adds
      * to single-threaded overhead, but improves contended
      * multithreaded performance by narrowing interference windows,
@@ -1270,7 +1270,7 @@ public class ConcurrentSkipListMap<K,V>
         }
     }
 
-   /**
+    /**
      * Removes first entry; return key or null if empty.
      */
     K pollFirstKey() {
@@ -1728,7 +1728,7 @@ public class ConcurrentSkipListMap<K,V>
          * distinct because readObject calls can't be nicely adapted
          * as the kind of iterator needed by buildFromSorted. (They
          * can be, but doing so requires type cheats and/or creation
-         * of adaptor classes.) It is simpler to just adapt the code.
+         * of adapter classes.) It is simpler to just adapt the code.
          */
 
         HeadIndex<K,V> h = head;
@@ -2842,7 +2842,7 @@ public class ConcurrentSkipListMap<K,V>
     }
 
     final class DescendingEntryIterator extends EntryIter
-        implements Iterator<Map.Entry<K,V>>  {
+        implements Iterator<Map.Entry<K,V>> {
         DescendingEntryIterator() {
             initDescending();
         }
@@ -2854,7 +2854,7 @@ public class ConcurrentSkipListMap<K,V>
     }
 
     final class DescendingSubMapEntryIterator extends EntryIter
-        implements Iterator<Map.Entry<K,V>>  {
+        implements Iterator<Map.Entry<K,V>> {
         final K least;
         DescendingSubMapEntryIterator(K least, K fence) {
             initDescending(least, fence);