|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
java.lang.Objectjava.util.AbstractCollection<E>
java.util.AbstractList<E>
java.util.ArrayList<T>
org.apache.tuscany.sca.databinding.xml.XmlNodeIterator.FastStack<T>
public static class XmlNodeIterator.FastStack<T>
An implementation of the 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.
Field Summary |
---|
Fields inherited from class java.util.AbstractList |
---|
modCount |
Constructor Summary | |
---|---|
XmlNodeIterator.FastStack()
Constructs a new empty ArrayStack . |
|
XmlNodeIterator.FastStack(int initialSize)
Constructs a new empty ArrayStack with an initial size. |
Method Summary | |
---|---|
boolean |
empty()
Return true if this stack is currently empty. |
T |
get()
Returns the element on the top of the stack. |
T |
peek()
Returns the top item off of this stack without removing it. |
T |
peek(int n)
Returns the n'th item down (zero-relative) from the top of this stack without removing it. |
T |
pop()
Pops the top item off of this stack and return it. |
java.lang.Object |
push(T item)
Pushes a new item onto the top of this stack. |
T |
remove()
Removes the element on the top of the stack. |
int |
search(T object)
Returns the top-most index for the object in the stack |
Methods inherited from class java.util.ArrayList |
---|
add, add, addAll, addAll, clear, clone, contains, ensureCapacity, get, indexOf, isEmpty, lastIndexOf, remove, remove, removeRange, set, size, toArray, toArray, trimToSize |
Methods inherited from class java.util.AbstractList |
---|
equals, hashCode, iterator, listIterator, listIterator, subList |
Methods inherited from class java.util.AbstractCollection |
---|
containsAll, removeAll, retainAll, toString |
Methods inherited from class java.lang.Object |
---|
finalize, getClass, notify, notifyAll, wait, wait, wait |
Methods inherited from interface java.util.List |
---|
containsAll, equals, hashCode, iterator, listIterator, listIterator, removeAll, retainAll, subList |
Constructor Detail |
---|
public XmlNodeIterator.FastStack()
ArrayStack
. The initial size is controlled by ArrayList
and is currently 10.
public XmlNodeIterator.FastStack(int initialSize)
ArrayStack
with an initial size.
initialSize
- the initial size to use
java.lang.IllegalArgumentException
- if the specified initial size is negativeMethod Detail |
---|
public 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 T peek() throws java.util.EmptyStackException
java.util.EmptyStackException
- if the stack is emptypublic T peek(int n) throws java.util.EmptyStackException
n
- the number of items down to go
java.util.EmptyStackException
- if there are not enough items on the stack to satisfy this requestpublic T pop() throws java.util.EmptyStackException
java.util.EmptyStackException
- if the stack is emptypublic java.lang.Object push(T item)
add
.
item
- the item to be added
public int search(T object)
object
- the object to be searched for
public T get()
java.util.EmptyStackException
- if the stack is emptypublic T remove()
java.util.EmptyStackException
- if the stack is empty
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |