after4D before4D compareDoubles contain4D distance_tbox_nodebox get_quadrant4D left4D overAfter4D overBefore4D overlap4D overLeft4D overRight4D right4D SortedTbox Tbox_kdtree_choose Tbox_kdtree_inner_consistent Tbox_kdtree_picksplit tbox_level_cmp Tbox_quadtree_choose Tbox_quadtree_inner_consistent Tbox_quadtree_picksplit Tbox_spgist_config tbox_spgist_inner_consistent Tbox_spgist_leaf_consistent tbox_tmax_cmp tbox_tmin_cmp tbox_xmax_cmp tbox_xmin_cmp tboxnode_copy tboxnode_init tboxnode_kdtree_next tboxnode_quadtree_next Tnumber_spgist_compress tnumber_spgist_get_tbox

tboxnode_kdtree_next() static void tboxnode_kdtree_next ( const TboxNode *  nodebox, const TBox *  centroid, uint8  node, int  level, TboxNode *  next_nodebox  ) static Compute the next traversal value for a k-d tree given the bounding box and the centroid of the current node, the half number (0 or 1) and the level.