public void add( T[] array , int first, int length ) { for( int i = 0; i < length; i++ ) { add( array[first+i]); } }
@Override public boolean add(T t) { queue.add(t); return true; }
public void addAll( FastQueue<T> list ) { for( int i = 0; i < list.size; i++ ) { add( list.data[i]); } }
@Override public boolean add(T t) { queue.add(t); return true; }
public void addAll( FastQueue<T> list ) { for( int i = 0; i < list.size; i++ ) { add( list.data[i]); } }
public void add( T[] array , int first, int length ) { for( int i = 0; i < length; i++ ) { add( array[first+i]); } }
@Override public boolean addAll(Collection<? extends T> c) { Iterator<T> iter = (Iterator)c.iterator(); boolean changed = iter.hasNext(); while( iter.hasNext() ) { queue.add(iter.next()); } return changed; }
@Override public boolean addAll(Collection<? extends T> c) { Iterator<T> iter = (Iterator)c.iterator(); boolean changed = iter.hasNext(); while( iter.hasNext() ) { queue.add(iter.next()); } return changed; }
/** * Checks to see if the child already exists. If not it creates the child. Info is added to * the child's points. */ protected O checkAddChild(O node, int index, Octree.Info info) { O child = checkAddChild(node, index); child.points.add(info); return child; }
@Override public void getFeatures(int set, FastQueue<Point2D_F64> locations, FastQueue<Desc> descriptions) { if( set != 0 ) throw new RuntimeException("Set must be 0"); int N = detDesc.getNumberOfFeatures(); for( int i = 0; i < N; i++ ) { locations.add( detDesc.getLocation(i) ); descriptions.add( detDesc.getDescription(i) ); } }
@Test public void contains() { FastQueue<Double> queue = new FastQueue<Double>(100,Double.class,false); Double d = 1.0; List<Double> list = queue.toList(); assertFalse(list.contains(d)); queue.add( d ); assertTrue(list.contains(d)); }
@Test public void size() { FastQueue<Double> queue = new FastQueue<Double>(100,Double.class,false); List<Double> list = queue.toList(); assertTrue(0==list.size()); queue.add( 1.0 ); assertTrue(1==list.size()); }
@Test public void isEmpty() { FastQueue<Double> queue = new FastQueue<Double>(100,Double.class,false); List<Double> list = queue.toList(); assertTrue( list.isEmpty() ); queue.add( 1.0 ); assertFalse(list.isEmpty()); }
private void createSet( T image , FastQueue<TupleDesc_F64> descs , FastQueue<Point2D_F64> points ) { detector.detect(image); descs.reset(); points.reset(); for( int i = 0; i < detector.getNumberOfFeatures(); i++ ) { points.grow().set(detector.getLocation(i)); descs.add( detector.getDescription(i).copy() ); } }
@Test public void add() { FastQueue<DummyData> alg = new FastQueue<DummyData>(DummyData.class,false); DummyData a = new DummyData(); alg.add(a); assertTrue(a==alg.data[0]); }
@Test public void contains() { FastQueue<Double> queue = new FastQueue<Double>(100,Double.class,false); Double d = 1.0; assertFalse(queue.contains(d)); queue.add( d ); assertTrue(queue.contains(d)); } }