bitmap_t typedef | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | |
children() | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inline |
children() const | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inline |
collision_count() const | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inline |
collisions() | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inline |
collisions() const | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inline |
copy_collision_insert(node_t *src, T v) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
copy_collision_remove(node_t *src, T *v) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
copy_collision_replace(node_t *src, T *pos, T v) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
copy_inner_insert_value(node_t *src, bitmap_t bit, T v) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
copy_inner_remove_value(node_t *src, bitmap_t bit, count_t voffset) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
copy_inner_replace(node_t *src, count_t offset, node_t *child) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
copy_inner_replace_inline(node_t *src, bitmap_t bit, count_t noffset, T value) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
copy_inner_replace_merged(node_t *src, bitmap_t bit, count_t voffset, node_t *node) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
copy_inner_replace_value(node_t *src, count_t offset, T v) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
datamap() const | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inline |
deallocate_collision(node_t *p, count_t n) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
deallocate_inner(node_t *p, count_t n) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
deallocate_inner(node_t *p, count_t n, count_t nv) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
deallocate_values(values_t *p, count_t n) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
dec() const | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inline |
dec_unsafe() const | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inline |
delete_collision(node_t *p) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
delete_deep(node_t *p, shift_t s) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
delete_deep_shift(node_t *p, shift_t s) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
delete_inner(node_t *p) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
delete_values(values_t *p, count_t n) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
edit_t typedef | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | |
heap typedef | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | |
heap_policy typedef | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | |
impl | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | |
impl_t typedef | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | |
inc() | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inline |
inc() const | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inline |
inc_nodes(node_t **p, count_t n) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
kind() const | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inline |
kind_t enum name | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | |
make_collision(T v1, T v2) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
make_collision_n(count_t n) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
make_inner_n(count_t n) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
make_inner_n(count_t n, values_t *values) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
make_inner_n(count_t n, count_t nv) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
make_inner_n(count_t n, count_t idx, node_t *child) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
make_inner_n(count_t n, bitmap_t bitmap, T x) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
make_inner_n(count_t n, count_t idx1, T x1, count_t idx2, T x2) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
make_merged(shift_t shift, T v1, hash_t hash1, T v2, hash_t hash2) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
memory typedef | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | |
node_t typedef | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | |
nodemap() const | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inline |
ownee(const values_t *x) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
ownee(values_t *x) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
ownee(const node_t *x) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
ownee(node_t *x) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
ownee_t typedef | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | |
refs(const values_t *x) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
refs(const node_t *x) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
refs_t typedef | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | |
sizeof_collision_n(count_t count) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
sizeof_inner_n(count_t count) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
sizeof_values_n(count_t count) | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inlinestatic |
transience typedef | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | |
value_t typedef | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | |
values() | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inline |
values() const | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | inline |
values_t typedef | immer::detail::hamts::node< T, Hash, Equal, MemoryPolicy, B > | |