/** * Returns a list of all the square grids it found */ public List<SquareGrid> getGrids() { return valid.toList(); }
@Override public List<Point2D_F64> getListDestination() { return dstPts.toList(); }
/** * Returns all the found interest points. * * @return Found interest points. */ public List<ScalePoint> getFoundPoints() { return foundPoints.toList(); }
private void drawDetections(Graphics2D g2, FastQueue<TldRegion> detected , Color c ) { for( TldRegion r : detected.toList() ) { drawRectangle(g2,r.rect,c,3); } }
@Override public void onDraw(Canvas canvas, Matrix imageToView) { canvas.concat(imageToView); synchronized (lockGui) { for( LineSegment2D_F32 s : lines.toList() ) { canvas.drawLine(s.a.x,s.a.y,s.b.x,s.b.y,paint); } } }
@Override public AssignCluster<double[]> getAssignment() { return new AssignGmm_F64(mixture.toList()); }
@Override public AssignCluster<double[]> getAssignment() { // creating a new list here to make serialization easier List<double[]> list = new ArrayList<double[]>(); list.addAll( bestClusters.toList() ); return new AssignKMeans_F64(list); }
@Override public AssignCluster<double[]> getAssignment() { return new AssignGmm_F64(mixture.toList()); }
@Override public AssignCluster<double[]> getAssignment() { // creating a new list here to make serialization easier List<double[]> list = new ArrayList<double[]>(); list.addAll( bestClusters.toList() ); return new AssignKMeans_F64(list); }
public List<Point2D_I32> getSet(int which) { FastQueue<Point2D_I32> tmp = new FastQueue<>(Point2D_I32.class,true); getSet(which,tmp); List<Point2D_I32> output = new ArrayList<>(); output.addAll( tmp.toList() ); return output; }
@Override protected List<Point2D_F64> getCalibrationPoints() { return detector.getKeypointFinder().getKeyPoints().toList(); }
/** * Sets up data structures for nearest-neighbor search used in {@link #connectNodes()} */ private void setupSearch() { searchPoints.reset(); for (int i = 0; i < nodes.size(); i++) { SquareNode n = nodes.get(i); double[] point = searchPoints.grow(); point[0] = n.center.x; point[1] = n.center.y; } search.setPoints(searchPoints.toList(), nodes.toList()); }
private void addDetections( FastQueue<TldRegion> detections ) { this.detections.reset(); for( TldRegion r : detections.toList() ){ TldRegion a = this.detections.grow(); a.confidence = r.confidence; a.rect.set(r.rect); } }
private void addDetections( FastQueue<TldRegion> detections ) { this.detections.reset(); for( TldRegion r : detections.toList() ){ TldRegion a = this.detections.grow(); a.confidence = r.confidence; a.rect.set(r.rect); } }
@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()); }
@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 get() { FastQueue<Double> queue = new FastQueue<Double>(100,Double.class,false); queue.add(1.0); queue.add(2.0); assertTrue(2.0==queue.toList().get(1)); }
@Test public void add() { FastQueue<Double> queue = new FastQueue<Double>(100,Double.class,false); List<Double> list = queue.toList(); list.add( 5.0 ); assertEquals(1,queue.size()); assertEquals(5.0,queue.get(0),1e-8); }