Stack tutorial with example program

By candid | Posted : 10 Dec, 2015 | Updated : 10 Dec, 2015

All Implemented Interfaces:

Serializable, Cloneable, Iterable, Collection, List, RandomAccess

public class Stack
extends Vector
{
       //
}

Since:

JDK1.0

See Also:

Serialized Form

Field Summary

Fields inherited from class java.util.Vector

capacityIncrement, elementCount, elementData

Fields inherited from class java.util.AbstractList

modCount

Constructor Summary

Stack()

Creates an empty Stack.

Method Summary

boolean empty()

Tests if this stack is empty.

E peek()

Looks at the object at the top of this stack without removing it from the stack.

E pop()

Removes the object at the top of this stack and returns that object as the value of this function.

E push(E item)

Pushes an item onto the top of this stack.

int search(Object o)

Returns the 1-based position where an object is on this stack.

Methods inherited from class java.util.Vector

public boolean add(E e)

Appends the specified element to the end of this Vector.

public boolean addAll(Collection c)

Appends all of the elements in the specified Collection to the end of this Vector, in the order that they are returned by the specified Collection's Iterator. The behavior of this operation is undefined if the specified Collection is modified while the operation is in progress. (This implies that the behavior of this call is undefined if the specified Collection is this Vector, and this Vector is nonempty.)

public boolean addAll(int index,Collection c)

Inserts all of the elements in the specified Collection into this Vector at the specified position. Shifts the element currently at that position (if any) and any subsequent elements to the right (increases their indices). The new elements will appear in the Vector in the order that they are returned by the specified Collection's iterator.

public void addElement(E obj)

Adds the specified component to the end of this vector, increasing its size by one. The capacity of this vector is increased if its size becomes greater than its capacity.

public int capacity()

Returns the current capacity of this vector.

public void clear()

Removes all of the elements from this Vector. The Vector will be empty after this call returns (unless it throws an exception).

public Object clone()

Returns a clone of this vector. The copy will contain a reference to a clone of the internal data array, not a reference to the original internal data array of this Vector object.

public boolean contains(Object o)

Returns true if this vector contains the specified element. More formally, returns true if and only if this vector contains at least one element e such that (o==null ? e==null : o.equals(e)).

public boolean containsAll(Collection c)

Returns true if this Vector contains all of the elements in the specified Collection.

public void copyInto(Object[] anArray)

Copies the components of this vector into the specified array. The item at index k in this vector is copied into component k of anArray.

public E elementAt(int index)

Returns the component at the specified index.

public E elementAt(int index)

Returns the component at the specified index.

public Enumeration elements()

Returns an enumeration of the components of this vector. The returned Enumeration object will generate all items in this vector. The first item generated is the item at index 0, then the item at index 1, and so on.

public void ensureCapacity(int minCapacity)

Increases the capacity of this vector, if necessary, to ensure that it can hold at least the number of components specified by the minimum capacity argument.

public E firstElement()

Returns the first component (the item at index 0) of this vector.

public E get(int index)

Returns the element at the specified position in this Vector.

public int indexOf(Object o)

Returns the index of the first occurrence of the specified element in this vector, or -1 if this vector does not contain the element. More formally, returns the lowest index i such that (o==null ? get(i)==null : o.equals(get(i))), or -1 if there is no such index.

public int indexOf(Object o,int index)

Returns the index of the first occurrence of the specified element in this vector, searching forwards from index, or returns -1 if the element is not found. More formally, returns the lowest index i such that (i >= index && (o==null ? get(i)==null : o.equals(get(i)))), or -1 if there is no such index.

public void insertElementAt(E obj,int index)

Inserts the specified object as a component in this vector at the specified index. Each component in this vector with an index greater or equal to the specified index is shifted upward to have an index one greater than the value it had previously.

public boolean isEmpty()

Tests if this vector has no components.

public Iterator iterator()

Returns an iterator over the elements in this list in proper sequence.

public E lastElement()

Returns the last component of the vector.

public int lastIndexOf(Object o)

