Found a bug in the grow method of the ArrayQueue

Author: phishman3579

src/com/jwetherell/algorithms/data_structures/Queue.java

@@ -117,11 +117,11 @@ private void grow(int size) {
             T[] temp = (T[]) new Object[growSize];
             // Since the array can wrap around, make sure you grab the first chunk 
             int adjLast = lastIndex % array.length;
-            if (adjLast < firstIndex) {
-                System.arraycopy(array, 0, temp, array.length-adjLast, adjLast+1);
+            if (adjLast > 0 && adjLast <= firstIndex) {
+                System.arraycopy(array, 0, temp, array.length-adjLast, adjLast);
             }
             // Copy the remaining
-            System.arraycopy(array, firstIndex, temp, 0, array.length-firstIndex);
+            System.arraycopy(array, firstIndex, temp, 0, array.length - firstIndex);
             array = null;
             array = temp;
             lastIndex = (lastIndex - firstIndex);
@@ -134,9 +134,9 @@ private void shrink() {
             T[] temp = (T[]) new Object[shrinkSize];
             // Since the array can wrap around, make sure you grab the first chunk 
             int adjLast = lastIndex % array.length;
-            int endIndex = (lastIndex>array.length)?array.length:lastIndex;
+            int endIndex = (lastIndex>array.length) ? array.length : lastIndex;
             if (adjLast <= firstIndex) {
-                System.arraycopy(array, 0, temp, array.length-firstIndex, adjLast);
+                System.arraycopy(array, 0, temp, array.length - firstIndex, adjLast);
             }
             // Copy the remaining
             System.arraycopy(array, firstIndex, temp, 0, endIndex-firstIndex);

test/com/jwetherell/algorithms/data_structures/test/QueueTests.java

@@ -16,7 +16,7 @@ public class QueueTests {
 
     @Test
     public void testArrayQueue() {
-        TestData data = Utils.generateTestData(100000);
+        TestData data = Utils.generateTestData(2500);
 
         String aName = "Queue [array]";
         Queue.ArrayQueue<Integer> aQueue = new Queue.ArrayQueue<Integer>();
@@ -30,7 +30,7 @@ public void testArrayQueue() {
 
     @Test
     public void testLinkedQueue() {
-        TestData data = Utils.generateTestData(100);
+        TestData data = Utils.generateTestData(250);
 
         String lName = "Queue [linked]";
         Queue.LinkedQueue<Integer> lQueue = new Queue.LinkedQueue<Integer>();