, including all inherited members.
| add_child(RStarTreeNode< Y > *child_node, CubitBoolean recalc_b_box) | RStarTreeNode< Y > | |
| adjust_tree(RStarTreeNode< Y > *l, RStarTreeNode< Y > *ll, RStarTreeNode< Y > *root_node, RStarTreeNode< Y > *&new_root, int *overflow_flags, int levels) | RStarTreeNode< Y > | [private] |
| bounding_box() | RStarTreeNode< Y > | [inline] |
| calc_enlargement(RStarTreeNode< Y > *current, RStarTreeNode< Y > *add_to) | RStarTreeNode< Y > | [private] |
| calc_enlargement(CubitBox ¤t, CubitBox &add_to) | RStarTreeNode< Y > | [private] |
| calc_overlap(RStarTreeNode< Y > *current, RStarTreeNode< Y > *add_to) | RStarTreeNode< Y > | [private] |
| can_add() | RStarTreeNode< Y > | |
| choose_sub_tree(RStarTreeNode< Y > *n, RStarTreeNode< Y > *e) | RStarTreeNode< Y > | [private] |
| condense_tree(RStarTreeNode< Y > *l, RStarTreeNode< Y > *root, RStarTreeNode< Y > *&new_root) | RStarTreeNode< Y > | [private] |
| dist_is_box() | RStarTreeNode< Y > | [inline] |
| distIsBox | RStarTreeNode< Y > | [private] |
| find_leaf(Y e, CubitBox &e_box, RStarTreeNode< Y > *t, RStarTreeNode< Y > *&l) | RStarTreeNode< Y > | [private] |
| flush(CubitBox &new_box) | RStarTreeNode< Y > | |
| get_child(int i) | RStarTreeNode< Y > | [inline] |
| get_data() | RStarTreeNode< Y > | [inline] |
| get_dist() | RStarTreeNode< Y > | [inline] |
| get_leaf_level() | RStarTreeNode< Y > | [inline] |
| get_parent() | RStarTreeNode< Y > | [inline] |
| insert(RStarTreeNode< Y > *e, RStarTreeNode< Y > *&new_root, int *overflow_flags, int levels) | RStarTreeNode< Y > | |
| is_data() | RStarTreeNode< Y > | [inline] |
| is_leaf() | RStarTreeNode< Y > | [inline] |
| margin(CubitBox &bounding_box) | RStarTreeNode< Y > | [private] |
| markedFlag | RStarTreeNode< Y > | [private] |
| maxChildren | RStarTreeNode< Y > | [private] |
| minChildren | RStarTreeNode< Y > | [private] |
| myBoundingBox | RStarTreeNode< Y > | [private] |
| myChildrenNodes | RStarTreeNode< Y > | [private] |
| myData | RStarTreeNode< Y > | [private] |
| myDist | RStarTreeNode< Y > | [private] |
| myId | RStarTreeNode< Y > | [private] |
| myLevel | RStarTreeNode< Y > | [private] |
| myParent | RStarTreeNode< Y > | [private] |
| nextChildIndex | RStarTreeNode< Y > | [private] |
| num_children() | RStarTreeNode< Y > | [inline] |
| overflow_treatment(RStarTreeNode< Y > *l, RStarTreeNode< Y > *e, RStarTreeNode< Y > *&ll, RStarTreeNode< Y > *root, RStarTreeNode< Y > *&new_root, int *overflow_flags, int levels) | RStarTreeNode< Y > | [private] |
| recalc_b_box() | RStarTreeNode< Y > | |
| reinsert(RStarTreeNode< Y > *l, RStarTreeNode< Y > *e, RStarTreeNode< Y > *root, RStarTreeNode< Y > *&new_root, int *overflow_flags, int levels) | RStarTreeNode< Y > | [private] |
| remove(Y e, RStarTreeNode< Y > *&new_root, CubitBoolean &delete_root) | RStarTreeNode< Y > | |
| remove_child(RStarTreeNode< Y > *child) | RStarTreeNode< Y > | |
| RStarTreeNode(Y data, double tol, int max_children, int min_children) | RStarTreeNode< Y > | |
| RStarTreeNode(CubitBox &bounding_box, int max_children, int min_children) | RStarTreeNode< Y > | |
| set_dist(double dis) | RStarTreeNode< Y > | [inline] |
| set_dist_is_box(int val) | RStarTreeNode< Y > | [inline] |
| set_leaf_level(int r_type) | RStarTreeNode< Y > | [inline] |
| set_parent(RStarTreeNode< Y > *parent) | RStarTreeNode< Y > | [inline] |
| sort_center_distance(RStarTreeNode< Y > *&n_1, RStarTreeNode< Y > *&n_2) | RStarTreeNode< Y > | [private, static] |
| sort_high_x(RStarTreeNode< Y > *&n_1, RStarTreeNode< Y > *&n_2) | RStarTreeNode< Y > | [private, static] |
| sort_high_y(RStarTreeNode< Y > *&n_1, RStarTreeNode< Y > *&n_2) | RStarTreeNode< Y > | [private, static] |
| sort_high_z(RStarTreeNode< Y > *&n_1, RStarTreeNode< Y > *&n_2) | RStarTreeNode< Y > | [private, static] |
| sort_low_x(RStarTreeNode< Y > *&n_1, RStarTreeNode< Y > *&n_2) | RStarTreeNode< Y > | [private, static] |
| sort_low_y(RStarTreeNode< Y > *&n_1, RStarTreeNode< Y > *&n_2) | RStarTreeNode< Y > | [private, static] |
| sort_low_z(RStarTreeNode< Y > *&n_1, RStarTreeNode< Y > *&n_2) | RStarTreeNode< Y > | [private, static] |
| space_left() | RStarTreeNode< Y > | |
| split_node(RStarTreeNode< Y > *l, RStarTreeNode< Y > *e, RStarTreeNode< Y > *&ll) | RStarTreeNode< Y > | [private] |
| super_box(DLIList< RStarTreeNode< Y > * > &node_list) | RStarTreeNode< Y > | [private] |
| validate_tree(int print) | RStarTreeNode< Y > | |
| volume(CubitBox &box) | RStarTreeNode< Y > | [inline, private] |
| volume(RStarTreeNode< Y > *curr) | RStarTreeNode< Y > | [inline, private] |
| ~RStarTreeNode() | RStarTreeNode< Y > | |
1.7.6.1 
