Home
last modified time | relevance | path

Searched refs:indices (Results 1 – 25 of 233) sorted by relevance

12345678910

/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/
H A Dflann.hpp216 void knnSearch(const std::vector<ElementType>& query, std::vector<int>& indices,
218 …void knnSearch(const Mat& queries, Mat& indices, Mat& dists, int knn, const ::cvflann::SearchParam…
220 int radiusSearch(const std::vector<ElementType>& query, std::vector<int>& indices,
222 int radiusSearch(const Mat& query, Mat& indices, Mat& dists,
271 …nce>::knnSearch(const std::vector<ElementType>& query, std::vector<int>& indices, std::vector<Dist… in knnSearch() argument
274 ::cvflann::Matrix<int> m_indices(&indices[0], 1, indices.size()); in knnSearch()
284 void GenericIndex<Distance>::knnSearch(const Mat& queries, Mat& indices, Mat& dists, int knn, const… in knnSearch() argument
290 CV_Assert(indices.type() == CV_32S); in knnSearch()
291 CV_Assert(indices.isContinuous()); in knnSearch()
292 ::cvflann::Matrix<int> m_indices((int*)indices.ptr<int>(0), indices.rows, indices.cols); in knnSearch()
[all …]
/OK3568_Linux_fs/external/rknpu2/examples/3rdparty/opencv/opencv-linux-aarch64/include/opencv2/flann/
H A Dresult_set.h87 int* indices; variable
100 indices = indices_; in init()
124 if ( (dists[i-1]>dist) || ((dist==dists[i-1])&&(indices[i-1]>index)) ) in addPoint()
131 indices[i] = indices[i-1]; in addPoint()
138 indices[i] = index; in addPoint()
154 int* indices; variable
167 indices = indices_; in init()
191 if ( (dists[i-1]<=dist) && ((dist!=dists[i-1])||(indices[i-1]<=index)) ) in addPoint()
199 if (indices[j] == index) { in addPoint()
211 indices[j] = indices[j-1]; in addPoint()
[all …]
H A Dhierarchical_clustering_index.h359 : dataset(inputData), params(index_params), root(NULL), indices(NULL), distance(d) in dataset()
389 indices = new int*[trees_]; in dataset()
393 indices[i] = NULL; in dataset()
413 if (indices!=NULL) { in ~HierarchicalClusteringIndex()
414 delete[] indices; in ~HierarchicalClusteringIndex()
424 if (indices!=NULL) { in free_elements()
426 if (indices[i]!=NULL) { in free_elements()
427 delete[] indices[i]; in free_elements()
428 indices[i] = NULL; in free_elements()
473 indices[i] = new int[size_]; in buildIndex()
[all …]
H A Dkmeans_index.h107 …void chooseCentersRandom(int k, int* indices, int indices_length, int* centers, int& centers_lengt… in chooseCentersRandom() argument
123 centers[index] = indices[rnd]; in chooseCentersRandom()
148 …void chooseCentersGonzales(int k, int* indices, int indices_length, int* centers, int& centers_len… in chooseCentersGonzales() argument
155 centers[0] = indices[rnd]; in chooseCentersGonzales()
163 … DistanceType dist = distance_(dataset_[centers[0]],dataset_[indices[j]],dataset_.cols); in chooseCentersGonzales()
165 … DistanceType tmp_dist = distance_(dataset_[centers[i]],dataset_[indices[j]],dataset_.cols); in chooseCentersGonzales()
176 centers[index] = indices[best_index]; in chooseCentersGonzales()
199 …void chooseCentersKMeanspp(int k, int* indices, int indices_length, int* centers, int& centers_len… in chooseCentersKMeanspp() argument
209 centers[0] = indices[index]; in chooseCentersKMeanspp()
212 … closestDistSq[i] = distance_(dataset_[indices[i]], dataset_[indices[index]], dataset_.cols); in chooseCentersKMeanspp()
[all …]
H A Dnn_index.h68 …virtual void knnSearch(const Matrix<ElementType>& queries, Matrix<int>& indices, Matrix<DistanceTy… in knnSearch() argument
71 assert(indices.rows >= queries.rows); in knnSearch()
73 assert(int(indices.cols) >= knn); in knnSearch()
79 resultSet.init(indices[i], dists[i]); in knnSearch()
87 if (get_param(params,"sorted",true)) resultSet.sortAndCopy(indices[i], dists[i], knn); in knnSearch()
88 else resultSet.copy(indices[i], dists[i], knn); in knnSearch()
102 …virtual int radiusSearch(const Matrix<ElementType>& query, Matrix<int>& indices, Matrix<DistanceTy… in radiusSearch() argument
109 assert(indices.cols == dists.cols); in radiusSearch()
114 if (indices.cols > 0) { in radiusSearch()
115 n = (int)indices.cols; in radiusSearch()
[all …]
H A Dflann_base.hpp216 …void knnSearch(const Matrix<ElementType>& queries, Matrix<int>& indices, Matrix<DistanceType>& dis… in knnSearch() argument
218 nnIndex_->knnSearch(queries, indices, dists, knn, params); in knnSearch()
230 …int radiusSearch(const Matrix<ElementType>& query, Matrix<int>& indices, Matrix<DistanceType>& dis… in radiusSearch() argument
232 return nnIndex_->radiusSearch(query, indices, dists, radius, params); in radiusSearch()
H A Dlsh_index.h190 …virtual void knnSearch(const Matrix<ElementType>& queries, Matrix<int>& indices, Matrix<DistanceTy… in knnSearch() argument
193 assert(indices.rows >= queries.rows); in knnSearch()
195 assert(int(indices.cols) >= knn); in knnSearch()
202 std::fill_n(indices[i], knn, -1); in knnSearch()
205 if (get_param(params,"sorted",true)) resultSet.sortAndCopy(indices[i], dists[i], knn); in knnSearch()
206 else resultSet.copy(indices[i], dists[i], knn); in knnSearch()
H A Dlsh_table.h357 std::vector<int> indices(feature_size * CHAR_BIT); in LshTable()
358 for (size_t i = 0; i < feature_size * CHAR_BIT; ++i) indices[i] = (int)i; in LshTable()
360 cv::randShuffle(indices); in LshTable()
362 std::random_shuffle(indices.begin(), indices.end()); in LshTable()
367 size_t index = indices[i]; in LshTable()
/OK3568_Linux_fs/kernel/net/bridge/
H A Dbr_ioctl.c20 static int get_bridge_ifindices(struct net *net, int *indices, int num) in get_bridge_ifindices() argument
30 indices[i++] = dev->ifindex; in get_bridge_ifindices()
159 int num, *indices; in old_dev_ioctl() local
169 indices = kcalloc(num, sizeof(int), GFP_KERNEL); in old_dev_ioctl()
170 if (indices == NULL) in old_dev_ioctl()
173 get_port_ifindices(br, indices, num); in old_dev_ioctl()
174 if (copy_to_user((void __user *)args[1], indices, num*sizeof(int))) in old_dev_ioctl()
176 kfree(indices); in old_dev_ioctl()
312 int *indices; in old_deviceless() local
317 indices = kcalloc(args[2], sizeof(int), GFP_KERNEL); in old_deviceless()
[all …]
/OK3568_Linux_fs/kernel/mm/
H A Dtruncate.c60 struct pagevec *pvec, pgoff_t *indices, in truncate_exceptional_pvec_entries() argument
78 lock = !dax && indices[j] < end; in truncate_exceptional_pvec_entries()
84 pgoff_t index = indices[i]; in truncate_exceptional_pvec_entries()
296 pgoff_t indices[PAGEVEC_SIZE]; in truncate_inode_pages_range() local
328 indices)) { in truncate_inode_pages_range()
341 index = indices[i]; in truncate_inode_pages_range()
366 truncate_exceptional_pvec_entries(mapping, &pvec, indices, end); in truncate_inode_pages_range()
414 min(end - index, (pgoff_t)PAGEVEC_SIZE), indices)) { in truncate_inode_pages_range()
422 if (index == start && indices[0] >= end) { in truncate_inode_pages_range()
433 index = indices[i]; in truncate_inode_pages_range()
[all …]
/OK3568_Linux_fs/kernel/drivers/net/ethernet/intel/ixgbe/
H A Dixgbe_lib.c65 if (fcoe->indices) { in ixgbe_cache_ring_dcb_sriov()
69 reg_idx = (vmdq->offset + vmdq->indices) * queues_per_pool; in ixgbe_cache_ring_dcb_sriov()
77 reg_idx = (vmdq->offset + vmdq->indices) * queues_per_pool; in ixgbe_cache_ring_dcb_sriov()
157 rss_i = adapter->ring_feature[RING_F_RSS].indices; in ixgbe_cache_ring_dcb()
206 if ((reg_idx & ~vmdq->mask) >= rss->indices) { in ixgbe_cache_ring_sriov()
230 if ((reg_idx & rss->mask) >= rss->indices) in ixgbe_cache_ring_sriov()
364 adapter->ring_feature[RING_F_VMDQ].indices = vmdq_i; in ixgbe_set_dcb_sriov_queues()
371 adapter->ring_feature[RING_F_RSS].indices = 1; in ixgbe_set_dcb_sriov_queues()
395 fcoe->indices = fcoe_i; in ixgbe_set_dcb_sriov_queues()
403 fcoe->indices = 1; in ixgbe_set_dcb_sriov_queues()
[all …]
/OK3568_Linux_fs/external/xserver/hw/xfree86/common/
H A Dxf86cmap.c155 int *indices; in xf86HandleColormaps() local
167 if (!(indices = xallocarray(maxColors, sizeof(int)))) { in xf86HandleColormaps()
174 free(indices); in xf86HandleColormaps()
197 pScreenPriv->PreAllocIndices = indices; in xf86HandleColormaps()
364 int *indices = pScreenPriv->PreAllocIndices; in CMapStoreColors() local
393 if (indices[i] == index) in CMapStoreColors()
396 indices[num++] = index; in CMapStoreColors()
403 if (indices[i] == index) in CMapStoreColors()
406 indices[num++] = index; in CMapStoreColors()
413 if (indices[i] == index) in CMapStoreColors()
[all …]
/OK3568_Linux_fs/kernel/net/sched/
H A Dsch_dsmark.c50 u16 indices; member
59 return index <= p->indices && index > 0; in dsmark_valid_index()
177 for (i = 0; i < p->indices; i++) { in dsmark_walk()
303 index = skb->tc_index & (p->indices - 1); in dsmark_dequeue()
346 u16 indices; in dsmark_init() local
366 indices = nla_get_u16(tb[TCA_DSMARK_INDICES]); in dsmark_init()
368 if (hweight32(indices) != 1) in dsmark_init()
374 if (indices <= DSMARK_EMBEDDED_SZ) in dsmark_init()
377 p->mv = kmalloc_array(indices, sizeof(*p->mv), GFP_KERNEL); in dsmark_init()
382 for (i = 0; i < indices; i++) { in dsmark_init()
[all …]
/OK3568_Linux_fs/external/rknpu2/examples/rknn_yolov5_android_apk_demo/app/src/main/cpp/
H A Dpost_process.cc82 std::vector<int> &indices) in quick_sort_indice_inverse() argument
90 key_index = indices[left]; in quick_sort_indice_inverse()
99 indices[low] = indices[high]; in quick_sort_indice_inverse()
105 indices[high] = indices[low]; in quick_sort_indice_inverse()
108 indices[low] = key_index; in quick_sort_indice_inverse()
109 quick_sort_indice_inverse(input, left, low - 1, indices); in quick_sort_indice_inverse()
110 quick_sort_indice_inverse(input, low + 1, right, indices); in quick_sort_indice_inverse()
/OK3568_Linux_fs/buildroot/dl/qt5location/git/src/3rdparty/mapbox-gl-native/src/mbgl/renderer/buckets/
H A Dhillshade_bucket.cpp40 indexBuffer = context.createIndexBuffer(std::move(indices)); in upload()
50 indices.clear(); in clear()
87 segments.emplace_back(vertices.vertexSize(), indices.indexSize()); in setMask()
105 indices.emplace_back(offset, offset + 1, offset + 2); in setMask()
106 indices.emplace_back(offset + 1, offset + 2, offset + 3); in setMask()
H A Draster_bucket.cpp29 indexBuffer = context.createIndexBuffer(std::move(indices)); in upload()
39 indices.clear(); in clear()
82 segments.emplace_back(vertices.vertexSize(), indices.indexSize()); in setMask()
100 indices.emplace_back(offset, offset + 1, offset + 2); in setMask()
101 indices.emplace_back(offset + 1, offset + 2, offset + 3); in setMask()
H A Ddebug_bucket.cpp27 gl::IndexVector<gl::Lines> indices; in DebugBucket() local
49 indices.emplace_back(vertices.vertexSize() - 2, in DebugBucket()
77 segments.emplace_back(0, 0, vertices.vertexSize(), indices.indexSize()); in DebugBucket()
80 indexBuffer = context.createIndexBuffer(std::move(indices)); in DebugBucket()
H A Dfill_bucket.cpp84 std::vector<uint32_t> indices = mapbox::earcut(polygon); in addFeature() local
86 std::size_t nIndicies = indices.size(); in addFeature()
98 triangles.emplace_back(triangleIndex + indices[i], in addFeature()
99 triangleIndex + indices[i + 1], in addFeature()
100 triangleIndex + indices[i + 2]); in addFeature()
H A Dfill_extrusion_bucket.cpp131 std::vector<uint32_t> indices = mapbox::earcut(polygon); in addFeature() local
133 std::size_t nIndices = indices.size(); in addFeature()
137 triangles.emplace_back(flatIndices[indices[i]], flatIndices[indices[i + 1]], in addFeature()
138 flatIndices[indices[i + 2]]); in addFeature()
/OK3568_Linux_fs/external/rknpu2/examples/rknn_yolov5_demo/src/
H A Dpostprocess.cc141 …uick_sort_indice_inverse(std::vector<float>& input, int left, int right, std::vector<int>& indices) in quick_sort_indice_inverse() argument
148 key_index = indices[left]; in quick_sort_indice_inverse()
155 indices[low] = indices[high]; in quick_sort_indice_inverse()
160 indices[high] = indices[low]; in quick_sort_indice_inverse()
163 indices[low] = key_index; in quick_sort_indice_inverse()
164 quick_sort_indice_inverse(input, left, low - 1, indices); in quick_sort_indice_inverse()
165 quick_sort_indice_inverse(input, low + 1, right, indices); in quick_sort_indice_inverse()
/OK3568_Linux_fs/external/rknpu2/examples/RV1106_RV1103/rknn_yolov5_demo/src/
H A Dpostprocess.cc146 std::vector<int> &indices) in quick_sort_indice_inverse() argument
154 key_index = indices[left]; in quick_sort_indice_inverse()
163 indices[low] = indices[high]; in quick_sort_indice_inverse()
169 indices[high] = indices[low]; in quick_sort_indice_inverse()
172 indices[low] = key_index; in quick_sort_indice_inverse()
173 quick_sort_indice_inverse(input, left, low - 1, indices); in quick_sort_indice_inverse()
174 quick_sort_indice_inverse(input, low + 1, right, indices); in quick_sort_indice_inverse()
/OK3568_Linux_fs/kernel/lib/
H A Dbuild_OID_registry45 my @indices = ();
66 push @indices, $total_length;
80 print C_FILE "\t[OID_", $names[$i], "] = ", $indices[$i], ",\n"
/OK3568_Linux_fs/kernel/tools/testing/radix-tree/
H A Didr-test.c155 int indices[] = {4, 7, 9, 15, 65, 128, 1000, 99999, 0}; in idr_get_next_test() local
157 for(i = 0; indices[i]; i++) { in idr_get_next_test()
158 struct item *item = item_create(indices[i], 0); in idr_get_next_test()
159 assert(idr_alloc(&idr, item, indices[i], indices[i+1], in idr_get_next_test()
160 GFP_KERNEL) == indices[i]); in idr_get_next_test()
163 for(i = 0, nextid = 0; indices[i]; i++) { in idr_get_next_test()
165 assert(nextid == indices[i]); in idr_get_next_test()
/OK3568_Linux_fs/kernel/arch/mips/kvm/
H A Dmips.c614 static int kvm_mips_copy_reg_indices(struct kvm_vcpu *vcpu, u64 __user *indices) in kvm_mips_copy_reg_indices() argument
619 if (copy_to_user(indices, kvm_mips_get_one_regs, in kvm_mips_copy_reg_indices()
622 indices += ARRAY_SIZE(kvm_mips_get_one_regs); in kvm_mips_copy_reg_indices()
625 if (copy_to_user(indices, kvm_mips_get_one_regs_fpu, in kvm_mips_copy_reg_indices()
628 indices += ARRAY_SIZE(kvm_mips_get_one_regs_fpu); in kvm_mips_copy_reg_indices()
632 if (copy_to_user(indices, &index, sizeof(index))) in kvm_mips_copy_reg_indices()
634 ++indices; in kvm_mips_copy_reg_indices()
641 if (copy_to_user(indices, &index, sizeof(index))) in kvm_mips_copy_reg_indices()
643 ++indices; in kvm_mips_copy_reg_indices()
648 if (copy_to_user(indices, kvm_mips_get_one_regs_msa, in kvm_mips_copy_reg_indices()
[all …]
/OK3568_Linux_fs/prebuilts/gcc/linux-x86/aarch64/gcc-arm-10.3-2021.07-x86_64-aarch64-none-linux-gnu/lib/gcc/aarch64-none-linux-gnu/10.3.1/plugin/include/
H A Dtree-data-ref.h117 struct indices struct
173 struct indices indices; member
181 #define DR_BASE_OBJECT(DR) (DR)->indices.base_object
182 #define DR_UNCONSTRAINED_BASE(DR) (DR)->indices.unconstrained_base
183 #define DR_ACCESS_FNS(DR) (DR)->indices.access_fns

12345678910