, including all inherited members.
| add_child(RTreeNode< Y > *child_node, CubitBoolean recalc_b_box) | RTreeNode< Y > | |
| adjust_tree(RTreeNode< Y > *l, RTreeNode< Y > *ll, RTreeNode< Y > *root_node, RTreeNode< Y > *&new_root) | RTreeNode< Y > | [private] |
| bounding_box() | RTreeNode< Y > | [inline] |
| calc_enlargement(RTreeNode< Y > *current, RTreeNode< Y > *add_to) | RTreeNode< Y > | [private] |
| calc_enlargement(CubitBox ¤t, CubitBox &add_to) | RTreeNode< Y > | [private] |
| can_add() | RTreeNode< Y > | |
| choose_leaf(RTreeNode< Y > *n, RTreeNode< Y > *e) | RTreeNode< Y > | [private] |
| condense_tree(RTreeNode< Y > *l, RTreeNode< Y > *root, RTreeNode< Y > *&new_root) | RTreeNode< Y > | [private] |
| dist_is_box() | RTreeNode< Y > | [inline] |
| distIsBox | RTreeNode< Y > | [private] |
| find_leaf(Y e, CubitBox &e_box, RTreeNode< Y > *t, RTreeNode< Y > *&l) | RTreeNode< Y > | [private] |
| flush(CubitBox &new_box) | RTreeNode< Y > | |
| get_child(int i) | RTreeNode< Y > | [inline] |
| get_data() | RTreeNode< Y > | [inline] |
| get_dist() | RTreeNode< Y > | [inline] |
| get_leaf_level() | RTreeNode< Y > | [inline] |
| get_parent() | RTreeNode< Y > | [inline] |
| insert(RTreeNode< Y > *e, RTreeNode< Y > *&new_root) | RTreeNode< Y > | |
| is_data() | RTreeNode< Y > | [inline] |
| is_leaf() | RTreeNode< Y > | [inline] |
| markedFlag | RTreeNode< Y > | [private] |
| maxChildren | RTreeNode< Y > | [private] |
| minChildren | RTreeNode< Y > | [private] |
| myBoundingBox | RTreeNode< Y > | [private] |
| myChildrenNodes | RTreeNode< Y > | [private] |
| myData | RTreeNode< Y > | [private] |
| myDist | RTreeNode< Y > | [private] |
| myLevel | RTreeNode< Y > | [private] |
| myParent | RTreeNode< Y > | [private] |
| nextChildIndex | RTreeNode< Y > | [private] |
| num_children() | RTreeNode< Y > | [inline] |
| pick_next(DLIList< RTreeNode< Y > * > &remaining_nodes, RTreeNode< Y > *group_1, RTreeNode< Y > *group_2, RTreeNode< Y > *&next, CubitBoolean &add_to_group_1) | RTreeNode< Y > | [private] |
| pick_seeds(RTreeNode< Y > **input_list, const int input_list_size, RTreeNode< Y > *&seed_1, RTreeNode< Y > *&seed_2) | RTreeNode< Y > | [private] |
| quadratic_split_node(RTreeNode< Y > *l, RTreeNode< Y > *e, RTreeNode< Y > *&ll) | RTreeNode< Y > | [private] |
| recalc_b_box() | RTreeNode< Y > | |
| remove(Y e, RTreeNode< Y > *&new_root, CubitBoolean &delete_root) | RTreeNode< Y > | |
| remove_child(RTreeNode< Y > *child) | RTreeNode< Y > | |
| RTreeNode(Y data, double tol, int max_children, int min_children) | RTreeNode< Y > | |
| RTreeNode(CubitBox &bounding_box, int max_children, int min_children) | RTreeNode< Y > | |
| set_dist(double dis) | RTreeNode< Y > | [inline] |
| set_dist_is_box(int val) | RTreeNode< Y > | [inline] |
| set_leaf_level(int r_type) | RTreeNode< Y > | [inline] |
| set_parent(RTreeNode< Y > *parent) | RTreeNode< Y > | [inline] |
| space_left() | RTreeNode< Y > | |
| volume(CubitBox &box) | RTreeNode< Y > | [inline, private] |
| volume(RTreeNode< Y > *curr) | RTreeNode< Y > | [inline, private] |
| ~RTreeNode() | RTreeNode< Y > | |
1.7.6.1 
