169     KDStem    *stem;  in PetscKDTreeBuildStemAndLeaves()  local
177     PetscCall(PetscSegBufferGet(kd_build->stems, 1, &stem));  in PetscKDTreeBuildStemAndLeaves()
178     PetscCall(PetscMemzero(stem, sizeof(KDStem)));  in PetscKDTreeBuildStemAndLeaves()
181     stem->axis = axis;  in PetscKDTreeBuildStemAndLeaves()
183 …stem->split = (tree->coords[tree->dim * median_idx + axis] + tree->coords[tree->dim * medianp1_idx…  in PetscKDTreeBuildStemAndLeaves()
202 … sorted_indices, temp, start, lower + 1, depth + 1, &is_less_equal_leaf, &stem->less_equal_handle)…  in PetscKDTreeBuildStemAndLeaves()
203     if (is_less_equal_leaf) PetscCall(PetscBTSet(&stem->are_handles_leaves, LESS_EQUAL_BIT));  in PetscKDTreeBuildStemAndLeaves()
204 …_build, sorted_indices, temp, lower + 1, end, depth + 1, &is_greater_leaf, &stem->greater_handle));  in PetscKDTreeBuildStemAndLeaves()
205     if (is_greater_leaf) PetscCall(PetscBTSet(&stem->are_handles_leaves, GREATER_BIT));  in PetscKDTreeBuildStemAndLeaves()
381   KDStem    stem       = tree->stems[node_handle];  in PetscKDTreeQuery_Recurse()  local
382   PetscReal old_offset = offset[stem.axis], new_offset = point[stem.axis] - stem.split;  in PetscKDTreeQuery_Recurse()
384 …PetscCall(PetscKDTreeQuery_Recurse(tree, point, stem.less_equal_handle, PetscBTLookup(&stem.are_ha…  in PetscKDTreeQuery_Recurse()
387       offset[stem.axis] = new_offset;  in PetscKDTreeQuery_Recurse()
388 …PetscCall(PetscKDTreeQuery_Recurse(tree, point, stem.greater_handle, PetscBTLookup(&stem.are_handl…  in PetscKDTreeQuery_Recurse()
389       offset[stem.axis] = old_offset;  in PetscKDTreeQuery_Recurse()
392 …PetscCall(PetscKDTreeQuery_Recurse(tree, point, stem.greater_handle, PetscBTLookup(&stem.are_handl…  in PetscKDTreeQuery_Recurse()
395       offset[stem.axis] = new_offset;  in PetscKDTreeQuery_Recurse()
396 …PetscCall(PetscKDTreeQuery_Recurse(tree, point, stem.less_equal_handle, PetscBTLookup(&stem.are_ha…  in PetscKDTreeQuery_Recurse()
397       offset[stem.axis] = old_offset;  in PetscKDTreeQuery_Recurse()
479     KDStem stem = tree->stems[i];  in PetscKDTreeView()  local
480 …sser_Equal_%s=%" PetscCount_FMT "\n", i, (PetscInt)stem.axis, (double)stem.split, PetscBTLookup(&s…  in PetscKDTreeView()
481 …stem.greater_handle, PetscBTLookup(&stem.are_handles_leaves, LESS_EQUAL_BIT) ? "Leaf" : "Stem", st…  in PetscKDTreeView()