after2D before2D Bigintspan_spgist_config contain2D distance_span_nodespan Floatspan_spgist_config get_quadrant2D Intspan_spgist_config left2D overAfter2D overBefore2D overlap2D overLeft2D overRight2D Period_spgist_config right2D Set_spgist_compress SortedSpan Span_kdtree_choose Span_kdtree_inner_consistent Span_kdtree_picksplit span_level_cmp span_lower_qsort_cmp Span_quadtree_choose Span_quadtree_inner_consistent Span_quadtree_picksplit span_spgist_get_span Span_spgist_inner_consistent Span_spgist_leaf_consistent span_upper_qsort_cmp spannode_copy spannode_init spannode_kdtree_next spannode_quadtree_next Spanset_spgist_compress

spannode_kdtree_next() static void spannode_kdtree_next ( const SpanNode *  nodebox, const Span *  centroid, uint8  node, int  level, SpanNode *  next_nodespan  ) 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. For example, given the bounding box of the root node (level 0) and the centroid as follows nodebox = (-infinity, -infinity)(infinity, infinity) centroid = (2001-06-19 09:07:00, 2001-06-19 09:13:00] the halves are as follows 0 = (-infinity, -infinity)(2001-06-19 09:07:00+02, infinity) 1 = [2001-06-19 09:07:00+02, -infinity)(infinity, infinity)