从Collections.asLifoQueue（Deque）返回的队列与堆栈（Java 6）之间的区别

Question

As part of java 6 a asLifoQueue(Deque) static method is added in Collections utility class.

Javadoc says

public static <T> Queue<T> asLifoQueue(Deque<T> deque)

Returns a view of a Deque as a Last-in-first-out (Lifo) Queue. Method add is mapped to push, remove is mapped to pop and so on. This view can be useful when you would like to use a method requiring a Queue but you need Lifo ordering.

Each method invocation on the queue returned by this method results in exactly one method invocation on the backing deque, with one exception. The addAll method is implemented as a sequence of addFirst invocations on the backing deque.

Now what is the difference between this and stack. Isn't this essentially a stack?

Answer 1

堆栈是lifo集合，但（i）它已过时（javadoc建议使用Deque），并且（ii）它不实现Queue接口。

Answer 2

This view can be useful when you would like to use a method requiring a Queue but you need Lifo ordering.

The method just wrap the deque argument, so the you can work on an Queue implementations. As you say, the queue is just a stack, but the javadoc of the Stack class say:

A more complete and consistent set of LIFO stack operations is provided by the Deque interface and its implementations, which should be used in preference to this class. For example:

  Deque<Integer> stack = new ArrayDeque<Integer>(); 

Deque is just more complete than Stack and the method asLifoQueue is just an utility to convert a deque to a stack-like data structure.

Answer 3

From Javadoc:

When a stack is first created, it contains no items.

A more complete and consistent set of LIFO stack operations is provided by the Deque interface and its implementations, which should be used in preference to this class.

So it's the same behavior but Deque has more methods to play with