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

stbox_xmin_cmp() static int stbox_xmin_cmp ( const STBox *  box1, const STBox *  box2  ) static Determine which half a 4D-mapped temporal box falls into, relative to the centroid and the level number. Halves are numbered 0 and 1, and depending on the value of level number modulo 4 is even or odd, the halves will be as follows: ----+---- 0 | 1 ----+---- or --------- 1 --------- 0 --------- where the lower bound of the splitting dimension is the horizontal axis and the upper bound is the vertical axis. Boxes whose lower/upper bound of the splitting dimension is equal to the centroid bound (including their inclusive flag) may get classified into either node depending on where they happen to fall in the sorted list. This is okay as long as the inner_consistent function descends into both sides for such cases. This is better than the alternative of trying to have an exact boundary, because it keeps the tree balanced even when we have many instances of the same box value. In this way, we should never trigger the allTheSame logic. Comparator of temporal boxes based on their xmin value