112 …fySortedIndices(PetscKDTree tree, PetscCount sorted_indices[], PetscCount temp[], PetscCount start…  in PetscKDTreeVerifySortedIndices()  argument
118   PetscCall(PetscArraycpy(temp, &sorted_indices[0 * num_coords + start], range_size));  in PetscKDTreeVerifySortedIndices()
119   PetscCall(PetscSortCount(range_size, temp));  in PetscKDTreeVerifySortedIndices()
120   PetscCall(PetscSortedCheckDupsCount(range_size, temp, &has_duplicates));  in PetscKDTreeVerifySortedIndices()
124       PetscCall(PetscFindCount(sorted_indices[d * num_coords + i], range_size, temp, &location));  in PetscKDTreeVerifySortedIndices()
138 …emAndLeaves(KDTreeBuild kd_build, PetscCount sorted_indices[], PetscCount temp[], PetscCount start…  in PetscKDTreeBuildStemAndLeaves()  argument
145 …if (kd_build->debug_build) PetscCall(PetscKDTreeVerifySortedIndices(tree, sorted_indices, temp, st…  in PetscKDTreeBuildStemAndLeaves()
184     PetscCall(PetscArraycpy(temp, &sorted_indices[0 * num_coords + start], end - start));  in PetscKDTreeBuildStemAndLeaves()
200 …PetscCall(PetscArraycpy(&sorted_indices[(tree->dim - 1) * num_coords + start], temp, end - start));  in PetscKDTreeBuildStemAndLeaves()
202 …PetscCall(PetscKDTreeBuildStemAndLeaves(kd_build, sorted_indices, temp, start, lower + 1, depth + …  in PetscKDTreeBuildStemAndLeaves()
204 …PetscCall(PetscKDTreeBuildStemAndLeaves(kd_build, sorted_indices, temp, lower + 1, end, depth + 1,…  in PetscKDTreeBuildStemAndLeaves()
239   PetscCount *sorted_indices, *temp;  in PetscKDTreeCreate()  local
271   PetscCall(PetscMalloc2(num_coords * dim, &sorted_indices, num_coords, &temp));  in PetscKDTreeCreate()
293 …PetscCall(PetscKDTreeBuildStemAndLeaves(kd_build, sorted_indices, temp, 0, num_coords, 0, &tree->i…  in PetscKDTreeCreate()
311   PetscCall(PetscFree2(sorted_indices, temp));  in PetscKDTreeCreate()