Dash Core Source Documentation (0.16.0.1)
Find detailed information regarding the Dash Core source code.
#include <champ.hpp>
|
| champ (node_t *r, size_t sz) |
|
| champ (const champ &other) |
|
| champ (champ &&other) |
|
champ & | operator= (const champ &other) |
|
champ & | operator= (champ &&other) |
|
| ~champ () |
|
void | inc () const |
|
void | dec () const |
|
template<typename Fn > |
void | for_each_chunk (Fn &&fn) const |
|
template<typename Fn > |
void | for_each_chunk_traversal (node_t *node, count_t depth, Fn &&fn) const |
|
template<typename Project , typename Default , typename K > |
decltype(auto) | get (const K &k) const |
|
std::pair< node_t *, bool > | do_add (node_t *node, T v, hash_t hash, shift_t shift) const |
|
champ | add (T v) const |
|
template<typename Project , typename Default , typename Combine , typename K , typename Fn > |
std::pair< node_t *, bool > | do_update (node_t *node, K &&k, Fn &&fn, hash_t hash, shift_t shift) const |
|
template<typename Project , typename Default , typename Combine , typename K , typename Fn > |
champ | update (const K &k, Fn &&fn) const |
|
template<typename K > |
sub_result | do_sub (node_t *node, const K &k, hash_t hash, shift_t shift) const |
|
template<typename K > |
champ | sub (const K &k) const |
|
template<typename Eq = Equal> |
bool | equals (const champ &other) const |
|
|
static constexpr auto | bits = B |
|
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
struct immer::detail::hamts::champ< T, Hash, Equal, MemoryPolicy, B >
Definition at line 25 of file champ.hpp.
◆ bitmap_t
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
◆ node_t
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
◆ champ() [1/3]
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
◆ champ() [2/3]
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
◆ champ() [3/3]
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
◆ ~champ()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
◆ add()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
◆ dec()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
◆ do_add()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
◆ do_sub()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
template<typename K >
◆ do_update()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
template<typename Project , typename Default , typename Combine , typename K , typename Fn >
◆ empty()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
◆ equals()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
template<typename Eq = Equal>
◆ equals_collisions()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
template<typename Eq >
◆ equals_tree()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
template<typename Eq >
◆ equals_values()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
template<typename Eq >
◆ for_each_chunk()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
template<typename Fn >
◆ for_each_chunk_traversal()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
template<typename Fn >
◆ get()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
template<typename Project , typename Default , typename K >
◆ inc()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
◆ operator=() [1/2]
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
◆ operator=() [2/2]
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
◆ sub()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
template<typename K >
◆ update()
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
template<typename Project , typename Default , typename Combine , typename K , typename Fn >
◆ swap
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
void swap |
( |
champ< T, Hash, Equal, MemoryPolicy, B > & |
x, |
|
|
champ< T, Hash, Equal, MemoryPolicy, B > & |
y |
|
) |
| |
|
friend |
◆ bits
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
◆ root
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
Definition at line 32 of file champ.hpp.
Referenced by immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::add(), immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::champ(), immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::dec(), immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::do_sub(), immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::equals(), immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::for_each_chunk(), immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::get(), immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::inc(), immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::sub(), and immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::update().
◆ size
template<typename T, typename Hash, typename Equal, typename MemoryPolicy, bits_t B>
Definition at line 35 of file champ.hpp.
Referenced by immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::add(), immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::champ(), immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::equals(), immer::set< T, Hash, Equal, MemoryPolicy, B >::size(), immer::map< uint256, CDeterministicMNCPtr >::size(), immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::sub(), and immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::update().
The documentation for this struct was generated from the following file: