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_insert() static void node_insert ( RTree *  rtree, void *  node_bounding_box, RTreeNode *  node, void *  new_box, int  id, bool *  split  ) static Inserts a new bounding box into an RTree node and handles node splitting if necessary. If the node is a leaf and already contains the maximum number of items (MAXITEMS), the function sets the split flag to true to indicate that the node needs to be split. For non-leaf nodes, the function determines the appropriate child node for insertion and recursively inserts the bounding box. If splitting occurs, the function handles the split and updates the parent node's bounding boxes. Parameters [in] rtree Pointer to the RTree structure that provides axis value retrieval and node splitting functions [in] node_bounding_box Pointer to the bounding bounding box of all the bounding boxes in node [in] node Pointer to the node where the bounding box is being inserted [in] new_box Pointer to the bounding box to be inserted [in] id Identifier associated with the new bounding box (used only for leaf nodes) [out] split Pointer to a boolean flag that indicates if the node was split during insertion