java.io.Serializable
, java.lang.Cloneable
, java.lang.Iterable<java.lang.Object>
, java.util.Collection<java.lang.Object>
, java.util.List<java.lang.Object>
, java.util.RandomAccess
public class ArrayStack
extends java.util.ArrayList<java.lang.Object>
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 pop()
method removes
them from the top down.
Unlike Stack
, ArrayStack
accepts null entries.
Note: this class should be bytecode-identical to the version in commons collections. This is required to allow backwards compatibility with both previous versions of BeanUtils and also allow coexistence with both collections 2.1 and 3.0.
Stack
,
Serialized FormConstructor | Description |
---|---|
ArrayStack() |
Constructs a new empty
ArrayStack . |
ArrayStack(int initialSize) |
Constructs a new empty
ArrayStack with an initial size. |
Modifier and Type | Method | Description |
---|---|---|
boolean |
empty() |
Return
true if this stack is currently empty. |
java.lang.Object |
peek() |
Returns the top item off of this stack without removing it.
|
java.lang.Object |
peek(int n) |
Returns the n'th item down (zero-relative) from the top of this
stack without removing it.
|
java.lang.Object |
pop() |
Pops the top item off of this stack and return it.
|
java.lang.Object |
push(java.lang.Object item) |
Pushes a new item onto the top of this stack.
|
int |
search(java.lang.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, forEach, get, indexOf, isEmpty, iterator, lastIndexOf, listIterator, listIterator, remove, remove, removeAll, removeIf, removeRange, replaceAll, retainAll, set, size, sort, spliterator, subList, toArray, toArray, trimToSize
public 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 usejava.lang.IllegalArgumentException
- 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 java.lang.Object peek() throws java.util.EmptyStackException
java.util.EmptyStackException
- if the stack is emptypublic java.lang.Object peek(int n) throws java.util.EmptyStackException
n
- the number of items down to gojava.util.EmptyStackException
- if there are not enough items on the
stack to satisfy this requestpublic java.lang.Object pop() throws java.util.EmptyStackException
java.util.EmptyStackException
- if the stack is emptypublic java.lang.Object push(java.lang.Object item)
add
.item
- the item to be addedpublic int search(java.lang.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 forCopyright © 2008–2018 The Aspectran Project. All rights reserved.