--- jsr166/src/jsr166x/ConcurrentSkipListSet.java	2010/09/01 20:12:39	1.9
+++ jsr166/src/jsr166x/ConcurrentSkipListSet.java	2012/10/21 06:14:11	1.14
@@ -1,7 +1,7 @@
 /*
  * Written by Doug Lea with assistance from members of JCP JSR-166
  * Expert Group and released to the public domain, as explained at
- * http://creativecommons.org/licenses/publicdomain
+ * http://creativecommons.org/publicdomain/zero/1.0/
  */
 
 package jsr166x;
@@ -253,7 +253,7 @@ public class ConcurrentSkipListSet<E>
         Collection c = (Collection) o;
         try {
             return containsAll(c) && c.containsAll(this);
-        } catch (ClassCastException unused)   {
+        } catch (ClassCastException unused) {
             return false;
         } catch (NullPointerException unused) {
             return false;
@@ -471,7 +471,6 @@ public class ConcurrentSkipListSet<E>
      * in {@link IllegalArgumentException}.  Instances of this class are
      * constructed only using the <tt>subSet</tt>, <tt>headSet</tt>, and
      * <tt>tailSet</tt> methods of their underlying sets.
-     *
      */
     static class ConcurrentSkipListSubSet<E>
         extends AbstractSet<E>
@@ -487,7 +486,7 @@ public class ConcurrentSkipListSet<E>
          * @param fromElement inclusive least value, or <tt>null</tt> if from start
          * @param toElement exclusive upper bound or <tt>null</tt> if to end
          * @throws IllegalArgumentException if fromElement and toElement
-         * nonnull and fromElement greater than toElement
+         * non-null and fromElement greater than toElement
          */
         ConcurrentSkipListSubSet(ConcurrentSkipListMap<E,Object> map,
                                  E fromElement, E toElement) {
@@ -541,11 +540,11 @@ public class ConcurrentSkipListSet<E>
         }
         public E pollFirst() {
             Map.Entry<E,?> e = s.pollFirstEntry();
-            return (e == null)? null : e.getKey();
+            return (e == null) ? null : e.getKey();
         }
         public E pollLast() {
             Map.Entry<E,?> e = s.pollLastEntry();
-            return (e == null)? null : e.getKey();
+            return (e == null) ? null : e.getKey();
         }
 
     }