@Override public void run() { points.reset(); } });
public void reset() { p = null; matchMarker = -1; used = false; index = -1; neighbors.reset(); } }
public void reset() { contour = false; ellipse = null; left = right = null; angleBetween = 0; marked = false; edges.reset(); } }
@Override public void run() { points.reset(); } });
@Override public void process(GrayU8 gray) { foundBinary.reset(); super.process(gray); }
/** * Converts all the found clusters into grids, if they are valid. * * @param clusters List of clusters */ public void process( List<List<SquareNode>> clusters ) { grids.reset(); for (int i = 0; i < clusters.size(); i++) { if( checkPreconditions(clusters.get(i))) processCluster(clusters.get(i)); } }
public synchronized void setInliers(java.util.List<Point2D_F64> list) { inliers.reset(); if( list != null ) { for( Point2D_F64 p : list ) { inliers.grow().set(p); } } }
public synchronized void setAllTracks(java.util.List<Point2D_F64> list) { allTracks.reset(); if( list != null ) { for( Point2D_F64 p : list ) { allTracks.grow().set(p); } } }
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); } }
public void process( List<PointIndex_I32> poly ) { // top of image is 0 and bottom is height highestPoint = height; for( PointIndex_I32 p : poly ) { if( p.y < highestPoint ) highestPoint = p.y; } convertToF(poly); convert(poly); waypoints.reset(); verticalSearch(); }
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 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 findNearestN_checkData() { List<double[]> points = new ArrayList<>(); points.add(new double[]{3,4}); points.add(new double[]{6,8}); alg.setPoints(points,true); foundN.reset(); alg.findNearest(new double[]{6, 7}, 10, 1, foundN); assertEquals(1, foundN.get(0).index); }