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

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

branch_bitsAleph::PersistentVector< T >privatestatic
branch_factorAleph::PersistentVector< T >privatestatic
branch_maskAleph::PersistentVector< T >privatestatic
branching_factor() noexceptAleph::PersistentVector< T >inlinestatic
capacity_for_shift(const size_t shift) noexceptAleph::PersistentVector< T >inlineprivatestatic
child_index(const size_t index, const size_t shift) noexceptAleph::PersistentVector< T >inlineprivatestatic
clear_rec(const NodePtr &node, const size_t shift, const size_t index)Aleph::PersistentVector< T >inlineprivatestatic
count_values_rec(const NodePtr &node, const size_t shift, bool &ok) noexceptAleph::PersistentVector< T >inlineprivatestatic
get(const size_t index) constAleph::PersistentVector< T >inline
get_ptr(const NodePtr &root, size_t shift, const size_t index) noexceptAleph::PersistentVector< T >inlineprivatestatic
internal_has_children(const std::shared_ptr< Node > &node) noexceptAleph::PersistentVector< T >inlineprivatestatic
is_empty() const noexceptAleph::PersistentVector< T >inline
leaf_has_values(const std::shared_ptr< Node > &node) noexceptAleph::PersistentVector< T >inlineprivatestatic
NodePtr typedefAleph::PersistentVector< T >private
operator[](const size_t index) constAleph::PersistentVector< T >inline
PersistentVector(NodePtr root, const size_t n, const size_t shift) noexceptAleph::PersistentVector< T >inlineexplicitprivate
PersistentVector() noexcept=defaultAleph::PersistentVector< T >
pop_back() constAleph::PersistentVector< T >inline
push_back(const T &value) constAleph::PersistentVector< T >inline
push_back(T &&value) constAleph::PersistentVector< T >inline
push_back(ValuePtr value) constAleph::PersistentVector< T >inlineprivate
root_Aleph::PersistentVector< T >private
set(const size_t index, const T &value) constAleph::PersistentVector< T >inline
set(const size_t index, T &&value) constAleph::PersistentVector< T >inline
set(const size_t index, ValuePtr value) constAleph::PersistentVector< T >inlineprivate
set_rec(const NodePtr &node, const size_t shift, const size_t index, ValuePtr value)Aleph::PersistentVector< T >inlineprivatestatic
shift_Aleph::PersistentVector< T >private
size() const noexceptAleph::PersistentVector< T >inline
size_Aleph::PersistentVector< T >private
to_array() constAleph::PersistentVector< T >inline
ValuePtr typedefAleph::PersistentVector< T >private
verify() const noexceptAleph::PersistentVector< T >inline