bbox_contains_span bbox_contains_stbox bbox_contains_tbox bbox_expand_span bbox_expand_stbox bbox_expand_tbox bbox_overlaps_span bbox_overlaps_stbox bbox_overlaps_tbox box_area box_largest_axis ensure_rtree_temporal_compatible get_axis_length get_axis_span get_axis_stbox get_axis_tbox inner_consistent leaf_consistent node_box_calculate node_choose node_choose_least_enlargement node_free node_insert node_make node_move_box_at_index_into node_qsort node_search node_sort_axis node_split node_swap rtree_create rtree_create_bigintspan rtree_create_datespan rtree_create_floatspan rtree_create_intspan rtree_create_stbox rtree_create_tbox rtree_create_tstzspan rtree_free rtree_insert rtree_insert_temporal rtree_search rtree_search_temporal unioned_area

inner_consistent() static bool inner_consistent ( const RTree *  rtree, const void *  key, const void *  query, RTreeSearchOp  op  ) static Return true if an inner node is consistent with the search query. This is a looser check used for pruning subtrees during traversal. Parameters [in] rtree Pointer to the RTree structure [in] key The bounding box of the inner node [in] query The bounding box that serves as query [in] op The search operation