| BaseTree typedef (defined in ygg::IntervalTree< Node, NodeTraits, Options, Tag >) | ygg::IntervalTree< Node, NodeTraits, Options, Tag > | |
| begin() const noexcept | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| begin() noexcept (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| BinarySearchTree() noexcept | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| BinarySearchTree(MyClass &&other) noexcept | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| cbegin() const noexcept | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| cend() const noexcept | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| clear() noexcept | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| cmp (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| const_iterator typedef (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| crbegin() const noexcept | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| crend() const noexcept | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| dump_to_dot(const std::string &filename) const (defined in ygg::IntervalTree< Node, NodeTraits, Options, Tag >) | ygg::IntervalTree< Node, NodeTraits, Options, Tag > | |
| dump_to_dot_base(const std::string &filename, NodeNameGetter name_getter) const (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| empty() const noexcept | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| end() const noexcept | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| end() noexcept (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| ENodeTraits typedef (defined in ygg::IntervalTree< Node, NodeTraits, Options, Tag >) | ygg::IntervalTree< Node, NodeTraits, Options, Tag > | |
| erase(const Comparable &c) CMP_NOEXCEPT(c) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| erase(const iterator< reverse > &it) CMP_NOEXCEPT(*it) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| find(const Comparable &query) const CMP_NOEXCEPT(query) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| find(const Comparable &query) CMP_NOEXCEPT(query) (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| find(const Comparable &query, Callbacks *cbs) (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| fixup_after_delete(Node *parent, bool deleted_left) noexcept (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| fixup_after_insert(Node *node) noexcept (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| fixup_maxima(Node &lowest) (defined in ygg::IntervalTree< Node, NodeTraits, Options, Tag >) | ygg::IntervalTree< Node, NodeTraits, Options, Tag > | |
| get_first_equal(Node *n) noexcept (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | inlineprivate |
| get_largest() const noexcept (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| get_left_child(Node *n) noexcept (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | privatestatic |
| get_parent(Node *n) noexcept (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | privatestatic |
| get_right_child(Node *n) noexcept (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | privatestatic |
| get_root() const noexcept (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| get_smallest() const noexcept (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| get_uncle(Node *node) const noexcept (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| INB typedef (defined in ygg::IntervalTree< Node, NodeTraits, Options, Tag >) | ygg::IntervalTree< Node, NodeTraits, Options, Tag > | |
| insert(Node &node) CMP_NOEXCEPT(node) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| insert(Node &node, Node &hint) CMP_NOEXCEPT(node) (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| insert(Node &node, iterator< false > hint) CMP_NOEXCEPT(node) (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| insert_leaf_base(Node &node, Node *start) CMP_NOEXCEPT(node) (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| interval_upper_bound(const Comparable &query_range) const (defined in ygg::IntervalTree< Node, NodeTraits, Options, Tag >) | ygg::IntervalTree< Node, NodeTraits, Options, Tag > | |
| IntervalTree() (defined in ygg::IntervalTree< Node, NodeTraits, Options, Tag >) | ygg::IntervalTree< Node, NodeTraits, Options, Tag > | |
| iterator typedef (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| iterator_to(const Node &node) const noexcept | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| iterator_to(Node &node) noexcept (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| Key typedef (defined in ygg::IntervalTree< Node, NodeTraits, Options, Tag >) | ygg::IntervalTree< Node, NodeTraits, Options, Tag > | |
| lower_bound(const Comparable &query) const CMP_NOEXCEPT(query) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| lower_bound(const Comparable &query) CMP_NOEXCEPT(query) (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| MyClass typedef (defined in ygg::IntervalTree< Node, NodeTraits, Options, Tag >) | ygg::IntervalTree< Node, NodeTraits, Options, Tag > | |
| NB typedef (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| operator=(MyClass &&other) noexcept | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| output_node_base(const Node *node, std::ofstream &out, NodeNameGetter name_getter) const (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| Path typedef (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| query(const Comparable &q) const | ygg::IntervalTree< Node, NodeTraits, Options, Tag > | |
| rbegin() const noexcept | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| rbegin() noexcept (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| RBTree() noexcept | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| RBTree(MyClass &&other) noexcept | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| remove(Node &node) CMP_NOEXCEPT(node) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| remove_to_leaf(Node &node) CMP_NOEXCEPT(node) (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| rend() const noexcept | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| rend() noexcept (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| replace_node(Node *to_be_replaced, Node *replace_with) noexcept (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| root (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| rotate_left(Node *parent) noexcept (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| rotate_right(Node *parent) noexcept (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| s (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| size() const noexcept | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| swap_neighbors(Node *parent, Node *child) noexcept (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| swap_nodes(Node *n1, Node *n2, bool swap_colors=true) noexcept (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| swap_unrelated_nodes(Node *n1, Node *n2) noexcept (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| TB typedef (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| upper_bound(const Comparable &query) const CMP_NOEXCEPT(query) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| upper_bound(const Comparable &query) CMP_NOEXCEPT(query) (defined in ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > >) | ygg::bst::BinarySearchTree< Node, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits >, rbtree_internal::ColorParentStorage< Node, Options::compress_color > > | private |
| verify_black_paths(const Node *node, unsigned int *path_length) const (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| verify_black_root() const (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
| verify_integrity() const (defined in ygg::IntervalTree< Node, NodeTraits, Options, Tag >) | ygg::IntervalTree< Node, NodeTraits, Options, Tag > | |
| verify_red_black(const Node *node) const (defined in ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > >) | ygg::RBTree< Node, intervaltree_internal::ExtendedNodeTraits< Node, ITreeNodeBase< Node, NodeTraits, Options, Tag >, NodeTraits >, Options, Tag, intervaltree_internal::IntervalCompare< Node, NodeTraits > > | private |
