| bits | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | static |
| bits_leaf | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | static |
| can_mutate(edit_t e) const | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| can_relax() const | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| check(shift_t shift, size_t size) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| compute_shift() | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| copy_inner(node_t *src, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| copy_inner_e(edit_t e, node_t *src, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| copy_inner_n(count_t allocn, node_t *src, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| copy_inner_r(node_t *src, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| copy_inner_r_e(edit_t e, node_t *src, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| copy_inner_r_n(count_t allocn, node_t *src, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| copy_inner_sr_e(edit_t e, node_t *src, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| copy_leaf(node_t *src, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| copy_leaf(node_t *src1, count_t n1, node_t *src2, count_t n2) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| copy_leaf(node_t *src, count_t idx, count_t last) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| copy_leaf_e(edit_t e, node_t *src, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| copy_leaf_e(edit_t e, node_t *src1, count_t n1, node_t *src2, count_t n2) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| copy_leaf_e(edit_t e, node_t *src, count_t idx, count_t last) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| copy_leaf_emplace(node_t *src, count_t n, U &&x) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| copy_leaf_n(count_t allocn, node_t *src, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| dec() const | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| dec_unsafe() const | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| delete_inner(node_t *p, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| delete_inner_any(node_t *p, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| delete_inner_e(node_t *p) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| delete_inner_r(node_t *p, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| delete_inner_r_e(node_t *p) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| delete_leaf(node_t *p, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| do_copy_inner(node_t *dst, node_t *src, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| do_copy_inner_r(node_t *dst, node_t *src, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| do_copy_inner_sr(node_t *dst, node_t *src, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| edit_t typedef | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | |
| embed_relaxed | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | static |
| ensure_mutable_relaxed(edit_t e) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| ensure_mutable_relaxed_e(edit_t e, edit_t ec) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| ensure_mutable_relaxed_n(edit_t e, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| heap typedef | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | |
| heap_policy typedef | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | |
| impl | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | |
| impl_t typedef | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | |
| inc() | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| inc() const | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| inc_nodes(node_t **p, count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| inner() | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| keep_headroom | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | static |
| kind() const | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| kind_t enum name | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | |
| leaf() | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| make_inner_e(edit_t e) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_inner_n(count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_inner_n(count_t n, node_t *x) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_inner_n(edit_t n, node_t *x) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_inner_n(count_t n, node_t *x, node_t *y) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_inner_r_e(edit_t e) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_inner_r_n(count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_inner_r_n(count_t n, node_t *x) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_inner_r_n(count_t n, node_t *x, size_t xs) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_inner_r_n(count_t n, node_t *x, node_t *y) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_inner_r_n(count_t n, node_t *x, size_t xs, node_t *y) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_inner_r_n(count_t n, node_t *x, size_t xs, node_t *y, size_t ys) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_inner_r_n(count_t n, node_t *x, size_t xs, node_t *y, size_t ys, node_t *z, size_t zs) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_inner_sr_e(edit_t e, relaxed_t *r) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_inner_sr_n(count_t n, relaxed_t *r) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_leaf_e(edit_t e) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_leaf_e(edit_t e, U &&x) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_leaf_n(count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_leaf_n(count_t n, U &&x) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_path(shift_t shift, node_t *node) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| make_path_e(edit_t e, shift_t shift, node_t *node) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| max_sizeof_inner | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | static |
| max_sizeof_inner_r | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | static |
| max_sizeof_leaf | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | static |
| max_sizeof_relaxed | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | static |
| memory typedef | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | |
| node_t typedef | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | |
| ownee(const relaxed_t *x) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| ownee(relaxed_t *x) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| ownee(const node_t *x) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| ownee(node_t *x) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| ownee_t typedef | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | |
| refs(const relaxed_t *x) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| refs(const node_t *x) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| refs_t typedef | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | |
| relaxed() | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| relaxed() const | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inline |
| relaxed_data_no_meta_t typedef | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | |
| relaxed_data_with_meta_t typedef | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | |
| relaxed_t typedef | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | |
| sizeof_inner_n(count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| sizeof_inner_r_n(count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| sizeof_leaf_n(count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| sizeof_packed_inner_n(count_t count) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| sizeof_packed_inner_r_n(count_t count) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| sizeof_packed_leaf_n(count_t count) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| sizeof_packed_relaxed_n(count_t count) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| sizeof_relaxed_n(count_t n) | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | inlinestatic |
| transience typedef | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | |
| value_t typedef | immer::detail::rbts::node< T, MemoryPolicy, B, BL > | |
1.8.14