import ch05.queues.*;
import java.util.Date;
public class TimingQueues {
  public static final int numIterations=1000, insertsPerIteration=1000000;
  public static void main(String[] args) {
    UnboundedQueueInterface<Integer> arrayQ = new ArrayUnbndQueue<Integer>();
    UnboundedQueueInterface<Integer> linkedQ = new LinkedUnbndQueue<Integer>();

    // Since both queues are of the same declared type,
    // the same code works for both
    System.out.print("An array-based unbounded queue ");
    time(arrayQ);
    System.out.print("A linked-based unbounded queue ");
    time(linkedQ);
  }

  private static void time(UnboundedQueueInterface<Integer> queue) {
    long startTime, elapsedTime;
    int temp;
	
    startTime = (new Date()).getTime();	// Initialized to now
    for (int i=0; i<numIterations; i++) {
      for (int j=0; j<insertsPerIteration; j++)
	queue.enqueue(i+j);
      for (int j=0; j<insertsPerIteration; j++)
	temp = queue.dequeue();
    }

    elapsedTime = (new Date()).getTime() - startTime;
    System.out.println ("requires " + elapsedTime + " milliseconds");
    System.out.println ("to enqueue and dequeue "+ insertsPerIteration +
			" elements " + numIterations + " times.");
  }
}
// Local Variables:
// c-basic-offset: 2
// compile-command: "export CLASSPATH=/a/dale-dataStructures/bookFiles:.; \
// (javac TimingQueues.java && java TimingQueues)"
// End: