| java.util.ArrayList
 org.apache.axis2.util.ArrayStack
| ArrayStack | | public class ArrayStack extends ArrayList (Code) | | An implementation of the
java.util.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
ArrayStack.remove() method removes
them from the top down.
Unlike Stack, ArrayStack accepts null entries.
|
| Constructor Summary | |
| public | ArrayStack()
Constructs a new empty ArrayStack. | | public | ArrayStack(int initialSize)
Constructs a new empty ArrayStack with an initial size. |
| Method Summary | |
| public boolean | empty()
Return true if this stack is currently empty.
This method exists for compatibility with java.util.Stack. | | public Object | get()
Returns the element on the top of the stack. | | public Object | peek()
Returns the top item off of this stack without removing it. | | public Object | peek(int n)
Returns the n'th item down (zero-relative) from the top of this stack without removing it. | | public Object | pop()
Pops the top item off of this stack and return it. | | public Object | push(Object item)
Pushes a new item onto the top of this stack. | | public Object | remove()
Removes the element on the top of the stack. | | public 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. |
| ArrayStack | | public ArrayStack()(Code) | | Constructs a new empty ArrayStack. The initial size is controlled by
ArrayList and is currently 10.
|
| ArrayStack | | public ArrayStack(int initialSize)(Code) | | Constructs a new empty ArrayStack with an initial size.
Parameters:
initialSize - the initial size to use
throws:
IllegalArgumentException - if the specified initial size is negative |
| empty | | public boolean empty()(Code) | | Return 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.
true if the stack is currently empty |
| get | | public Object get()(Code) | | Returns the element on the top of the stack.
the element on the top of the stack
throws:
EmptyStackException - if the stack is empty |
| peek | | public Object peek(int n) throws EmptyStackException(Code) | | Returns the n'th item down (zero-relative) from the top of this stack without removing it.
Parameters:
n - the number of items down to go the n'th item on the stack, zero relative
throws:
EmptyStackException - if there are not enough items on the stack to satisfy thisrequest |
| push | | public Object push(Object item)(Code) | | Pushes a new item onto the top of this stack. The pushed item is also returned. This is
equivalent to calling add.
Parameters:
item - the item to be added the item just pushed |
| search | | public int search(Object object)(Code) | | 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. 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.
Parameters:
object - the object to be searched for the 1-based depth into the stack of the object, or -1 if not found |
|
|