Rename year directories to allow natural ordering

year2/semester2/CT2109/Assignments/Assignment-03/code/ArrayQueue.java

@@ -0,0 +1,69 @@
+import javax.swing.JOptionPane;
+
+/**
+ * Array implementation of Queue ADT
+ */
+
+public class ArrayQueue implements Queue 
+{
+	 protected Object Q[];				// array used to implement the queue 
+	 protected int rear = -1;			// index for the rear of the queue
+	 protected int capacity; 			// The actual capacity of the queue array
+	 public static final int CAPACITY = 1000;	// default array capacity
+	   
+	 public ArrayQueue() {
+		   // default constructor: creates queue with default capacity
+		   this(CAPACITY);
+	 }
+
+	 public ArrayQueue(int cap) {
+		  // this constructor allows you to specify capacity
+		  capacity = (cap > 0) ? cap : CAPACITY;
+		  Q = new Object[capacity]; 
+	 }
+	 
+	 public void enqueue(Object n)
+	 {
+		 if (isFull()) {
+			 JOptionPane.showMessageDialog(null, "Cannot enqueue object; queue is full.");
+			 return;
+		 }
+		 rear++;
+		 Q[rear] = n;
+	 }
+	 
+	 public Object dequeue()
+	 {
+		 // Can't do anything if it's empty
+		 if (isEmpty())
+			 return null;
+		 
+		 Object toReturn = Q[0];
+		 
+		 // shuffle all other objects towards 0
+		 int i = 1;
+		 while (i <= rear) {
+			 Q[i-1] = Q[i];
+			 i++;
+		 }
+
+		 rear--;
+		 return toReturn;
+	 }
+	 
+	 public boolean isEmpty()  {
+	     return (rear < 0);
+	 }
+	 
+	 public boolean isFull() {
+		 return (rear == capacity-1);
+	 }
+	 
+	 public Object front()
+	 {
+		 if (isEmpty())
+			 return null;
+		 
+		 return Q[0];
+	 }
+}