Java-COde/CircularQueueTester.java at master · BearSolitary/Java-COde · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
/**
 * Tests the <code>CircularQueue</code> class.
 * @author M. Arkin
 * @version 1.0 2011-10-01
 */
public class CircularQueueTester
{
   /**
    * Creates and manipulates a queue of characters.
    * @param argument not used
    */
   public static void main(String[] argument)
   {
      System.out.println("\nCreate a new queue and display its state.");
      LinkedListCirculerQueue queue = new LinkedListCirculerQueue();
      int line = 1;
      System.out.printf("%02d%s%n", line++, ": empty? " + queue.isEmpty());
      System.out.printf("%02d%s%n", line++, ": " + queue);

      System.out.println("\nTry to create a queue underflow.");
      System.out.printf("%02d%s%n", line++, ": peek at '" + queue.peek() + "'");
      System.out.printf
         ("%02d%s%n", line++, ": just dequeued '" + queue.dequeue() + "'");

      System.out.println("\nEnqueue and dequeue some elements.");
      queue.enqueue(1);
      System.out.printf("%02d%s%n", line++, ": enqueued 'a'; " + queue);

      queue.enqueue(2);
      System.out.printf("%02d%s%n", line++, ": enqueued 'b'; " + queue);

      queue.enqueue(3);
      System.out.printf("%02d%s%n", line++, ": enqueued 'c'; " + queue);

      System.out.printf
         ("%02d%s%n", line++, ": just dequeued '" + queue.dequeue()
             + "'; " + queue);

      System.out.printf
         ("%02d%s%n", line++, ": just dequeued '" + queue.dequeue()
             + "'; " + queue);
      System.out.printf
         ("%02d%s%n", line++, ": just dequeued '" + queue.dequeue()
             + "'; " + queue);

      System.out.println("\nTry to create a queue underflow.");
      System.out.printf("%02d%s%n", line++, ": empty? " + queue.isEmpty());
      System.out.printf("%02d%s%n", line++, ": peek at '" + queue.peek() + "'");
      System.out.printf
         ("%02d%s%n", line++, ": just dequeued '" + queue.dequeue()
             + "'; " + queue);

      System.out.println("\nEnqueue more elements.");
      queue.enqueue(4);
      System.out.printf("%02d%s%n", line++, ": enqueued 'd'; " + queue);

      queue.enqueue(5);
      System.out.printf("%02d%s%n", line++, ": enqueued 'e'; " + queue);

      queue.enqueue(6);
      System.out.printf("%02d%s%n", line++, ": enqueued 'f'; " + queue);

      queue.enqueue(7);
      System.out.printf("%02d%s%n", line++, ": enqueued 'g'; " + queue);

      queue.enqueue(8);
      System.out.printf("%02d%s%n", line++, ": enqueued 'h'; " + queue);

      System.out.printf("%02d%s%n", line++, ": peek at '" + queue.peek() + "'");

      System.out.println("\nTry to create a queue overflow.");
      System.out.printf("%02d%s%n", line++, ": empty? " + queue.isEmpty());
      queue.enqueue(9);
      System.out.printf("%02d%s%n", line++, ": enqueued 'i'; " + queue);


      /*
      System.out.println("\nTry again to create a queue underflow.");
      System.out.printf("%02d%s%n", line++, ": empty? " + queue.isEmpty());
      System.out.printf
         ("%02d%s%n", line++, ": just dequeued '" + queue.dequeue() + "'");
      System.out.printf("%02d%s%n", line++, ": peek at '" + queue.peek() + "'");
      System.out.printf("%02d%s%n", line++, ": " + queue);

      System.out.println("\nTry to trip up the circularity.");
      for (char c = '1'; c <= '5'; c++)
      {
         queue.enqueue(c);
         System.out.printf
            ("%02d%s%n", line++, ": enqueued '" + c + "'; " + queue);
      } // end of for (char c = '1'; c <= '5'; c++)


      for (char c = 'a'; c <= 'z'; c++)
      {
         queue.enqueue(c);
         System.out.printf
            ("%02d%s%n", line++, ": enqueued '" + c + "'; " + queue);
         System.out.printf
            ("%02d%s%n", line++, ": just dequeued '" + queue.dequeue() + "'; "
            + queue);
      } // end of for (char c = '1'; c <= '5'; c++)
      */
   } // end of class main(String[] argument)
} // end of class CircularQueueTester