org.apache.commons.collections4

Class ArrayStack<E>

  • All Implemented Interfaces:
    Serializable, Cloneable, Iterable<E>, Collection<E>, List<E>, RandomAccess
    Deprecated. 
    use ArrayDeque instead (available from Java 1.6) 

    @Deprecated
public class ArrayStack<E>
extends ArrayList<E>
    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.

    Unlike Stack, ArrayStack accepts null entries.

    Note: From version 4.0 onwards, this class does not implement the removed Buffer interface anymore.

    Since:
    1.0
    See Also:
    Stack, Serialized Form

    • Constructor Detail

      • ArrayStack

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

      • ArrayStack

        public ArrayStack(int initialSize)
        Deprecated. 
        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

    • Method Detail

      • empty

        public boolean empty()
        Deprecated. 
        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.

        Returns:
        true if the stack is currently empty

      • peek

        public E peek()
       throws EmptyStackException
        Deprecated. 
        Returns the top item off of this stack without removing it.
        Returns:
        the top item on the stack
        Throws:
        EmptyStackException - if the stack is empty

      • peek

        public E peek(int n)
       throws EmptyStackException
        Deprecated. 
        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
        Returns:
        the n'th item on the stack, zero relative
        Throws:
        EmptyStackException - if there are not enough items on the stack to satisfy this request

      • pop

        public E pop()
      throws EmptyStackException
        Deprecated. 
        Pops the top item off of this stack and return it.
        Returns:
        the top item on the stack
        Throws:
        EmptyStackException - if the stack is empty

      • push

        public E push(E item)
        Deprecated. 
        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
        Returns:
        the item just pushed

      • search

        public int search(Object object)
        Deprecated. 
        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
        Returns:
        the 1-based depth into the stack of the object, or -1 if not found