#include <champ_map.h>
|
| SubNodes () |
|
| SubNodes (std::vector< Node< K, V, H > > &&ns) |
|
| SubNodes (std::vector< Node< K, V, H > > &&ns, Bitmap nm, Bitmap dm) |
|
SmallIndex | compressed_idx (SmallIndex idx) const |
|
const V * | getp (SmallIndex depth, Hash hash, const K &k) const |
|
size_t | put_mut (SmallIndex depth, Hash hash, const K &k, const V &v) |
|
std::pair< std::shared_ptr< SubNodes< K, V, H > >, size_t > | put (SmallIndex depth, Hash hash, const K &k, const V &v) const |
|
size_t | remove_mut (SmallIndex depth, Hash hash, const K &k) |
|
std::pair< std::shared_ptr< SubNodes< K, V, H > >, size_t > | remove (SmallIndex depth, Hash hash, const K &k) const |
|
template<class F > |
bool | foreach (SmallIndex depth, F &&f) const |
|
◆ SubNodes() [1/3]
template<class K , class V , class H >
◆ SubNodes() [2/3]
template<class K , class V , class H >
◆ SubNodes() [3/3]
template<class K , class V , class H >
◆ compressed_idx()
template<class K , class V , class H >
◆ foreach()
template<class K , class V , class H >
template<class F >
◆ getp()
template<class K , class V , class H >
◆ put()
template<class K , class V , class H >
◆ put_mut()
template<class K , class V , class H >
◆ remove()
template<class K , class V , class H >
◆ remove_mut()
template<class K , class V , class H >
◆ data_map
template<class K , class V , class H >
◆ node_map
template<class K , class V , class H >
◆ nodes
template<class K , class V , class H >
The documentation for this struct was generated from the following file: