add_answer 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 get_axis_length get_axis_span get_axis_stbox get_axis_tbox is_power_of_two 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_search unioned_area

node_qsort() static void node_qsort ( const RTree *  rtree, RTreeNode *  node, int  index, bool  upper, int  s, int  e  ) static Sort the bounding boxes within an RTree node using the QuickSort algorithm. The function recursively sorts the bounding boxes within a given range in an RTree node along a particular axis. It uses the QuickSort algorithm to order the bounding boxes based on their axis values, either upper or lower, as provided by the get_axis function in the RTree structure. Parameters [in] rtree Pointer to the RTree structure which provides the function for retrieving axis values [in,out] node Pointer to the node containing the bounding boxes to be sorted [in] index The axis index along which to sort the bounding boxes [in] upper A Boolean indicating whether to sort by upper or lower axis value [in] s The starting index of the range to be sorted in the node->boxes array [in] e The ending index (exclusive) of the range to be sorted in the node->boxes array