public ArrayStack() 
{
        super();
}

Constructs a new empty ArrayStack. The initial size is controlled by ArrayList and is currently 10.

 public ArrayStack(int initialSize) 
{
        super(initialSize);
}

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

 public boolean empty() 
{
        return isEmpty();
}

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.

 public T peek() 
{
        int n = size();
        if (n < = 0) {
            throw new EmptyStackException();
        } else {
            return get(n - 1);
        }
}

Returns the top item off of this stack without removing it.

 public T peek(int n) 
{
        int m = (size() - n) - 1;
        if (m <  0) {
            throw new EmptyStackException();
        } else {
            return get(m);
        }
}

Returns the n'th item down (zero-relative) from the top of this stack without removing it.

 public T pop() 
{
        int n = size();
        if (n < = 0) {
            throw new EmptyStackException();
        } else {
            return remove(n - 1);
        }
}

Pops the top item off of this stack and return it.

 public T push(T item) 
{
        add(item);
        return item;
}

Pushes a new item onto the top of this stack. The pushed item is also returned. This is equivalent to calling add.

 public int search(T object) 
{
        int i = size() - 1;        // Current index
        int n = 1;                 // Current distance
        while (i  >= 0) {
            Object current = get(i);
            if ((object == null && current == null)
                    || (object != null && object.equals(current))) {
                return n;
            }
            i--;
            n++;
        }
        return -1;
}

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.