Aleph::Gen_B_Tree< Key, Compare, MinDegree > Member List

This is the complete list of members for Aleph::Gen_B_Tree< Key, Compare, MinDegree >, including all inherited members.

append_copy_range(Array< T > &dst, const Array< T > &src, const size_t from)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivatestatic
append_move_range(Array< T > &dst, Array< T > &src, const size_t from)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivatestatic
borrow_from_next(Node *parent, const size_t idx)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
borrow_from_prev(Node *parent, const size_t idx)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
clear() noexcept	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
clone_node(const Node *node) const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
cmp_	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	private
collect_keys(const Node *node, Array< Key > &out) const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
contains(const Key &key) const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
contains_in(const Node *node, const Key &key) const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
empty() const noexcept	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
ensure_child_has_extra(Node *parent, const size_t idx)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
equals(const Key &lhs, const Key &rhs) const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
erase_at(Array< T > &array, const size_t idx)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivatestatic
Gen_B_Tree(const Compare &cmp=Compare())	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineexplicit
Gen_B_Tree(It first, It last, const Compare &cmp=Compare())	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
Gen_B_Tree(std::initializer_list< Key > init, const Compare &cmp=Compare())	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
Gen_B_Tree(const Gen_B_Tree &other)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
Gen_B_Tree(Gen_B_Tree &&other)=default	Aleph::Gen_B_Tree< Key, Compare, MinDegree >
get_compare() const noexcept	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
height() const noexcept	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
height_of(const Node *node) const noexcept	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
insert(const Key &key)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
insert(Key &&key)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
insert_at(Array< T > &array, const size_t idx, U &&value)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivatestatic
insert_nonfull(Node *node, const Key &key)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
insert_range(It first, It last)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
is_empty() const noexcept	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
key_comp() const noexcept	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
key_type typedef	Aleph::Gen_B_Tree< Key, Compare, MinDegree >
keys() const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
lower_bound(const Key &key) const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
lower_bound_index(const Array< Key > &keys, const Key &key) const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
max_in(const Node *node) const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
max_key() const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
MaxKeys	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	privatestatic
merge_children(Node *parent, const size_t idx)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
min_in(const Node *node) const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
min_key() const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
MinKeys	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	privatestatic
Node typedef	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	private
operator=(const Gen_B_Tree &other)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
operator=(Gen_B_Tree &&other)=default	Aleph::Gen_B_Tree< Key, Compare, MinDegree >
remove(const Key &key)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
remove_from(Node *node, const Key &key)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
root_	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	private
search(const Key &key) const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
size() const noexcept	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
size_	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	private
split_child(Node *parent, const size_t idx)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
truncate(Array< T > &array, const size_t new_size)	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivatestatic
upper_bound(const Key &key) const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
upper_bound_index(const Array< Key > &keys, const Key &key) const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate
verify() const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inline
verify_node(const Node *node, const std::optional< Key > &min_key, const std::optional< Key > &max_key, const size_t depth, size_t &leaf_depth, size_t &counted) const	Aleph::Gen_B_Tree< Key, Compare, MinDegree >	inlineprivate