Serializable
, Cloneable
, Iterable<E>
, Collection<E>
, List<E>
, RandomAccess
public class Stack<E> extends Vector<E>
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>();
modCount
capacityIncrement, elementCount, elementData
Constructor | Description |
---|---|
Stack() |
Creates an empty Stack.
|
Modifier and Type | Method | Description |
---|---|---|
boolean |
empty() |
Tests if this stack is empty.
|
E |
peek() |
Looks at the object at the top of this stack without removing it
from the stack.
|
E |
pop() |
Removes the object at the top of this stack and returns that
object as the value of this function.
|
E |
push(E item) |
Pushes an item onto the top of this stack.
|
int |
search(Object o) |
Returns the 1-based position where an object is on this stack.
|
parallelStream, stream
finalize, getClass, notify, notifyAll, wait, wait, wait
add, add, addAll, addAll, addElement, capacity, clear, clone, contains, containsAll, copyInto, elementAt, elements, ensureCapacity, equals, firstElement, forEach, get, hashCode, indexOf, indexOf, insertElementAt, isEmpty, iterator, lastElement, lastIndexOf, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, removeAllElements, removeElement, removeElementAt, removeIf, removeRange, replaceAll, retainAll, set, setElementAt, setSize, size, sort, spliterator, subList, toArray, toArray, toString, trimToSize
public E push(E item)
addElement(item)
item
- the item to be pushed onto this stack.item
argument.Vector.addElement(E)
public E pop()
Vector
object).EmptyStackException
- if this stack is empty.public E peek()
Vector
object).EmptyStackException
- if this stack is empty.public boolean empty()
true
if and only if this stack contains
no items; false
otherwise.public int search(Object o)
o
occurs as an item in this stack, this
method returns the distance from the top of the stack of the
occurrence nearest the top of the stack; the topmost item on the
stack is considered to be at distance 1
. The equals
method is used to compare o
to the
items in this stack.o
- the desired object.-1
indicates that the object is not on the stack. Submit a bug or feature
For further API reference and developer documentation, see Java SE Documentation. That documentation contains more detailed, developer-targeted descriptions, with conceptual overviews, definitions of terms, workarounds, and working code examples.
Copyright © 1993, 2017, Oracle and/or its affiliates. 500 Oracle Parkway
Redwood Shores, CA 94065 USA. All rights reserved.
DRAFT 9-internal+0-adhoc.mlchung.jdk9-jdeps