above8D after8D back8D before8D below8D contain8D containKD distance_stbox_nodebox front8D getOctant8D left8D overAbove8D overAfter8D overBack8D overBefore8D overBelow8D overFront8D overlap8D overlapKD overLeft8D overRight8D right8D SortedSTbox Stbox_kdtree_choose Stbox_kdtree_inner_consistent Stbox_kdtree_picksplit stbox_level_cmp Stbox_quadtree_choose Stbox_quadtree_inner_consistent Stbox_quadtree_picksplit Stbox_spgist_config stbox_spgist_inner_consistent Stbox_spgist_leaf_consistent stbox_tmax_cmp stbox_tmin_cmp stbox_xmax_cmp stbox_xmin_cmp stbox_ymax_cmp stbox_ymin_cmp stbox_zmax_cmp stbox_zmin_cmp stboxnode_copy stboxnode_init stboxnode_kdtree_next stboxnode_quadtree_next Tpoint_spgist_compress tpoint_spgist_get_stbox

stboxnode_kdtree_next() static void stboxnode_kdtree_next ( const STboxNode *  nodebox, const STBox *  centroid, uint8  node, int  level, STboxNode *  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.