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_swap() static void node_swap ( const RTree *  rtree, RTreeNode *  node, int  i, int  j  ) static Swaps two bounding boxes and their associated data within an RTree node. The function exchanges the positions of two bounding boxes within a single RTree node. If the node is a leaf, it also swaps the associated IDs. For internal nodes, it swaps the pointers to child nodes. The function is useful for reordering elements within a node. Parameters [in] rtree Pointer to the RTree structure [in,out] node Pointer to the node containing the bounding boxes and associated data. [in] i The index of the first bounding box to be swapped. [in] j The index of the second bounding box to be swapped.