after4D before4D compareFloat8 compareInt4 compareTimestampTz contain4D distance_tbox_nodebox getQuadrant4D 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_quadtree_next() static void tboxnode_quadtree_next ( const TboxNode *  nodebox, const TBox *  centroid, uint8  quadrant, TboxNode *  next_nodebox  ) static Calculate the next traversal value. All centroids are bounded by TboxNode, but SP-GiST only keeps boxes. When we are traversing the tree, we must calculate TboxNode, using centroid and quadrant. Continuing with the example at the top of this file | | | 1110 | 1111 | -----+----- | 1100 | 1101 | | -------------+------------- | centroid | | | | where centroid is as follows c1 = TBOXFLOAT XT([3, 5],[2001-01-03, 2001-01-05]) centroid = TBOXFLOAT XT([3, 5],[2001-01-03, 2001-01-05]) The next traversal value of quadrant ´1111´ is left = TBOXFLOAT XT([3, +inf),[2001-01-03, +inf)) right = TBOXFLOAT XT([5, +inf),[2001-01-05, +inf)) Also, the traversal value of quadrant ´1100´ is left = TBOXFLOAT XT([3, +inf),(-inf, 2001-01-03)) right = TBOXFLOAT XT([5, +inf),(-inf, 2001-01-05))