File	Doc	Category	Size	Date	Package
Stack.java	API Doc	J2ME CLDC 1.1	3492	Wed Feb 05 15:56:00 GMT 2003	java.util

Stack

• java.lang.Object
  • java.util.AbstractCollection
    • java.util.AbstractList
      • java.util.Vector

Fields Summary

Constructors Summary
public Stack() Creates an empty Stack.

Methods Summary
public boolean	empty() Tests if this stack is empty. return true if and only if this stack contains no items; false otherwise. return size() == 0;
public synchronized java.lang.Object	peek() Looks at the object at the top of this stack without removing it from the stack. return the object at the top of this stack (the last item of the Vector object). exception EmptyStackException if this stack is empty. int len = size(); if (len == 0) { throw new EmptyStackException(); } return elementAt(len - 1);
public synchronized java.lang.Object	pop() Removes the object at the top of this stack and returns that object as the value of this function. return The object at the top of this stack (the last item of the Vector object). exception EmptyStackException if this stack is empty. Object obj; int len = size(); obj = peek(); removeElementAt(len - 1); return obj;
public java.lang.Object	push(java.lang.Object item) Pushes an item onto the top of this stack. This has exactly the same effect as: addElement(item) param item the item to be pushed onto this stack. return the item argument. see java.util.Vector#addElement addElement(item); return item;
public synchronized int	search(java.lang.Object 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. param o the desired object. return 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. int i = lastIndexOf(o); if (i >= 0) { return size() - i; } return -1;