69     virtual int findNeighbors( Mat& points, Mat& neighbors ) = 0;
93     Mat points( pointsCount, dims, CV_32FC1 );  in checkFind()  local
102             points.at<float>(pi, d) = data.at<float>(fi, d) + rng.uniform(0.0f, 1.0f) * noise;  in checkFind()
105     code = findNeighbors( points, results );  in checkFind()
167     int knnSearch( Mat& points, Mat& neighbors );
168     int radiusSearch( Mat& points, Mat& neighbors );
178 int CV_FlannTest::knnSearch( Mat& points, Mat& neighbors )  in knnSearch()  argument
180     Mat dist( points.rows, neighbors.cols, CV_32FC1);  in knnSearch()
184     index->knnSearch( points, neighbors, dist, knn, SearchParams() );  in knnSearch()
188     for( int i = 0; i < points.rows; i++ )  in knnSearch()
190         float* fltPtr = points.ptr<float>(i);  in knnSearch()
191         vector<float> query( fltPtr, fltPtr + points.cols );  in knnSearch()
207 int CV_FlannTest::radiusSearch( Mat& points, Mat& neighbors )  in radiusSearch()  argument
215     for( int i = 0; i < points.rows; i++ )  in radiusSearch()
218         Mat p( 1, points.cols, CV_32FC1, points.ptr<float>(i) ),  in radiusSearch()
223         float* fltPtr = points.ptr<float>(i);  in radiusSearch()
224         vector<float> query( fltPtr, fltPtr + points.cols );  in radiusSearch()
251 …virtual int findNeighbors( Mat& points, Mat& neighbors ) { return knnSearch( points, neighbors ); }  in findNeighbors()  argument
261 …virtual int findNeighbors( Mat& points, Mat& neighbors ) { return radiusSearch( points, neighbors …  in findNeighbors()  argument
271 …virtual int findNeighbors( Mat& points, Mat& neighbors ) { return radiusSearch( points, neighbors …  in findNeighbors()  argument
281 …virtual int findNeighbors( Mat& points, Mat& neighbors ) { return knnSearch( points, neighbors ); }  in findNeighbors()  argument
291 …virtual int findNeighbors( Mat& points, Mat& neighbors ) { return knnSearch( points, neighbors ); }  in findNeighbors()  argument
300 …virtual int findNeighbors( Mat& points, Mat& neighbors ) { return knnSearch( points, neighbors ); }  in findNeighbors()  argument