Aleph-w  1.9
General library for algorithms and data structures
Aleph::Tree_Node< T > Member List

This is the complete list of members for Aleph::Tree_Node< T >, including all inherited members.

children() constAleph::Tree_Node< T >inline
children_it() const (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >inline
children_nodes() constAleph::Tree_Node< T >inline
for_each_child(Operation &op) constAleph::Tree_Node< T >inline
for_each_child(Operation &&op=Operation()) const (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >inline
Functional_Methods(Tree_Node *) (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >
get_child(const size_t i) const noexceptAleph::Tree_Node< T >inline
get_child_list() noexcept (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >inline
get_data() noexceptAleph::Tree_Node< T >inline
get_data() const noexcept (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >inline
get_it() const (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >inline
get_key() noexceptAleph::Tree_Node< T >inline
get_key() const noexcept (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >inline
get_last_tree() constAleph::Tree_Node< T >inline
get_left_child() const noexceptAleph::Tree_Node< T >inline
get_left_sibling() const noexceptAleph::Tree_Node< T >inline
get_left_tree() const noexceptAleph::Tree_Node< T >inline
get_parent() const noexceptAleph::Tree_Node< T >inline
get_right_child() const noexceptAleph::Tree_Node< T >inline
get_right_sibling() const noexceptAleph::Tree_Node< T >inline
get_right_tree() const noexceptAleph::Tree_Node< T >inline
get_sibling_list() noexcept (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >inline
insert_left_sibling(Tree_Node *p)Aleph::Tree_Node< T >inline
insert_leftmost_child(Tree_Node *p) noexceptAleph::Tree_Node< T >inline
insert_right_sibling(Tree_Node *p) noexceptAleph::Tree_Node< T >inline
insert_rightmost_child(Tree_Node *p) noexceptAleph::Tree_Node< T >inline
insert_tree_to_right(Tree_Node *tree)Aleph::Tree_Node< T >inline
is_leaf() const noexceptAleph::Tree_Node< T >inline
is_leftmost() const noexceptAleph::Tree_Node< T >inline
is_rightmost() const noexceptAleph::Tree_Node< T >inline
is_root() const noexceptAleph::Tree_Node< T >inline
Item_Type typedef (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >
join(Tree_Node *tree)Aleph::Tree_Node< T >inline
key_type typedefAleph::Tree_Node< T >
level_traverse(Op op) (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >inline
level_traverse(Op op) const (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >inline
set_is_leaf(bool value) noexcept (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >inline
set_is_leftmost(bool value) noexcept (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >inline
set_is_rightmost(bool value) noexcept (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >inline
set_is_root(bool value) noexcept (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >inline
STL_ALEPH_ITERATOR(Tree_Node) (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >
traverse(Operation op)Aleph::Tree_Node< T >inline
traverse(Operation op) const (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >inline
Tree_Node() noexceptAleph::Tree_Node< T >inline
Tree_Node(const T &__data) noexcept(std::is_nothrow_copy_constructible< T >::value)Aleph::Tree_Node< T >inline
Tree_Node(T &&__data) noexcept(std::is_nothrow_move_constructible< T >::value) (defined in Aleph::Tree_Node< T >)Aleph::Tree_Node< T >inline
trees() constAleph::Tree_Node< T >inline

Leandro Rabindranath León