13   PetscCount greater_handle, less_equal_handle; // Handle (index) of the child nodes of the tree
18 …PetscCount indices_handle, coords_handle; // Index into the indices or coordinates array for the p…
26   PetscCount root_handle;
28   PetscCount       num_coords, num_leaves, num_stems, num_bucket_indices;
32   PetscCount      *bucket_indices;
91 static inline int PetscKDTreeSortFunc(PetscCount left, PetscCount right, PetscKDTree tree, uint8_t …  in PetscKDTreeSortFunc()
109 …return PetscKDTreeSortFunc(*(PetscCount *)l, *(PetscCount *)r, kd_ctx->tree, kd_ctx->initial_axis);  in PetscKDTreeTimSort()
112 …VerifySortedIndices(PetscKDTree tree, PetscCount sorted_indices[], PetscCount temp[], PetscCount s…  in PetscKDTreeVerifySortedIndices()
114   PetscCount num_coords = tree->num_coords, range_size = end - start, location;  in PetscKDTreeVerifySortedIndices()
123     for (PetscCount i = start; i < end; i++) {  in PetscKDTreeVerifySortedIndices()
138 …kd_build, PetscCount sorted_indices[], PetscCount temp[], PetscCount start, PetscCount end, PetscI…  in PetscKDTreeBuildStemAndLeaves()
148     PetscCount *bucket_indices;  in PetscKDTreeBuildStemAndLeaves()
164       for (PetscCount i = 0; i < leaf->count; i++) {  in PetscKDTreeBuildStemAndLeaves()
170     PetscCount num_coords = tree->num_coords;  in PetscKDTreeBuildStemAndLeaves()
173     PetscCount median     = start + PetscCeilInt64(end - start, 2) - 1, lower;  in PetscKDTreeBuildStemAndLeaves()
174     PetscCount median_idx = sorted_indices[median], medianp1_idx = sorted_indices[median + 1];  in PetscKDTreeBuildStemAndLeaves()
187       PetscCount upper = median;  in PetscKDTreeBuildStemAndLeaves()
189       for (PetscCount i = start; i < end; i++) {  in PetscKDTreeBuildStemAndLeaves()
236 PetscErrorCode PetscKDTreeCreate(PetscCount num_coords, PetscInt dim, const PetscReal coords[], Pet…  in PetscKDTreeCreate()
239   PetscCount *sorted_indices, *temp;  in PetscKDTreeCreate()
275     for (PetscCount i = 0; i < num_coords; i++) sorted_indices[num_coords * j + i] = i;  in PetscKDTreeCreate()
290   PetscCall(PetscSegBufferCreate(sizeof(PetscCount), num_coords, &kd_build->bucket_indices));  in PetscKDTreeCreate()
324 …DTreeQueryLeaf(PetscKDTree tree, KDLeaf leaf, const PetscReal point[], PetscCount *index, PetscRea…  in PetscKDTreeQueryLeaf()
332     PetscCount point_index = tree->bucket_indices[leaf.indices_handle + i];  in PetscKDTreeQueryLeaf()
342 …eaf_CopyCoords(PetscKDTree tree, KDLeaf leaf, const PetscReal point[], PetscCount *index, PetscRea…  in PetscKDTreeQueryLeaf_CopyCoords()
363 …nst PetscReal point[], PetscCount node_handle, char is_node_leaf, PetscReal offset[], PetscReal rd…  in PetscKDTreeQuery_Recurse()
370     PetscCount point_index;  in PetscKDTreeQuery_Recurse()
427 …tsNearestNeighbor(PetscKDTree tree, PetscCount num_points, const PetscReal points[], PetscReal tol…  in PetscKDTreeQueryPointsNearestNeighbor()
442   for (PetscCount p = 0; p < num_points; p++) {  in PetscKDTreeQueryPointsNearestNeighbor()
478   for (PetscCount i = 0; i < tree->num_stems; i++) {  in PetscKDTreeView()
487   for (PetscCount i = 0; i < tree->num_leaves; i++) {  in PetscKDTreeView()
493       PetscCount bucket_index = tree->bucket_indices[leaf.indices_handle + j];  in PetscKDTreeView()