--- jsr166/src/main/java/util/Queue.java 2006/05/28 23:36:29 1.35 +++ jsr166/src/main/java/util/Queue.java 2012/11/18 19:33:08 1.37 @@ -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 java.util; @@ -50,7 +50,7 @@ package java.util; * Whatever the ordering used, the head of the queue is that * element which would be removed by a call to {@link #remove() } or * {@link #poll()}. In a FIFO queue, all new elements are inserted at - * the tail of the queue. Other kinds of queues may use + * the tail of the queue. Other kinds of queues may use * different placement rules. Every Queue implementation * must specify its ordering properties. *