public class ArrayStack extends ArrayList implements Buffer
Stack API that is based on an
ArrayList instead of a Vector, so it is not
synchronized to protect against multi-threaded access. The implementation
is therefore operates faster in environments where you do not need to
worry about multiple thread contention.
The removal order of an ArrayStack is based on insertion
order: The most recently added element is removed first. The iteration
order is not the same as the removal order. The iterator returns
elements from the bottom up, whereas the remove() method removes
them from the top down.
Unlike Stack, ArrayStack accepts null entries.
Stack,
Serialized FormmodCount| Constructor and Description |
|---|
ArrayStack()
Constructs a new empty
ArrayStack. |
ArrayStack(int initialSize)
Constructs a new empty
ArrayStack with an initial size. |
| Modifier and Type | Method and Description |
|---|---|
boolean |
empty()
Return
true if this stack is currently empty. |
Object |
get()
Returns the element on the top of the stack.
|
Object |
peek()
Returns the top item off of this stack without removing it.
|
Object |
peek(int n)
Returns the n'th item down (zero-relative) from the top of this
stack without removing it.
|
Object |
pop()
Pops the top item off of this stack and return it.
|
Object |
push(Object item)
Pushes a new item onto the top of this stack.
|
Object |
remove()
Removes the element on the top of the stack.
|
int |
search(Object object)
Returns the one-based position of the distance from the top that the
specified object exists on this stack, where the top-most element is
considered to be at distance
1. |
add, add, addAll, addAll, clear, clone, contains, ensureCapacity, get, indexOf, isEmpty, iterator, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, removeRange, retainAll, set, size, subList, toArray, toArray, trimToSizeequals, hashCodecontainsAll, toStringfinalize, getClass, notify, notifyAll, wait, wait, waitadd, addAll, clear, contains, containsAll, equals, hashCode, isEmpty, iterator, remove, removeAll, retainAll, size, toArray, toArraycontainsAll, equals, hashCodepublic ArrayStack()
ArrayStack. The initial size
is controlled by ArrayList and is currently 10.public ArrayStack(int initialSize)
ArrayStack with an initial size.initialSize - the initial size to useIllegalArgumentException - if the specified initial size
is negativepublic boolean empty()
true if this stack is currently empty.
This method exists for compatibility with java.util.Stack.
New users of this class should use isEmpty instead.
public Object peek() throws EmptyStackException
EmptyStackException - if the stack is emptypublic Object peek(int n) throws EmptyStackException
n - the number of items down to goEmptyStackException - if there are not enough items on the
stack to satisfy this requestpublic Object pop() throws EmptyStackException
EmptyStackException - if the stack is emptypublic Object push(Object item)
add.item - the item to be addedpublic int search(Object object)
1. If the object is not
present on the stack, return -1 instead. The
equals() method is used to compare to the items
in this stack.object - the object to be searched forpublic Object get()
get in interface BufferBufferUnderflowException - if the stack is emptypublic Object remove()
remove in interface BufferBufferUnderflowException - if the stack is emptyCopyright © 2001–2015 The Apache Software Foundation. All rights reserved.