--- jsr166/src/main/java/util/Deque.java 2005/05/02 04:19:58 1.6 +++ jsr166/src/main/java/util/Deque.java 2011/03/15 19:47:02 1.20 @@ -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 java.util; @@ -27,7 +27,8 @@ package java.util; *
The twelve methods described above are summarized in the * following table: * - *
* | First Element (Head) | @@ -36,9 +37,9 @@ package java.util; *|||||||||||||||||||||
* | Throws exception | - *Returns special value | + *Special value | *Throws exception | - *Returns special value | + *Special value | *||||||||||||||||
Insert | @@ -69,35 +70,36 @@ package java.util; * inherited from the Queue interface are precisely equivalent to * Deque methods as indicated in the following table: * - *
Queue Method | *Equivalent Deque Method | *||
{@link java.util.Queue#offer offer(e)} | - *{@link #offerLast offerLast(e)} | - *||
{@link java.util.Queue#add add(e)} | *{@link #addLast addLast(e)} | *||
{@link java.util.Queue#poll poll()} | - *{@link #pollFirst pollFirst()} | + *{@link java.util.Queue#offer offer(e)} | + *{@link #offerLast offerLast(e)} | *
{@link java.util.Queue#remove remove()} | *{@link #removeFirst removeFirst()} | *||
{@link java.util.Queue#peek peek()} | - *{@link #peek peekFirst()} | + *{@link java.util.Queue#poll poll()} | + *{@link #pollFirst pollFirst()} | *
{@link java.util.Queue#element element()} | *{@link #getFirst getFirst()} | *||
{@link java.util.Queue#peek peek()} | + *{@link #peek peekFirst()} | + *
Deques can also be used as LIFO (Last-In-First-Out) stacks. This @@ -106,7 +108,8 @@ package java.util; * beginning of the deque. Stack methods are precisely equivalent to * Deque methods as indicated in the table below: * - *
Stack Method | *Equivalent Deque Method | @@ -131,9 +134,10 @@ package java.util; * *