Replace the legacy Stack with what from Java Collections?

Question

This is kind of a Java trivia question perhaps.

I have used the Stack implementation many times.

I have read that this is considered a legacy class and due to the fact that it subclasses Vector makes its performance bad in single threaded applications.

My question is, what is the best alternative among the Java Collection classes?

Is there another Stack class available (by a different name perhaps) that is the one to choose?

I mean, ok implementing a stack arround another existing data structure is easy, but I would expect there is an existing Stack to use.

Answer 1

If you read a more current Javadoc (1.6 or 1.7 for example) rather than the old 1.4.2 docs, you'll find:

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

http://docs.oracle.com/javase/6/docs/api/java/util/Stack.html http://docs.oracle.com/javase/7/docs/api/java/util/Stack.html

Answer 2

In Java7, you can use

http://docs.oracle.com/javase/7/docs/api/java/util/Collections.html#asLifoQueue(java.util.Deque)

to get a Stack-like object. add() works like push() and remove() works like pop(), etc. I'm answering here long after the question was asked because this seems to be the new 'right' answer for this.

Answer 3

LinkedList implements push and pop methods. See also other Deque implementations.

Commons Collections implements an ArrayStack class.

Answer 4

您可以使用Deque在同一端添加和删除内容。

Answer 5

您可以使用LinkedList来实现Deque接口，并允许推送和弹出。

Answer 6

From the Stack javadoc:

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.

Deque stack = new ArrayDeque ();