/** * Returns and removes the first element from the queue. * @return first element in the queue */ public int popHead() { int r = data[start]; removeHead(); return r; }
/** * Returns and removes the first element from the queue. * @return first element in the queue */ public int popHead() { int r = data[start]; removeHead(); return r; }
@Test public void removeHead() { CircularQueue_I32 alg = new CircularQueue_I32(); alg.add(1); alg.add(2); alg.removeHead(); assertEquals(2, alg.head()); assertEquals(1, alg.size()); alg.removeHead(); assertEquals(0, alg.size()); }
@Test public void get() { CircularQueue_I32 alg = new CircularQueue_I32(2); assertEquals(2,alg.data.length); // easy case alg.add(1); alg.add(2); assertEquals(1,alg.get(0)); assertEquals(2,alg.get(1)); // make there be an offset alg.removeHead(); alg.add(3); assertEquals(2,alg.data.length); // sanity check assertEquals(2,alg.get(0)); assertEquals(3,alg.get(1)); }