/** * Creates a queue with the specified length as its size filled with all zeros */ public static GrowQueue_F64 zeros( int length ) { GrowQueue_F64 out = new GrowQueue_F64(length); out.size = length; return out; }
/** * Creates a queue with the specified length as its size filled with all zeros */ public static GrowQueue_F64 zeros( int length ) { GrowQueue_F64 out = new GrowQueue_F64(length); out.size = length; return out; }
@Override public GrowQueue_F64 copy() { GrowQueue_F64 ret = new GrowQueue_F64(size); ret.setTo(this); return ret; }
@Override public GrowQueue_F64 copy() { GrowQueue_F64 ret = new GrowQueue_F64(size); ret.setTo(this); return ret; }
@Override public GrowQueue_F64 declare(int maxsize) { return new GrowQueue_F64(maxsize); }
@Test public void findClosestN_zero() { List<double[]> list = new ArrayList<double[]>(); ExhaustiveNeighbor<double[]> alg = new ExhaustiveNeighbor<>(distance); alg.setPoints(list); GrowQueue_I32 outputIndex = new GrowQueue_I32(); GrowQueue_F64 outputDistance = new GrowQueue_F64(); alg.findClosestN(new double[]{1, 2}, 10, 5, outputIndex, outputDistance); assertEquals(0,outputIndex.size); assertEquals(0,outputDistance.size); }
@Test public void auto_grow() { GrowQueue_F64 alg = new GrowQueue_F64(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 indexOfGreatest() { GrowQueue_F64 alg = new GrowQueue_F64(20); assertEquals(-1,alg.indexOfGreatest()); alg.add(-3); alg.add(-2); alg.add(-1); assertEquals(2, alg.indexOfGreatest()); }
@Test public void fraction_F64() { GrowQueue_F64 l = new GrowQueue_F64(); for (int i = 0; i < 100; i++) { l.add(i); } assertEquals(50,UtilStatisticsQueue.fraction(l,0.5),1e-8); assertEquals(0,UtilStatisticsQueue.fraction(l,0),1e-8); assertEquals(99,UtilStatisticsQueue.fraction(l,1.0),1e-8); } }
@Test public void indexOfLeast() { GrowQueue_F64 alg = new GrowQueue_F64(20); assertEquals(-1,alg.indexOfLeast()); alg.add(-3); alg.add(-2); alg.add(-4); assertEquals(2, alg.indexOfLeast()); } }
@Test public void mean_F64() { GrowQueue_F64 l = new GrowQueue_F64(); l.add(0); l.add(1); l.add(2); l.add(3); l.add(4); double found = UtilStatisticsQueue.mean(l); assertEquals(2,found,1e-8); }
@Test public void variance_F64() { GrowQueue_F64 l = new GrowQueue_F64(); l.add(0); l.add(1); l.add(2); l.add(3); l.add(4); double found = UtilStatisticsQueue.variance(l,2); assertEquals(2.5,found,1e-8); }
@Test public void push_pop() { GrowQueue_F64 alg = new GrowQueue_F64(10); alg.push(1); alg.push(3); assertEquals(2,alg.size); assertTrue(3==alg.pop()); assertTrue(1==alg.pop()); assertEquals(0, alg.size); }
@Test public void indexOf() { GrowQueue_F64 alg = new GrowQueue_F64(10); alg.push(1); alg.push(3); alg.push(4); alg.push(5); assertEquals(1,alg.indexOf(3)); assertEquals(-1,alg.indexOf(8)); }
@Test public void reset() { GrowQueue_F64 alg = new GrowQueue_F64(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 findClosestN_standard() { List<double[]> list = TestKdTreeConstructor.createPoints(2, 1,2, 3,4 , 4,5, 6,7 , 8,9 ); ExhaustiveNeighbor<double[]> alg = new ExhaustiveNeighbor<>(distance); alg.setPoints(list); GrowQueue_I32 outputIndex = new GrowQueue_I32(); GrowQueue_F64 outputDistance = new GrowQueue_F64(); alg.findClosestN(new double[]{4.1, 4.9}, 10, 3, outputIndex, outputDistance); assertEquals(3,outputIndex.size); assertEquals(3,outputDistance.size); checkContains(1,outputIndex); checkContains(2,outputIndex); checkContains(3,outputIndex); }
@Test public void remove() { GrowQueue_F64 alg = new GrowQueue_F64(10); alg.push(1); alg.push(3); alg.push(4); alg.push(5); alg.remove(1); assertEquals(3,alg.size); assertEquals(1,alg.get(0),1e-8); assertEquals(4,alg.get(1),1e-8); assertEquals(5,alg.get(2),1e-8); }
/** * Request more inliers than there are */ @Test public void findClosestN_toomany() { List<double[]> list = TestKdTreeConstructor.createPoints(2, 1,2, 3,4); ExhaustiveNeighbor<double[]> alg = new ExhaustiveNeighbor<>(distance); alg.setPoints(list); GrowQueue_I32 outputIndex = new GrowQueue_I32(); GrowQueue_F64 outputDistance = new GrowQueue_F64(); alg.findClosestN(new double[]{1, 2}, 10, 5, outputIndex, outputDistance); assertEquals(2,outputIndex.size); assertEquals(2,outputDistance.size); assertEquals(0,outputIndex.get(0)); assertEquals(1,outputIndex.get(1)); }
@Test public void sort() { GrowQueue_F64 alg = new GrowQueue_F64(6); alg.push(8); alg.push(2); alg.push(4); alg.push(3); alg.sort(); assertEquals(4,alg.size); assertEquals(2,alg.get(0),1e-8); assertEquals(3,alg.get(1),1e-8); assertEquals(4,alg.get(2),1e-8); assertEquals(8,alg.get(3),1e-8); }
@Test public void getFraction() { GrowQueue_F64 alg = new GrowQueue_F64(20); for (int i = 0; i < 20; i++) { alg.add(i); } assertEquals(0,alg.getFraction(0.0), UtilEjml.TEST_F64); assertEquals(0,alg.getFraction(0.02), UtilEjml.TEST_F64); assertEquals(0,alg.getFraction(0.03), UtilEjml.TEST_F64); assertEquals(1,alg.getFraction(1.0/19.0), UtilEjml.TEST_F64); assertEquals(1,alg.getFraction(1.7/19.0), UtilEjml.TEST_F64); assertEquals(19/2,alg.getFraction(0.5), UtilEjml.TEST_F64); assertEquals(19,alg.getFraction(1.0), UtilEjml.TEST_F64); }