add_answer box_area box_unioned_area get_axis_length get_axis_stbox is_power_of_two node_box_calculate node_choose node_choose_least_enlargement node_free node_insert node_move_box_at_index_into node_new node_qsort node_search node_sort_axis node_split node_swap rtree_create rtree_create_stbox rtree_free rtree_insert rtree_search rtree_set_dims rtree_set_functions stbox_largest_axis

node_qsort() static void node_qsort ( const RTree *  rtree, RTreeNode *  node, int  index, bool  upper, int  s, int  e  ) static Sorts STBoxes within an RTree node using the QuickSort algorithm. This function recursively sorts the STBoxes within a specified range in an RTree node along a particular axis. It uses the QuickSort algorithm to order the STBoxes 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 RTreeNode structure containing the STBoxes to be sorted. [in] index The axis index along which to sort the STBoxes. [in] upper Boolean flag 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.