package rebelsky.tests;

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;

import java.util.Vector;

import rebelsky.linear.Stack;
import rebelsky.linear.ArrayBasedStack;

/**
 * A simple analysis of stacks.  Builds and empties different
 * size stacks.
 *
 * @author Samuel A. Rebelsky
 * @version 1.0 of April 2006.
 */
public class AnalyzeStack
{
  public static void main(String[] args)
    throws Exception
  {
    PrintWriter pen = new PrintWriter(System.out, true);
    BufferedReader eyes = new BufferedReader(new InputStreamReader(System.in));

    for (int size = 1; size < 1025; size = 2*size) {
      ArrayBasedStack<Integer> stack = new ArrayBasedStack<Integer>();
      for (int i = 0; i < size; i++) {
        stack.put(new Integer(i));
      }
      while (!stack.isEmpty()) {
        stack.get();
      }
      pen.println("Size: " + size + "; Steps: " + stack.getSteps());
    }
  } // main(String[])

} // class AnalyzeStack