Searched refs:veclen_ (Results 1 – 3 of 3) sorted by relevance
| /OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/flann/ |
| H A D | kmeans_index.h | 353 veclen_ = dataset_.cols; in dataset_()
411 return veclen_; in veclen()
548 for (size_t j=0; j<veclen_; ++j) { in getClusterCenters()
615 save_value(stream, *(node->pivot), (int)veclen_); in save_tree()
632 node->pivot = new DistanceType[veclen_]; in load_tree()
633 load_value(stream, *(node->pivot), (int)veclen_); in load_tree()
673 DistanceType* mean = new DistanceType[veclen_]; in computeNodeStatistics()
674 memoryCounter_ += int(veclen_*sizeof(DistanceType)); in computeNodeStatistics()
676 memset(mean,0,veclen_*sizeof(DistanceType)); in computeNodeStatistics()
680 for (size_t j=0; j<veclen_; ++j) { in computeNodeStatistics()
[all …]
|
| H A D | kdtree_index.h | 89 veclen_ = dataset_.cols; in dataset_()
100 mean_ = new DistanceType[veclen_]; in dataset_()
101 var_ = new DistanceType[veclen_]; in dataset_()
183 return veclen_; in veclen()
313 memset(mean_,0,veclen_*sizeof(DistanceType)); in meanSplit()
314 memset(var_,0,veclen_*sizeof(DistanceType)); in meanSplit()
322 for (size_t k=0; k<veclen_; ++k) { in meanSplit()
326 for (size_t k=0; k<veclen_; ++k) { in meanSplit()
333 for (size_t k=0; k<veclen_; ++k) { in meanSplit()
366 for (size_t i = 0; i < veclen_; ++i) { in selectDivision()
[all …]
|
| H A D | hierarchical_clustering_index.h | 364 veclen_ = dataset.cols; in dataset()
448 return veclen_; in veclen()
657 DistanceType dist = distance(point, dataset[centers[0]], veclen_); in computeLabels()
660 DistanceType new_dist = distance(point, dataset[centers[j]], veclen_); in computeLabels()
756 DistanceType dist = distance(dataset[index], vec, veclen_); in findNN()
766 … domain_distances[best_index] = distance(vec, dataset[node->childs[best_index]->pivot], veclen_); in findNN()
768 domain_distances[i] = distance(vec, dataset[node->childs[i]->pivot], veclen_); in findNN()
805 size_t veclen_; variable
|