Stack.java

public class Stack extends Vector
{
  public boolean empty()
  {
    return size()==0;
  }
 
  public Object peek()
  {
    if ( size()==0)
      throw new EmptyStackException();
    return elementAt(size()-1);
  }
 
  public Object pop()
  {
    Object o = peek();  //ce ne uspe bo exception
    removeElementAt(size()-1);
    return o;
  }
 
  public Object push(Object o)
  {
    addElement(o);
    return o;
  }
 
  public int search(Object o)
  {
    int i = lastIndexOf(o);
    if (i<0)
      return -1;
    return size()-i;
  }
 
  public Stack()  //konstruktor klice iz nadrejenega razreda
  {
  }
}