Package com.adobe.internal.util
Class ArrayListStack<T>
- java.lang.Object
-
- com.adobe.internal.util.ArrayListStack<T>
-
- All Implemented Interfaces:
Stack<T>
,Serializable
,Iterable<T>
,Collection<T>
,List<T>
public class ArrayListStack<T> extends Object implements Stack<T>, List<T>, Serializable
- See Also:
- Serialized Form
-
-
Constructor Summary
Constructors Constructor Description ArrayListStack()
Constructs an empty stack.ArrayListStack(int size)
Constructs an empty stack of the size given.ArrayListStack(ArrayList<T> list)
Constructs the stack from the ArrayList provided.
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description void
add(int index, T element)
boolean
add(T element)
boolean
addAll(int index, Collection<? extends T> collection)
boolean
addAll(Collection<? extends T> collection)
void
clear()
boolean
contains(Object o)
boolean
containsAll(Collection<?> collection)
boolean
empty()
Tests if stack is empty.boolean
equals(Object obj)
Compares the specified object with this list for equality.T
get(int index)
ArrayList<T>
getArrayList()
returns the underlying ArrayListint
hashCode()
Returns the hash code value for this list.int
indexOf(Object o)
boolean
isEmpty()
Iterator<T>
iterator()
int
lastIndexOf(Object o)
ListIterator<T>
listIterator()
ListIterator<T>
listIterator(int index)
T
peek()
Returns item from the top of the stack.T
pop()
Removes and returns item from the top of the stack.T
push(T elem)
Adds an item to the top of the stack.T
remove(int index)
boolean
remove(Object o)
boolean
removeAll(Collection<?> collection)
boolean
retainAll(Collection<?> collection)
int
search(T o)
Returns the 1-based position where an object is on this stack.T
set(int index, T element)
int
size()
Returns the size of the stack.List<T>
subList(int fromIndex, int toIndex)
Object[]
toArray()
Object[]
toArray(Object[] a)
String
toString()
-
Methods inherited from interface java.util.Collection
parallelStream, removeIf, stream, toArray
-
Methods inherited from interface java.util.List
replaceAll, sort, spliterator
-
-
-
-
Method Detail
-
pop
public T pop() throws EmptyStackException
Removes and returns item from the top of the stack.- Specified by:
pop
in interfaceStack<T>
- Returns:
- the former top item.
- Throws:
EmptyStackException
- if stack is empty.
-
peek
public T peek() throws EmptyStackException
Returns item from the top of the stack.- Specified by:
peek
in interfaceStack<T>
- Returns:
- the top item.
- Throws:
EmptyStackException
- if stack is empty.
-
empty
public boolean empty()
Tests if stack is empty.
-
size
public int size()
Returns the size of the stack.
-
clear
public void clear()
-
equals
public boolean equals(Object obj)
Compares the specified object with this list for equality. Returns true if and only if the specified object is also a list, both lists have the same size, and all corresponding pairs of elements in the two lists are equal. (Two elements e1 and e2 are equal if (e1==null ? e2==null : e1.equals(e2)).) In other words, two lists are defined to be equal if they contain the same elements in the same order.This implementation first checks if the specified object is this list. If so, it returns true; if not, it checks if the specified object is a list. If not, it returns false; if so, it iterates over both lists, comparing corresponding pairs of elements. If any comparison returns false, this method returns false. If either iterator runs out of elements before the other it returns false (as the lists are of unequal length); otherwise it returns true when the iterations complete.
-
hashCode
public int hashCode()
Returns the hash code value for this list.This implementation uses exactly the code that is used to define the list hash function in the documentation for the List.hashCode method.
-
search
public int search(T o)
Returns the 1-based position where an object is on this stack. If the object 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.- Parameters:
o
- the desired object.- Returns:
- the 1-based position from the top of the stack where
the object is located; the return value
-1
indicates that the object is not on the stack.
-
add
public boolean add(T element)
-
addAll
public boolean addAll(Collection<? extends T> collection)
-
addAll
public boolean addAll(int index, Collection<? extends T> collection)
-
contains
public boolean contains(Object o)
-
containsAll
public boolean containsAll(Collection<?> collection)
- Specified by:
containsAll
in interfaceCollection<T>
- Specified by:
containsAll
in interfaceList<T>
-
isEmpty
public boolean isEmpty()
-
lastIndexOf
public int lastIndexOf(Object o)
- Specified by:
lastIndexOf
in interfaceList<T>
-
listIterator
public ListIterator<T> listIterator()
- Specified by:
listIterator
in interfaceList<T>
-
listIterator
public ListIterator<T> listIterator(int index)
- Specified by:
listIterator
in interfaceList<T>
-
remove
public boolean remove(Object o)
-
removeAll
public boolean removeAll(Collection<?> collection)
-
retainAll
public boolean retainAll(Collection<?> collection)
-
toArray
public Object[] toArray()
-
-