Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::Rope< Char, LeafSize > Member List

This is the complete list of members for Aleph::Rope< Char, LeafSize >, including all inherited members.

at(const size_t pos) constAleph::Rope< Char, LeafSize >inline
build_balanced_from_leaves(const Array< NodePtr > &leaves, const size_t lo, const size_t hi)Aleph::Rope< Char, LeafSize >inlineprivatestatic
build_from_view(const View v)Aleph::Rope< Char, LeafSize >inlineprivatestatic
char_at(const Node *node, size_t pos) noexceptAleph::Rope< Char, LeafSize >inlineprivatestatic
collect_leaf_pointers(const Node *node, Array< const Node * > &out)Aleph::Rope< Char, LeafSize >inlineprivatestatic
collect_leaves(const NodePtr &node, Array< NodePtr > &out)Aleph::Rope< Char, LeafSize >inlineprivatestatic
concat(const Rope &other) constAleph::Rope< Char, LeafSize >inline
concat_nodes(NodePtr left, NodePtr right)Aleph::Rope< Char, LeafSize >inlineprivatestatic
erase(const size_t pos, const size_t len) constAleph::Rope< Char, LeafSize >inline
flatten() constAleph::Rope< Char, LeafSize >inline
flatten_into(const Node *node, Array< Char > &out)Aleph::Rope< Char, LeafSize >inlineprivatestatic
insert(const size_t pos, const Rope &other) constAleph::Rope< Char, LeafSize >inline
is_balanced(const Node *node) noexceptAleph::Rope< Char, LeafSize >inlineprivatestatic
is_empty() const noexceptAleph::Rope< Char, LeafSize >inline
make_internal(NodePtr left, NodePtr right)Aleph::Rope< Char, LeafSize >inlineprivatestatic
make_internal_node(NodePtr left, NodePtr right)Aleph::Rope< Char, LeafSize >inlineprivatestatic
make_leaf(SmallVector< Char, LeafSize > data)Aleph::Rope< Char, LeafSize >inlineprivatestatic
maybe_rebalance(NodePtr node)Aleph::Rope< Char, LeafSize >inlineprivatestatic
NodePtr typedefAleph::Rope< Char, LeafSize >private
operator=(const Rope &other)=defaultAleph::Rope< Char, LeafSize >
operator=(Rope &&other) noexcept=defaultAleph::Rope< Char, LeafSize >
operator==(const Rope &other) constAleph::Rope< Char, LeafSize >inline
root_Aleph::Rope< Char, LeafSize >private
Rope(NodePtr root) noexceptAleph::Rope< Char, LeafSize >inlineexplicitprivate
Rope() noexcept=defaultAleph::Rope< Char, LeafSize >
Rope(const View v)Aleph::Rope< Char, LeafSize >inlineexplicit
Rope(const Rope &other)=defaultAleph::Rope< Char, LeafSize >
Rope(Rope &&other) noexcept=defaultAleph::Rope< Char, LeafSize >
size() const noexceptAleph::Rope< Char, LeafSize >inline
slice(const NodePtr &node, size_t pos, size_t len)Aleph::Rope< Char, LeafSize >inlineprivatestatic
string_append_into(const Node *node, std::basic_string< Char > &out)Aleph::Rope< Char, LeafSize >inlineprivatestatic
substr(const size_t pos, const size_t len) constAleph::Rope< Char, LeafSize >inline
to_string() constAleph::Rope< Char, LeafSize >inline
try_absorb_left(const NodePtr &node, const SmallVector< Char, LeafSize > &extra)Aleph::Rope< Char, LeafSize >inlineprivatestatic
try_absorb_right(const NodePtr &node, const SmallVector< Char, LeafSize > &extra)Aleph::Rope< Char, LeafSize >inlineprivatestatic
verify() const noexceptAleph::Rope< Char, LeafSize >inline
verify_rec(const Node *node) noexceptAleph::Rope< Char, LeafSize >inlineprivatestatic
View typedefAleph::Rope< Char, LeafSize >
~Rope()=defaultAleph::Rope< Char, LeafSize >