Dash Core Source Documentation (0.16.0.1)
Find detailed information regarding the Dash Core source code.
|
template<bits_t B, typename T = count_t> |
constexpr T | branches = T{1u} << B |
|
template<bits_t B, typename T = size_t> |
constexpr T | mask = branches<B, T> - 1u |
|
template<bits_t B, typename T = count_t> |
constexpr T | max_depth = (sizeof(hash_t) * 8u + B - 1u) / B |
|
template<bits_t B, typename T = count_t> |
constexpr T | max_shift = max_depth<B, count_t> * B |
|
◆ bits_t
◆ count_t
◆ hash_t
◆ shift_t
◆ size_t
◆ popcount() [1/2]
count_t immer::detail::hamts::popcount |
( |
std::uint32_t |
x | ) |
|
|
inline |
Definition at line 73 of file bits.hpp.
Referenced by immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B >::copy_inner_insert_value(), immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B >::copy_inner_remove_value(), immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B >::copy_inner_replace(), immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B >::copy_inner_replace_inline(), immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B >::copy_inner_replace_merged(), immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B >::copy_inner_replace_value(), immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B >::delete_deep(), immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B >::delete_deep_shift(), immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B >::delete_inner(), immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::do_add(), 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 >::do_update(), immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::equals_tree(), immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::for_each_chunk_traversal(), immer::detail::hamts::champ< value_t, hash_key, equal_key, MemoryPolicy, B >::get(), immer::detail::hamts::champ_iterator< T, Hash, Eq, MP, B >::step_down(), and immer::detail::hamts::champ_iterator< T, Hash, Eq, MP, B >::step_right().
◆ popcount() [2/2]
count_t immer::detail::hamts::popcount |
( |
std::uint64_t |
x | ) |
|
|
inline |
◆ popcount_fallback() [1/2]
auto immer::detail::hamts::popcount_fallback |
( |
std::uint32_t |
x | ) |
|
|
inline |
◆ popcount_fallback() [2/2]
auto immer::detail::hamts::popcount_fallback |
( |
std::uint64_t |
x | ) |
|
|
inline |
◆ branches
template<bits_t B, typename T = count_t>
constexpr T immer::detail::hamts::branches = T{1u} << B |
◆ mask
template<bits_t B, typename T = size_t>
constexpr T immer::detail::hamts::mask = branches<B, T> - 1u |
◆ max_depth
template<bits_t B, typename T = count_t>
constexpr T immer::detail::hamts::max_depth = (sizeof(hash_t) * 8u + B - 1u) / B |
◆ max_shift
template<bits_t B, typename T = count_t>