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_search() void node_search ( const RTree *  rtree, const RTreeNode *  node, const void *  query, int **  ids, int *  count  ) Searches recursively a node looking for hits with a query. Parameters [in] rtree Pointer to the RTree structure [in] node The node to be searched [in] query The bounding box that serves as query [in] ids The array with the list of answers [in] count Total of elements found