Stack
class represents a last-in-first-out
(LIFO) stack of objects. It extends class Vector
with five
operations that allow a vector to be treated as a stack. The usual
push
and pop
operations are provided, as well as a
method to peek
at the top item on the stack, a method to test
for whether the stack is empty
, and a method to search
the stack for an item and discover how far it is from the top.
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. For example:
Deque<Integer> stack = new ArrayDeque<Integer>();
Modifier and Type | Field and Description |
---|---|
private static final long | serialVersionUID
use serialVersionUID from JDK 1.0.2 for interoperability
|
Access | Constructor and Description |
---|---|
public |
Modifier and Type | Method and Description |
---|---|
public boolean | Returns: true if and only if this stack contains
no items; false otherwise.Tests if this stack is empty. |
public synchronized E | Returns: the object at the top of this stack (the last item of theVector object).Looks at the object at the top of this stack without removing it from the stack. |
public synchronized E | Returns: The object at the top of this stack (the last item of theVector object).Removes the object at the top of this stack and returns that object as the value of this function. |
public E | Returns: theitem argument.the item to be pushed onto this stack. item)Pushes an item onto the top of this stack. |
public synchronized int |
serialVersionUID | back to summary |
---|---|
private static final long serialVersionUID Hides java. use serialVersionUID from JDK 1.0.2 for interoperability |
Stack | back to summary |
---|---|
public Stack() Creates an empty Stack. |
empty | back to summary |
---|---|
public boolean empty() Tests if this stack is empty.
|
peek | back to summary |
---|---|
public synchronized E peek() Looks at the object at the top of this stack without removing it from the stack.
|
pop | back to summary |
---|---|
public synchronized E pop() Removes the object at the top of this stack and returns that object as the value of this function.
|
push | back to summary |
---|---|
public E push(E item) Pushes an item onto the top of this stack. This has exactly the same effect as: addElement(item)
|
search | back to summary |
---|---|
public synchronized int search(Object o) Returns the 1-based position where an object is on this stack.
If the object
|