Aleph::Tree_Node_Vtl< T > Member List

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

all(Operation &operation) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
all(Operation &&operation=Operation()) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
begin() noexcept	Aleph::Tree_Node< T >	inline
begin() const noexcept	Aleph::Tree_Node< T >	inline
cbegin() const noexcept	Aleph::Tree_Node< T >	inline
cbegin() noexcept	Aleph::Tree_Node< T >	inline
cend() const noexcept	Aleph::Tree_Node< T >	inline
cend() noexcept	Aleph::Tree_Node< T >	inline
child	Aleph::Tree_Node< T >	private
child_to_Tree_Node(Dlink *link) noexcept	Aleph::Tree_Node< T >	inlineprivatestatic
children() const	Aleph::Tree_Node< T >	inline
children_it() const	Aleph::Tree_Node< T >	inline
children_nodes() const	Aleph::Tree_Node< T >	inline
chunk(size_t n) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
const_iterator typedef	Aleph::Tree_Node< T >
count_if(Predicate pred) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
data	Aleph::Tree_Node< T >	private
drop(const size_t n) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
end() noexcept	Aleph::Tree_Node< T >	inline
end() const noexcept	Aleph::Tree_Node< T >	inline
enumerate() const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
exists(Operation &operation) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
exists(Operation &&operation=Operation()) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
filter(Operation &operation) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
filter(Operation &&operation=Operation()) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
find_index(Predicate pred) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
first() const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
first_or(const Tree_Node< T > * &default_val) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
flags	Aleph::Tree_Node< T >	private
fold(const Tree_Node< T > * &init, Operation &operation) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
fold(const Tree_Node< T > * &init, Operation &&operation=Operation()) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
fold_left(std::function< __Type(const __Type &, const Tree_Node< T > * &)> operation, const __Type &init) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
foldl(const __Type &init, std::function< __Type(const __Type &, const Tree_Node< T > * &)> operation) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
for_each(Operation &operation) const -> decltype(self())	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
for_each(Operation &operation) -> decltype(self())	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
for_each(Operation &&operation=Operation()) const -> decltype(self())	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
for_each(Operation &&operation=Operation()) -> decltype(self())	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
for_each_child(Operation &op) const	Aleph::Tree_Node< T >	inline
for_each_child(Operation &&op=Operation()) const	Aleph::Tree_Node< T >	inline
forall(Operation &operation) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
forall(Operation &&operation=Operation()) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
get_child(const size_t i) const noexcept	Aleph::Tree_Node< T >	inline
get_child_list() noexcept	Aleph::Tree_Node< T >	inline
get_data() noexcept	Aleph::Tree_Node< T >	inline
get_data() const noexcept	Aleph::Tree_Node< T >	inline
get_it() const	Aleph::Tree_Node< T >	inline
get_key() noexcept	Aleph::Tree_Node< T >	inline
get_key() const noexcept	Aleph::Tree_Node< T >	inline
get_last_tree() const	Aleph::Tree_Node< T >	inline
get_left_child() const noexcept	Aleph::Tree_Node< T >	inline
get_left_sibling() const noexcept	Aleph::Tree_Node< T >	inline
get_left_tree() const noexcept	Aleph::Tree_Node< T >	inline
get_parent() const noexcept	Aleph::Tree_Node< T >	inline
get_right_child() const noexcept	Aleph::Tree_Node< T >	inline
get_right_sibling() const noexcept	Aleph::Tree_Node< T >	inline
get_right_tree() const noexcept	Aleph::Tree_Node< T >	inline
get_sibling_list() noexcept	Aleph::Tree_Node< T >	inline
has_value(const Tree_Node< T > * &val) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
index_of(const Tree_Node< T > * &val) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
insert_left_sibling(Tree_Node *p)	Aleph::Tree_Node< T >	inline
insert_leftmost_child(Tree_Node *p) noexcept	Aleph::Tree_Node< T >	inline
insert_right_sibling(Tree_Node *p) noexcept	Aleph::Tree_Node< T >	inline
insert_rightmost_child(Tree_Node *p) noexcept	Aleph::Tree_Node< T >	inline
insert_tree_to_right(Tree_Node *tree)	Aleph::Tree_Node< T >	inline
intersperse(const Tree_Node< T > * &sep) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
is_leaf() const noexcept	Aleph::Tree_Node< T >	inline
is_leftmost() const noexcept	Aleph::Tree_Node< T >	inline
is_rightmost() const noexcept	Aleph::Tree_Node< T >	inline
is_root() const noexcept	Aleph::Tree_Node< T >	inline
Item_Type typedef	Aleph::Tree_Node< T >
iterator typedef	Aleph::Tree_Node< T >
join(Tree_Node *tree)	Aleph::Tree_Node< T >	inline
FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >::join(const StringType &sep=StringType{", "}) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
join_str(const std::string &sep=", ") const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
key_type typedef	Aleph::Tree_Node< T >
last() const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
last_or(const Tree_Node< T > * &default_val) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
left_link() const noexcept	Aleph::Tree_Node< T >	inlineprivate
length() const noexcept	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
level_traverse(Op op)	Aleph::Tree_Node< T >	inline
level_traverse(Op op) const	Aleph::Tree_Node< T >	inline
lower_link() const noexcept	Aleph::Tree_Node< T >	inlineprivate
maps(Operation &operation) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
maps(Operation &&operation=Operation()) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
max() const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
max_by(Compare cmp) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
min() const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
min_by(Compare cmp) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
mutable_for_each(Operation &operation) -> decltype(self())	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
mutable_for_each(Operation &&operation=Operation()) -> decltype(self())	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
none(Predicate &pred) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
none(Predicate &&pred) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
partition(Operation &op) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
partition(Operation &&op=Operation()) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
pfilter(Operation &operation) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
pfilter(Operation &&operation=Operation()) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
preorder(const Tree_Node *root, Operation &op)	Aleph::Tree_Node< T >	inlineprivatestatic
product(const Tree_Node< T > * &init) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
rev() const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
right_link() const noexcept	Aleph::Tree_Node< T >	inlineprivate
self() const noexcept	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inlineprotected
self() noexcept	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inlineprotected
set_is_leaf(bool value) noexcept	Aleph::Tree_Node< T >	inline
set_is_leftmost(bool value) noexcept	Aleph::Tree_Node< T >	inline
set_is_rightmost(bool value) noexcept	Aleph::Tree_Node< T >	inline
set_is_root(bool value) noexcept	Aleph::Tree_Node< T >	inline
sibling	Aleph::Tree_Node< T >	private
sibling_to_Tree_Node(Dlink *link) noexcept	Aleph::Tree_Node< T >	inlineprivatestatic
sliding(size_t size, size_t step=1) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
sum(const Tree_Node< T > * &init=Tree_Node< T > *{}) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
take(const size_t n) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
to_dynlist() const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
to_vector() const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
tpartition(Operation &op) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
tpartition(Operation &&op=Operation()) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
traverse(Operation op)	Aleph::Tree_Node< T >	inline
traverse(Operation op) const	Aleph::Tree_Node< T >	inline
Tree_Node()=default	Aleph::Tree_Node< T >
Tree_Node(const T &d)	Aleph::Tree_Node< T >	inline
Tree_Node(T &&d)	Aleph::Tree_Node< T >	inline
trees() const	Aleph::Tree_Node< T >	inline
unique() const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
unique_by(EqPred eq) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
upper_link() const noexcept	Aleph::Tree_Node< T >	inlineprivate
zip_with(const Other &other) const	Aleph::FunctionalMixin< Tree_Node< T >, Tree_Node< T > * >	inline
~Tree_Node_Vtl()=default	Aleph::Tree_Node_Vtl< T >	virtual