--- jsr166/src/jsr166x/Deque.java 2010/09/01 05:20:40 1.7 +++ jsr166/src/jsr166x/Deque.java 2013/02/05 17:31:01 1.12 @@ -1,7 +1,7 @@ /* * Written by Doug Lea and Josh Bloch with assistance from members of * JCP JSR-166 Expert Group and released to the public domain, as explained - * at http://creativecommons.org/licenses/publicdomain + * at http://creativecommons.org/publicdomain/zero/1.0/ */ package jsr166x; // XXX This belongs in java.util!!! XXX @@ -10,7 +10,7 @@ import java.util.*; // XXX This impor /** * A linear collection that supports element insertion and removal at * both ends. The name deque is short for "double ended queue" - * and is usually pronounced "deck". Most Deque + * and is usually pronounced "deck". Most {@code Deque} * implementations place no fixed limits on the number of elements * they may contain, but this interface supports capacity-restricted * deques as well as those with no fixed size limit. @@ -19,14 +19,14 @@ import java.util.*; // XXX This impor * ends of the deque. Methods are provided to insert, remove, and * examine the element. Each of these methods exists in two forms: * one throws an exception if the operation fails, the other returns a - * special value (either null or false, depending on + * special value (either {@code null} or {@code false}, depending on * the operation). The latter form of the insert operation is * designed specifically for use with capacity-restricted - * Deque implementations; in most implementations, insert + * {@code Deque} implementations; in most implementations, insert * operations cannot fail. * - *
The twelve methods described above are are summarized in the - * follwoing table:
+ *
The twelve methods described above are summarized in the + * following table:
* *
Queue Method | - *Equivalent Deque Method | + *{@code Queue} Method | + *Equivalent {@code Deque} Method | *
Stack Method | - *Equivalent Deque Method | + *Equivalent {@code Deque} Method | *