/** * Gets the value at the index which corresponds to the specified fraction * @param fraction 0 to 1 inclusive * @return value at fraction */ public int getFraction( double fraction ) { return get( (int)((size-1)*fraction) ); }
/** * Gets the value at the index which corresponds to the specified fraction * @param fraction 0 to 1 inclusive * @return value at fraction */ public int getFraction( double fraction ) { return get( (int)((size-1)*fraction) ); }
@Override public void check(GrowQueue_I8 queue, int index, double value) { assertEquals((int)value,queue.get(index)); }
@Test public void sort() { GrowQueue_I8 alg = new GrowQueue_I8(6); alg.push(8); alg.push(2); alg.push(4); alg.push(3); alg.push(-1); alg.sort(); assertEquals(5,alg.size); assertEquals(-1,alg.get(0)); assertEquals(2,alg.get(1)); assertEquals(3,alg.get(2)); assertEquals(4,alg.get(3)); assertEquals(8,alg.get(4)); }
@Test public void remove_two() { GrowQueue_I8 alg = new GrowQueue_I8(10); alg.push(1); alg.push(3); alg.push(4); alg.push(5); alg.push(6); alg.remove(1,1); assertEquals(4,alg.size); assertEquals(1,alg.get(0)); assertEquals(4,alg.get(1)); assertEquals(5,alg.get(2)); assertEquals(6,alg.get(3)); alg.remove(0,1); assertEquals(2,alg.size); assertEquals(5,alg.get(0)); assertEquals(6,alg.get(1)); }
@Test public void auto_grow() { GrowQueue_I8 alg = new GrowQueue_I8(3); assertEquals(3,alg.data.length); for( int i = 0; i < 10; i++ ) alg.push(i); assertEquals(10,alg.size); for( int i = 0; i < 10; i++ ) assertEquals(i,alg.get(i),1e-8); }
@Test public void addAll_array() { GrowQueue_I8 queue0 = new GrowQueue_I8(2); byte[] array = new byte[]{3,4,5}; queue0.add(1); queue0.add(2); assertEquals(2,queue0.size); queue0.addAll(array,0,3); assertEquals(5,queue0.size); for( int i = 0; i < queue0.size; i++ ) { assertEquals(queue0.get(i),i+1,1e-8); } queue0.reset(); queue0.addAll(array,1,3); assertEquals(2,queue0.size); for( int i = 0; i < queue0.size; i++ ) { assertEquals(queue0.get(i),i+4,1e-8); } }
@Test public void reset() { GrowQueue_I8 alg = new GrowQueue_I8(10); alg.push(1); alg.push(3); alg.push(-2); assertTrue(1.0 == alg.get(0)); assertEquals(3,alg.size); alg.reset(); assertEquals(0,alg.size); }
@Test public void addAll_queue() { GrowQueue_I8 queue0 = new GrowQueue_I8(2); GrowQueue_I8 queue1 = new GrowQueue_I8(3); queue0.add(1); queue0.add(2); queue1.add(3); queue1.add(4); queue1.add(5); assertEquals(2,queue0.size); queue0.addAll(queue1); assertEquals(5,queue0.size); for( int i = 0; i < queue0.size; i++ ) { assertEquals(queue0.get(i),i+1); } queue0.reset(); queue0.addAll(queue1); assertEquals(3,queue0.size); for( int i = 0; i < queue0.size; i++ ) { assertEquals(queue0.get(i),i+3); } }