Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::Cnode Member List

This is the complete list of members for Aleph::Cnode, including all inherited members.

all(Operation &operation) constAleph::FunctionalMixin< Derived, Type >inline
all(Operation &&operation=Operation()) constAleph::FunctionalMixin< Derived, Type >inline
begin() noexceptAleph::Tree_Node< char >inline
begin() const noexceptAleph::Tree_Node< char >inline
cbegin() const noexceptAleph::Tree_Node< char >inline
cbegin() noexceptAleph::Tree_Node< char >inline
cend() const noexceptAleph::Tree_Node< char >inline
cend() noexceptAleph::Tree_Node< char >inline
childAleph::Tree_Node< char >private
child_to_Tree_Node(Dlink *link) noexceptAleph::Tree_Node< char >inlineprivatestatic
children() constAleph::Cnodeinline
children_it() constAleph::Tree_Node< char >inline
children_nodes() constAleph::Tree_Node< char >inline
chunk(size_t n) constAleph::FunctionalMixin< Derived, Type >inline
clone(const Tree_Node< char > *src, Tree_Node< char > *tgt)Aleph::Cnodeinlinestatic
clone() constAleph::Cnodeinline
Cnode(const char c) noexceptAleph::Cnodeinlineexplicit
const_iterator typedefAleph::Tree_Node< char >
contains(const std::string &word) const noexceptAleph::Cnodeinline
count() const noexceptAleph::Cnodeinline
count_if(Predicate pred) constAleph::FunctionalMixin< Derived, Type >inline
dataAleph::Tree_Node< char >private
destroy() noexceptAleph::Cnodeinline
drop(const size_t n) constAleph::FunctionalMixin< Derived, Type >inline
end() noexceptAleph::Tree_Node< char >inline
end() const noexceptAleph::Tree_Node< char >inline
enumerate() constAleph::FunctionalMixin< Derived, Type >inline
exists(Operation &operation) constAleph::FunctionalMixin< Derived, Type >inline
exists(Operation &&operation=Operation()) constAleph::FunctionalMixin< Derived, Type >inline
extract_word_from_stack(FixedStack< char > &stack)Aleph::Cnodeinlineprivatestatic
filter(Operation &operation) constAleph::FunctionalMixin< Derived, Type >inline
filter(Operation &&operation=Operation()) constAleph::FunctionalMixin< Derived, Type >inline
find_index(Predicate pred) constAleph::FunctionalMixin< Derived, Type >inline
first() constAleph::FunctionalMixin< Derived, Type >inline
first_or(const Type &default_val) constAleph::FunctionalMixin< Derived, Type >inline
flagsAleph::Tree_Node< char >private
fold(const Type &init, Operation &operation) constAleph::FunctionalMixin< Derived, Type >inline
fold(const Type &init, Operation &&operation=Operation()) constAleph::FunctionalMixin< Derived, Type >inline
fold_left(std::function< __Type(const __Type &, const Type &)> operation, const __Type &init) constAleph::FunctionalMixin< Derived, Type >inline
foldl(const __Type &init, std::function< __Type(const __Type &, const Type &)> operation) constAleph::FunctionalMixin< Derived, Type >inline
for_each(Operation &operation) const -> decltype(self())Aleph::FunctionalMixin< Derived, Type >inline
for_each(Operation &operation) -> decltype(self())Aleph::FunctionalMixin< Derived, Type >inline
for_each(Operation &&operation=Operation()) const -> decltype(self())Aleph::FunctionalMixin< Derived, Type >inline
for_each(Operation &&operation=Operation()) -> decltype(self())Aleph::FunctionalMixin< Derived, Type >inline
for_each_child(Operation &op) constAleph::Tree_Node< char >inline
for_each_child(Operation &&op=Operation()) constAleph::Tree_Node< char >inline
forall(Operation &operation) constAleph::FunctionalMixin< Derived, Type >inline
forall(Operation &&operation=Operation()) constAleph::FunctionalMixin< Derived, Type >inline
get_child(const size_t i) const noexceptAleph::Tree_Node< char >inline
get_child_list() noexceptAleph::Tree_Node< char >inline
get_data() noexceptAleph::Tree_Node< char >inline
get_data() const noexceptAleph::Tree_Node< char >inline
get_it() constAleph::Tree_Node< char >inline
get_key() noexceptAleph::Tree_Node< char >inline
get_key() const noexceptAleph::Tree_Node< char >inline
get_last_tree() constAleph::Tree_Node< char >inline
get_left_child() const noexceptAleph::Tree_Node< char >inline
get_left_sibling() const noexceptAleph::Tree_Node< char >inline
get_left_tree() const noexceptAleph::Tree_Node< char >inline
get_parent() const noexceptAleph::Tree_Node< char >inline
get_right_child() const noexceptAleph::Tree_Node< char >inline
get_right_sibling() const noexceptAleph::Tree_Node< char >inline
get_right_tree() const noexceptAleph::Tree_Node< char >inline
get_sibling_list() noexceptAleph::Tree_Node< char >inline
greater_child(const char c) const noexceptAleph::Cnodeinline
has_value(const Type &val) constAleph::FunctionalMixin< Derived, Type >inline
index_of(const Type &val) constAleph::FunctionalMixin< Derived, Type >inline
insert_child(Cnode *child)Aleph::Cnodeinline
insert_left_sibling(Tree_Node *p)Aleph::Tree_Node< char >inline
insert_leftmost_child(Tree_Node *p) noexceptAleph::Tree_Node< char >inline
insert_right_sibling(Tree_Node *p) noexceptAleph::Tree_Node< char >inline
insert_rightmost_child(Tree_Node *p) noexceptAleph::Tree_Node< char >inline
insert_tree_to_right(Tree_Node *tree)Aleph::Tree_Node< char >inline
insert_word(const std::string &word)Aleph::Cnodeinline
intersperse(const Type &sep) constAleph::FunctionalMixin< Derived, Type >inline
is_end_word() const noexceptAleph::Cnodeinline
is_leaf() const noexceptAleph::Tree_Node< char >inline
is_leftmost() const noexceptAleph::Tree_Node< char >inline
is_rightmost() const noexceptAleph::Tree_Node< char >inline
is_root() const noexceptAleph::Tree_Node< char >inline
Item_Type typedefAleph::Tree_Node< char >
iterator typedefAleph::Tree_Node< char >
join(Tree_Node *tree)Aleph::Tree_Node< char >inline
Aleph::FunctionalMixin::join(const StringType &sep=StringType{", "}) constAleph::FunctionalMixin< Derived, Type >inline
join_str(const std::string &sep=", ") constAleph::FunctionalMixin< Derived, Type >inline
key_type typedefAleph::Tree_Node< char >
last() constAleph::FunctionalMixin< Derived, Type >inline
last_or(const Type &default_val) constAleph::FunctionalMixin< Derived, Type >inline
left_link() const noexceptAleph::Tree_Node< char >inlineprivate
length() const noexceptAleph::FunctionalMixin< Derived, Type >inline
level_traverse(Op op)Aleph::Tree_Node< char >inline
level_traverse(Op op) constAleph::Tree_Node< char >inline
lower_link() const noexceptAleph::Tree_Node< char >inlineprivate
maps(Operation &operation) constAleph::FunctionalMixin< Derived, Type >inline
maps(Operation &&operation=Operation()) constAleph::FunctionalMixin< Derived, Type >inline
mark_end_word()Aleph::Cnodeinline
max() constAleph::FunctionalMixin< Derived, Type >inline
max_by(Compare cmp) constAleph::FunctionalMixin< Derived, Type >inline
min() constAleph::FunctionalMixin< Derived, Type >inline
min_by(Compare cmp) constAleph::FunctionalMixin< Derived, Type >inline
mutable_for_each(Operation &operation) -> decltype(self())Aleph::FunctionalMixin< Derived, Type >inline
mutable_for_each(Operation &&operation=Operation()) -> decltype(self())Aleph::FunctionalMixin< Derived, Type >inline
none(Predicate &pred) constAleph::FunctionalMixin< Derived, Type >inline
none(Predicate &&pred) constAleph::FunctionalMixin< Derived, Type >inline
partition(Operation &op) constAleph::FunctionalMixin< Derived, Type >inline
partition(Operation &&op=Operation()) constAleph::FunctionalMixin< Derived, Type >inline
pfilter(Operation &operation) constAleph::FunctionalMixin< Derived, Type >inline
pfilter(Operation &&operation=Operation()) constAleph::FunctionalMixin< Derived, Type >inline
preorder(const Tree_Node *root, Operation &op)Aleph::Tree_Node< char >inlineprivatestatic
print_words(const size_t max_word_length=2048) constAleph::Cnodeinline
product(const Type &init) constAleph::FunctionalMixin< Derived, Type >inline
rev() constAleph::FunctionalMixin< Derived, Type >inline
right_link() const noexceptAleph::Tree_Node< char >inlineprivate
search_child(const char c) const noexceptAleph::Cnodeinline
search_prefix(const char *prefix) const noexceptAleph::Cnodeinline
search_word(const char *word) const noexceptAleph::Cnodeinline
self() const noexceptAleph::FunctionalMixin< Derived, Type >inlineprotected
self() noexceptAleph::FunctionalMixin< Derived, Type >inlineprotected
set_is_leaf(bool value) noexceptAleph::Tree_Node< char >inline
set_is_leftmost(bool value) noexceptAleph::Tree_Node< char >inline
set_is_rightmost(bool value) noexceptAleph::Tree_Node< char >inline
set_is_root(bool value) noexceptAleph::Tree_Node< char >inline
siblingAleph::Tree_Node< char >private
sibling_to_Tree_Node(Dlink *link) noexceptAleph::Tree_Node< char >inlineprivatestatic
sliding(size_t size, size_t step=1) constAleph::FunctionalMixin< Derived, Type >inline
sum(const Type &init=Type{}) constAleph::FunctionalMixin< Derived, Type >inline
symbol() const noexceptAleph::Cnodeinline
take(const size_t n) constAleph::FunctionalMixin< Derived, Type >inline
to_dynlist() constAleph::FunctionalMixin< Derived, Type >inline
to_str() constAleph::Cnodeinline
to_vector() constAleph::FunctionalMixin< Derived, Type >inline
tpartition(Operation &op) constAleph::FunctionalMixin< Derived, Type >inline
tpartition(Operation &&op=Operation()) constAleph::FunctionalMixin< Derived, Type >inline
traverse(Operation op)Aleph::Tree_Node< char >inline
traverse(Operation op) constAleph::Tree_Node< char >inline
Tree_Node()=defaultAleph::Tree_Node< char >
Tree_Node(const char &d)Aleph::Tree_Node< char >inline
Tree_Node(char &&d)Aleph::Tree_Node< char >inline
trees() constAleph::Tree_Node< char >inline
unique() constAleph::FunctionalMixin< Derived, Type >inline
unique_by(EqPred eq) constAleph::FunctionalMixin< Derived, Type >inline
upper_link() const noexceptAleph::Tree_Node< char >inlineprivate
words(size_t max_word_length=2048) constAleph::Cnodeinline
words_impl(FixedStack< char > &stack, DynArray< std::string > &l) constAleph::Cnodeinlineprivate
words_with_prefix(const std::string &prefix, const size_t max_word_length=2048) constAleph::Cnodeinline
zip_with(const Other &other) constAleph::FunctionalMixin< Derived, Type >inline