- Generated by
1.9.8
|
Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
|
This is the complete list of members for Aleph::PersistentHashMap< Key, T, Cmp >, including all inherited members.
| append_entry(Array< std::pair< Key, T > > &entries, const Key &key, const T *value, T *movable_value) | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivatestatic |
| bit(const size_t pos) noexcept | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivatestatic |
| bitpos(const size_t hash, const size_t shift) noexcept | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivatestatic |
| BITS_PER_LEVEL | Aleph::PersistentHashMap< Key, T, Cmp > | privatestatic |
| BRANCHING_FACTOR | Aleph::PersistentHashMap< Key, T, Cmp > | privatestatic |
| cmp_ | Aleph::PersistentHashMap< Key, T, Cmp > | private |
| collect_items(const NodePtr &node, Array< std::pair< Key, T > > &out) | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivatestatic |
| collect_keys(const NodePtr &node, Array< Key > &out) | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivatestatic |
| collision_keys_are_unique(const CollisionNode &node) const | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivate |
| contains(const Key &key) const | Aleph::PersistentHashMap< Key, T, Cmp > | inline |
| erase(const Key &key) const | Aleph::PersistentHashMap< Key, T, Cmp > | inline |
| erase_impl(const NodePtr &node, const Key &key, const size_t hash, const size_t shift, bool &removed) const | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivate |
| find(const Key &key) const | Aleph::PersistentHashMap< Key, T, Cmp > | inline |
| find_impl(const NodePtr &node, const Key &key, const size_t hash, const size_t shift) const | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivate |
| hash_fct_ | Aleph::PersistentHashMap< Key, T, Cmp > | private |
| Hash_Fct_Ptr typedef | Aleph::PersistentHashMap< Key, T, Cmp > | |
| hashes_match_slot(const NodePtr &node, const size_t shift, const size_t pos) const | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivate |
| index(const std::uint32_t bitmap, const std::uint32_t bit_value) noexcept | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivatestatic |
| insert(const Key &key, const T &value) const | Aleph::PersistentHashMap< Key, T, Cmp > | inline |
| insert(const Key &key, T &&value) const | Aleph::PersistentHashMap< Key, T, Cmp > | inline |
| insert_impl(const NodePtr &node, const Key &key, const T *value, T *movable_value, const size_t hash, const size_t shift, const bool replace, bool &added, bool &changed) const | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivate |
| insert_or_assign(const Key &key, const T &value) const | Aleph::PersistentHashMap< Key, T, Cmp > | inline |
| insert_or_assign(const Key &key, T &&value) const | Aleph::PersistentHashMap< Key, T, Cmp > | inline |
| is_empty() const noexcept | Aleph::PersistentHashMap< Key, T, Cmp > | inline |
| items() const | Aleph::PersistentHashMap< Key, T, Cmp > | inline |
| keys() const | Aleph::PersistentHashMap< Key, T, Cmp > | inline |
| LEVEL_MASK | Aleph::PersistentHashMap< Key, T, Cmp > | privatestatic |
| make_leaf(const Key &key, const T &value, const size_t hash) | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivatestatic |
| make_leaf(const Key &key, T &&value, const size_t hash) | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivatestatic |
| make_leaf_from_value(const Key &key, const T *value, T *movable_value, const size_t hash) | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivatestatic |
| merge_leaves(const NodePtr &n1, const NodePtr &n2, const size_t shift) const | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivate |
| NodePtr typedef | Aleph::PersistentHashMap< Key, T, Cmp > | private |
| NodeType enum name | Aleph::PersistentHashMap< Key, T, Cmp > | private |
| PersistentHashMap(NodePtr root, const Hash_Fct_Ptr hash_fct, Cmp cmp, const size_t size) | Aleph::PersistentHashMap< Key, T, Cmp > | inlineexplicitprivate |
| PersistentHashMap(const Hash_Fct_Ptr hash_fct=dft_hash_ptr_fct< Key >, const Cmp &cmp=Cmp()) | Aleph::PersistentHashMap< Key, T, Cmp > | inlineexplicit |
| root_ | Aleph::PersistentHashMap< Key, T, Cmp > | private |
| size() const noexcept | Aleph::PersistentHashMap< Key, T, Cmp > | inline |
| size_ | Aleph::PersistentHashMap< Key, T, Cmp > | private |
| size_after_insert(const bool added) const | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivate |
| verify() const | Aleph::PersistentHashMap< Key, T, Cmp > | inline |
| verify_rec(const NodePtr &node, const size_t shift, size_t &count) const | Aleph::PersistentHashMap< Key, T, Cmp > | inlineprivate |
1.9.8