--- jsr166/src/jsr166x/ArrayDeque.java	2009/11/24 03:57:04	1.4
+++ jsr166/src/jsr166x/ArrayDeque.java	2011/03/15 19:47:02	1.8
@@ -1,6 +1,6 @@
 /*
  * Written by Josh Bloch of Google Inc. and released to the public domain,
- * as explained at http://creativecommons.org/licenses/publicdomain.
+ * as explained at http://creativecommons.org/publicdomain/zero/1.0/.
  */
 
 package jsr166x;    // XXX This belongs in java.util!!! XXX
@@ -13,7 +13,7 @@ import java.io.*;
  * usage.  They are not thread-safe; in the absence of external
  * synchronization, they do not support concurrent access by multiple threads.
  * Null elements are prohibited.  This class is likely to be faster than
- * {@link Stack} when used as as a stack, and faster than {@link LinkedList}
+ * {@link Stack} when used as a stack, and faster than {@link LinkedList}
  * when used as a queue.
  *
  * <p>Most <tt>ArrayDeque</tt> operations run in amortized constant time.
@@ -504,7 +504,7 @@ public class ArrayDeque<E> extends Abstr
 
     /**
      * Pops an element from the stack represented by this deque.  In other
-     * words, removes and returns the the first element of this deque.
+     * words, removes and returns the first element of this deque.
      *
      * <p>This method is equivalent to {@link #removeFirst()}.
      *
@@ -667,7 +667,7 @@ public class ArrayDeque<E> extends Abstr
             do {
                 elements[i] = null;
                 i = (i + 1) & mask;
-            } while(i != t);
+            } while (i != t);
         }
     }