Returns the index of the last occurrence of the specified element in this vector, or -1 if this vector does not contain the element. More formally, returns the highest index i such that (o==null ? get(i)==null : o.equals(get(i))), or -1 if there is no such index.

public int lastIndexOf(Object o,int index)

Returns the index of the last occurrence of the specified element in this vector, searching backwards from index, or returns -1 if the element is not found. More formally, returns the highest index i such that (i <= index && (o==null ? get(i)==null : o.equals(get(i)))), or -1 if there is no such index.

public ListIterator listIterator()

Returns a list iterator over the elements in this list (in proper sequence).

public ListIterator listIterator(int index)

Returns a list iterator over the elements in this list (in proper sequence), starting at the specified position in the list. The specified index indicates the first element that would be returned by an initial call to next. An initial call to previous would return the element with the specified index minus one.

public E remove(int index)

Removes the element at the specified position in this Vector. Shifts any subsequent elements to the left (subtracts one from their indices). Returns the element that was removed from the Vector.

public boolean remove(Object o)

Removes the first occurrence of the specified element in this Vector If the Vector does not contain the element, it is unchanged. More formally, removes the element with the lowest index i such that (o==null ? get(i)==null : o.equals(get(i))) (if such an element exists).

public boolean removeAll(Collection c)

Removes from this Vector all of its elements that are contained in the specified Collection.

public void removeAllElements()

Removes all components from this vector and sets its size to zero.

public boolean removeElement(Object obj)

Removes the first (lowest-indexed) occurrence of the argument from this vector. If the object is found in this vector, each component in the vector with an index greater or equal to the object's index is shifted downward to have an index one smaller than the value it had previously.

public void removeElementAt(int index)

Deletes the component at the specified index. Each component in this vector with an index greater or equal to the specified index is shifted downward to have an index one smaller than the value it had previously. The size of this vector is decreased by 1.

protected void removeRange(int fromIndex,int toIndex)

Removes from this list all of the elements whose index is between fromIndex, inclusive, and toIndex, exclusive. Shifts any succeeding elements to the left (reduces their index). This call shortens the list by (toIndex - fromIndex) elements. (If toIndex==fromIndex, this operation has no effect.)

public boolean retainAll(Collection c)

Retains only the elements in this Vector that are contained in the specified Collection. In other words, removes from this Vector all of its elements that are not contained in the specified Collection.

public E set(int index,E element)

Replaces the element at the specified position in this Vector with the specified element.

public void setElementAt(E obj,int index)

Sets the component at the specified index of this vector to be the specified object. The previous component at that position is discarded.

public void setSize(int newSize)

Sets the size of this vector. If the new size is greater than the current size, new null items are added to the end of the vector. If the new size is less than the current size, all components at index newSize and greater are discarded.

public int size()

Returns the number of components in this vector.

public List subList(int fromIndex,int toIndex)

Returns a view of the portion of this List between fromIndex, inclusive, and toIndex, exclusive. (If fromIndex and toIndex are equal, the returned List is empty.) The returned List is backed by this List, so changes in the returned List are reflected in this List, and vice-versa. The returned List supports all of the optional List operations supported by this List.

public Object[] toArray()

Returns an array containing all of the elements in this Vector in the correct order.

public T[] toArray(T[] a)

Returns an array containing all of the elements in this Vector in the correct order; the runtime type of the returned array is that of the specified array. If the Vector fits in the specified array, it is returned therein. Otherwise, a new array is allocated with the runtime type of the specified array and the size of this Vector.

public String toString()

Returns a string representation of this Vector, containing the String representation of each element.

public void trimToSize()

Trims the capacity of this vector to be the vector's current size. If the capacity of this vector is larger than its current size, then the capacity is changed to equal the size by replacing its internal data array, kept in the field elementData, with a smaller one. An application can use this operation to minimize the storage of a vector.

Methods inherited from class java.lang.Object

finalize, getClass, notify, notifyAll, wait, wait, wait, equals, hashCode

Stack tutorial with example program

Comments

Recent Posts