| adopt(const const_iterator &other_subtree, const self_t &insert_before) const | Subtree< NodeItem, LeafItem > | inline |
| base_t typedef (defined in Subtree< NodeItem, LeafItem >) | Subtree< NodeItem, LeafItem > | protected |
| begin() const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| clear() const | Subtree< NodeItem, LeafItem > | inline |
| const_item_iterator typedef | SubtreeBase< NodeItem, LeafItem, false > | |
| const_iterator typedef | SubtreeBase< NodeItem, LeafItem, false > | |
| const_reference typedef | SubtreeBase< NodeItem, LeafItem, false > | |
| difference_type typedef | SubtreeBase< NodeItem, LeafItem, false > | |
| end() const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| erase(const item_iterator &item, bool *success=nullptr) const | Subtree< NodeItem, LeafItem > | inline |
| erase(const self_t &child, bool *success=nullptr) const | Subtree< NodeItem, LeafItem > | inline |
| find_parent(const const_item_iterator &i) const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| find_parent(const const_item_iterator &i) const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| flatten() const | Subtree< NodeItem, LeafItem > | inline |
| global_begin() const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| global_end() const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| insert_child_node(const self_t &insert_before, Args &&... args) const | Subtree< NodeItem, LeafItem > | inline |
| insert_child_node(const NodeItem &obj) const | Subtree< NodeItem, LeafItem > | inline |
| insert_child_nodes(const self_t &insert_before, NodeItemIterator i_begin, const NodeItemIterator &i_end) const | Subtree< NodeItem, LeafItem > | inline |
| insert_child_nodes(const NodeItemIterator &i_begin, const NodeItemIterator &i_end) const | Subtree< NodeItem, LeafItem > | inline |
| insert_item(const item_iterator &insert_before, Args &&... args) const | Subtree< NodeItem, LeafItem > | inline |
| insert_item(const LeafItem &item) const | Subtree< NodeItem, LeafItem > | inline |
| insert_items(const item_iterator &insert_before, const LeafItemIterator begin_item, const LeafItemIterator &end_item, index_t *new_item_count=nullptr) const | Subtree< NodeItem, LeafItem > | inline |
| insert_items(const LeafItemIterator &begin_item, const LeafItemIterator &end_item) const | Subtree< NodeItem, LeafItem > | inline |
| is_root() const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| item_count() const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| item_iterator typedef | SubtreeBase< NodeItem, LeafItem, false > | |
| items_begin() const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| items_end() const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| iterator typedef | SubtreeBase< NodeItem, LeafItem, false > | |
| iterator_category typedef | SubtreeBase< NodeItem, LeafItem, false > | |
| node_count() const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| operator!=(const self_t &other) const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| operator*() const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| operator+() | SubtreeBase< NodeItem, LeafItem, false > | inline |
| operator++() | SubtreeBase< NodeItem, LeafItem, false > | inline |
| operator++(int) | SubtreeBase< NodeItem, LeafItem, false > | inline |
| operator-() | SubtreeBase< NodeItem, LeafItem, false > | inline |
| operator--() | SubtreeBase< NodeItem, LeafItem, false > | inline |
| operator--(int) | SubtreeBase< NodeItem, LeafItem, false > | inline |
| operator->() const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| operator==(const self_t &other) const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| parent() const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| pointer typedef | SubtreeBase< NodeItem, LeafItem, false > | |
| query(const Key &key, BoundingFn bound, TestFn test=visit_all_nodes< Key >) const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| recalculate_references() const (defined in Subtree< NodeItem, LeafItem >) | Subtree< NodeItem, LeafItem > | inlineprotected |
| reference typedef | SubtreeBase< NodeItem, LeafItem, false > | |
| self_t typedef (defined in Subtree< NodeItem, LeafItem >) | Subtree< NodeItem, LeafItem > | |
| split(Func compare, P pivot, Args &&... args) const | Subtree< NodeItem, LeafItem > | inline |
| Subtree(const base_t &other) (defined in Subtree< NodeItem, LeafItem >) | Subtree< NodeItem, LeafItem > | inlineprotected |
| Subtree(const NodeRef &root, StorageRef storage) (defined in Subtree< NodeItem, LeafItem >) | Subtree< NodeItem, LeafItem > | inlineprotected |
| Subtree(const Subtree< NodeItem, LeafItem > &other)=default | Subtree< NodeItem, LeafItem > | |
| Subtree() (defined in Subtree< NodeItem, LeafItem >) | Subtree< NodeItem, LeafItem > | inline |
| subtree_begin() const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| subtree_end() const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| SubtreeBase< NodeItem, LeafItem, false > (defined in Subtree< NodeItem, LeafItem >) | Subtree< NodeItem, LeafItem > | friend |
| tree() const | SubtreeBase< NodeItem, LeafItem, false > | inline |
| Tree< NodeItem, LeafItem > (defined in Subtree< NodeItem, LeafItem >) | Subtree< NodeItem, LeafItem > | friend |
| tree_t typedef | SubtreeBase< NodeItem, LeafItem, false > | |
| value_type typedef | SubtreeBase< NodeItem, LeafItem, false > | |
| visit_all_leaf_nodes(const self_t &s, const Key &k) | SubtreeBase< NodeItem, LeafItem, false > | inlinestatic |
| visit_all_nodes(const self_t &s, const Key &k) | SubtreeBase< NodeItem, LeafItem, false > | inlinestatic |
