immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL > Member List

This is the complete list of members for immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >, including all inherited members.

assoc(size_t idx, T value) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
assoc_mut(edit_t e, size_t idx, T value)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
back() const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
check_root() const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
check_tail() const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
check_tree() const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
concat(const rrbtree &r) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
concat_mut_l(rrbtree &l, edit_t el, const rrbtree &r)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	friend
concat_mut_lr_l(rrbtree &l, edit_t el, rrbtree &r, edit_t er)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	friend
concat_mut_lr_r(rrbtree &l, edit_t el, rrbtree &r, edit_t er)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	friend
concat_mut_r(const rrbtree &l, rrbtree &r, edit_t er)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	friend
dec() const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
descend(Visitor v, size_t idx) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
drop(size_t elems) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
drop_mut(edit_t e, size_t elems)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
edit_t typedef	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >
empty()	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inlinestatic
ensure_mutable_tail(edit_t e, count_t n)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
equals(const rrbtree &other) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
for_each_chunk(Fn &&fn) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
for_each_chunk(size_t first, size_t last, Fn &&fn) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
for_each_chunk_p(Fn &&fn) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
for_each_chunk_p(size_t first, size_t last, Fn &&fn) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
from_fill(size_t n, T v)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inlinestatic
from_initializer_list(std::initializer_list< U > values)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inlinestatic
from_range(Iter first, Sent last)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inlinestatic
front() const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
get(size_t index) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
get_check(size_t index) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
get_mut(edit_t e, size_t idx)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
hard_reset()	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
inc() const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
node_t typedef	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >
operator=(const rrbtree &other)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
operator=(rrbtree &&other)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
owner_t typedef	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >
push_back(T value) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
push_back_mut(edit_t e, T value)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
push_tail(node_t *root, shift_t shift, size_t size, node_t *tail, count_t tail_size) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
push_tail_mut(edit_t e, size_t tail_off, node_t *tail, count_t tail_size)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
region_for(size_t idx) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
root	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >
rrbtree(size_t sz, shift_t sh, node_t *r, node_t *t)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
rrbtree(const rrbtree &other)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
rrbtree(rrbtree &&other)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
shift	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >
size	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >
supports_transient_concat	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	static
swap(rrbtree &x, rrbtree &y)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	friend
tail	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >
tail_offset() const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
tail_size() const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
take(size_t new_size) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
take_mut(edit_t e, size_t new_size)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
traverse(Visitor v, Args &&... args) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
traverse(Visitor v, size_t first, size_t last, Args &&... args) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
traverse_p(Visitor v, Args &&... args) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
traverse_p(Visitor v, size_t first, size_t last, Args &&... args) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
update(size_t idx, FnT &&fn) const	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
update_mut(edit_t e, size_t idx, FnT &&fn)	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline
~rrbtree()	immer::detail::rbts::rrbtree< T, MemoryPolicy, B, BL >	inline