Aleph::DynSetRandTree< Key, Compare > Member List

This is the complete list of members for Aleph::DynSetRandTree< Key, Compare >, including all inherited members.

__contains_or_insert(Node *p)	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivate
__insert(Node *p)	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivate
__insert_dup(Node *q)	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivate
__search_or_insert(Node *p)	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivate
access(size_t i)	Aleph::DynSetTree< Key, Tree, Compare >	inline
all(Operation &operation) const	FunctionalMethods< Container, T >	inline
all(Operation &&operation) const	FunctionalMethods< Container, T >	inline
alloc_node(const Key &key)	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivate
alloc_node(Key &&key)	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivate
append(const Key &key)	Aleph::DynSetTree< Key, Tree, Compare >	inline
append(Key &&key)	Aleph::DynSetTree< Key, Tree, Compare >	inline
arena_allocated_size() const noexcept	Aleph::DynSetTree< Key, Tree, Compare >	inline
arena_allocator	Aleph::DynSetTree< Key, Tree, Compare >	private
arena_available_size() const noexcept	Aleph::DynSetTree< Key, Tree, Compare >	inline
Base typedef	Aleph::DynSetRandTree< Key, Compare >
LocateFunctions::base() const	LocateFunctions< Container, Type >	inlineprivate
begin() noexcept	StlAlephIterator< SetName >	inline
begin() const noexcept	StlAlephIterator< SetName >	inline
call_find_position(const T &t, const Key &key, int) -> decltype(t.find_position(key))	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivatestatic
call_find_position(const T &, const Key &,...)	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivatestatic
call_position(const T &t, const Key &key, int) -> decltype(t.position(key))	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivatestatic
call_position(const T &, const Key &,...)	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivatestatic
call_remove_pos(T &t, const size_t i, int) -> decltype(t.remove_pos(i))	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivatestatic
call_remove_pos(T &, const size_t,...)	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivatestatic
call_select(const T &t, const size_t i, int) -> decltype(t.select(i))	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivatestatic
call_select(const T &, const size_t,...)	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivatestatic
call_select_nc(T &t, const size_t i, int) -> decltype(t.select(i))	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivatestatic
call_select_nc(T &, const size_t,...)	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivatestatic
call_split_pos(T &t, const size_t pos, T &l, T &r, int) -> decltype(t.split_pos(pos, l, r), void())	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivatestatic
call_split_pos(T &, const size_t, T &, T &,...)	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivatestatic
cbegin() const noexcept	StlAlephIterator< SetName >	inline
cend() const noexcept	StlAlephIterator< SetName >	inline
const_iterator typedef	StlAlephIterator< SetName >
LocateFunctions::const_me() const noexcept	LocateFunctions< Container, Type >	inlineprivate
contains(const Key &key) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
contains_or_insert(const Key &key)	Aleph::DynSetTree< Key, Tree, Compare >	inline
contains_or_insert(Key &&key)	Aleph::DynSetTree< Key, Tree, Compare >	inline
del(const Key &key)	Aleph::DynSetTree< Key, Tree, Compare >	inline
dim	Aleph::DynSetTree< Key, Tree, Compare >	privatestatic
drop(const size_t n) const	FunctionalMethods< Container, T >	inline
DynSetTree(const Compare &cmp=Compare())	Aleph::DynSetTree< Key, Tree, Compare >	inline
DynSetTree(const char *base_addr, const size_t &sz, const Compare &cmp=Compare())	Aleph::DynSetTree< Key, Tree, Compare >	inline
DynSetTree(const size_t &arena_sz, const Compare &cmp=Compare())	Aleph::DynSetTree< Key, Tree, Compare >	inlineexplicit
DynSetTree(const DynSetTree &srcTree)	Aleph::DynSetTree< Key, Tree, Compare >	inline
DynSetTree(const List< Key > &l)	Aleph::DynSetTree< Key, Tree, Compare >	inline
DynSetTree(It b, It e)	Aleph::DynSetTree< Key, Tree, Compare >	inline
DynSetTree(std::initializer_list< Key > l)	Aleph::DynSetTree< Key, Tree, Compare >	inline
DynSetTree(DynSetTree &&srcTree) noexcept	Aleph::DynSetTree< Key, Tree, Compare >	inline
each(Operation &operation)	FunctionalMethods< Container, T >	inline
each(Operation &operation) const	FunctionalMethods< Container, T >	inline
each(Operation &&operation) const	FunctionalMethods< Container, T >	inline
each(Operation &&operation)	FunctionalMethods< Container, T >	inline
each(size_t pos, const size_t slice, Operation &operation) const	FunctionalMethods< Container, T >	inline
each(const size_t pos, const size_t slice, Operation &&operation) const	FunctionalMethods< Container, T >	inline
each	FunctionalMethods< Container, T >	related
each	FunctionalMethods< Container, T >	related
each	FunctionalMethods< Container, T >	related
emplace(Args &&... args)	FunctionalMethods< Container, T >	inline
emplace_end(Args &&... args)	FunctionalMethods< Container, T >	inline
emplace_ins(Args &&... args)	FunctionalMethods< Container, T >	inline
empty()	Aleph::DynSetTree< Key, Tree, Compare >	inline
end() noexcept	StlAlephIterator< SetName >	inline
end() const noexcept	StlAlephIterator< SetName >	inline
equal_to(const Container &r) const noexcept	EqualToMethod< Container >	inline
exist(const Key &key) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
exists(Operation &op) const	FunctionalMethods< Container, T >	inline
exists(Operation &&op) const	FunctionalMethods< Container, T >	inline
filter(Operation &operation) const	FunctionalMethods< Container, T >	inline
filter(Operation &&operation) const	FunctionalMethods< Container, T >	inline
find(const Key &key) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
find_index(Operation &operation) const noexcept(operation_is_noexcept< Operation >())	LocateFunctions< Container, Type >	inline
find_index(Operation &&operation) const noexcept(operation_is_noexcept< Operation >())	LocateFunctions< Container, Type >	inline
find_item(Operation &operation) noexcept(operation_is_noexcept< Operation >())	LocateFunctions< Container, Type >	inline
find_item(Operation &operation) const noexcept(operation_is_noexcept< Operation >())	LocateFunctions< Container, Type >	inline
find_item(Operation &&operation) noexcept(operation_is_noexcept< Operation >())	LocateFunctions< Container, Type >	inline
find_item(Operation &&operation) const noexcept(operation_is_noexcept< Operation >())	LocateFunctions< Container, Type >	inline
find_position(const Key &key) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
find_ptr(Operation &operation) noexcept(operation_is_noexcept< Operation >())	LocateFunctions< Container, Type >	inline
find_ptr(Operation &operation) const noexcept(operation_is_noexcept< Operation >())	LocateFunctions< Container, Type >	inline
find_ptr(Operation &&operation) const noexcept(operation_is_noexcept< Operation >())	LocateFunctions< Container, Type >	inline
find_ptr(Operation &&operation) noexcept(operation_is_noexcept< Operation >())	LocateFunctions< Container, Type >	inline
fold(const T &init, Operation &operation) const	FunctionalMethods< Container, T >	inline
fold(const T &init, Operation &&operation) const	FunctionalMethods< Container, T >	inline
fold_left(const __T &init, Op &op) const	FunctionalMethods< Container, T >	inline
fold_left(const __T &init, Op &&op=Op()) const	FunctionalMethods< Container, T >	inline
foldl(const __T &init, Op &op) const	FunctionalMethods< Container, T >	inline
foldl(const __T &init, Op &&op=Op()) const	FunctionalMethods< Container, T >	inline
for_each(Operation &operation)	FunctionalMethods< Container, T >	inline
for_each(Operation &operation) const	FunctionalMethods< Container, T >	inline
for_each(Operation &&operation) const	FunctionalMethods< Container, T >	inline
for_each(Operation &&operation)	FunctionalMethods< Container, T >	inline
for_each_in_preorder(void(*visitFct)(Node *, int, int))	Aleph::DynSetTree< Key, Tree, Compare >	inline
for_each_inorder(Key_Op &key_op) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
for_each_inorder(Key_Op &&key_op=Key_Op()) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
for_each_postorder(Key_Op &key_op) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
for_each_postorder(Key_Op &&key_op=Key_Op()) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
for_each_preorder(Key_Op &key_op) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
for_each_preorder(Key_Op &&key_op=Key_Op()) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
free_node(Node *p)	Aleph::DynSetTree< Key, Tree, Compare >	inlineprivate
get() const	Aleph::DynSetTree< Key, Tree, Compare >	inline
get_first() const	Aleph::DynSetTree< Key, Tree, Compare >	inline
get_it() const	LocateFunctions< Container, Type >	inline
get_it(const size_t pos) const	LocateFunctions< Container, Type >	inline
get_item() const	Aleph::DynSetTree< Key, Tree, Compare >	inline
get_itor() const	LocateFunctions< Container, Type >	inline
get_last() const	Aleph::DynSetTree< Key, Tree, Compare >	inline
get_root() const	Aleph::DynSetTree< Key, Tree, Compare >	inline
get_root_node() const	Aleph::DynSetTree< Key, Tree, Compare >	inline
has(const Key &key) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
height() const	Aleph::DynSetTree< Key, Tree, Compare >	inline
insert(const Key &key)	Aleph::DynSetTree< Key, Tree, Compare >	inline
insert(Key &&key)	Aleph::DynSetTree< Key, Tree, Compare >	inline
insert_dup(const Key &key)	Aleph::DynSetTree< Key, Tree, Compare >	inline
insert_dup(Key &&key)	Aleph::DynSetTree< Key, Tree, Compare >	inline
internal_path_length() const	Aleph::DynSetTree< Key, Tree, Compare >	inline
is_empty() const	Aleph::DynSetTree< Key, Tree, Compare >	inline
Item_Type typedef	Aleph::DynSetTree< Key, Tree, Compare >
items() const	GenericItems< Container, T >	inline
iterator typedef	StlAlephIterator< SetName >
join(DynSetTree &t, DynSetTree &dup)	Aleph::DynSetTree< Key, Tree, Compare >	inline
join(DynSetTree &t, DynSetTree &&dup=DynSetTree())	Aleph::DynSetTree< Key, Tree, Compare >	inline
join_dup(DynSetTree &t)	Aleph::DynSetTree< Key, Tree, Compare >	inline
Key_Type typedef	Aleph::DynSetTree< Key, Tree, Compare >
keys() const	GenericItems< Container, T >	inline
length() const noexcept	FunctionalMethods< Container, T >	inline
maps(Operation &op) const	FunctionalMethods< Container, T >	inline
maps(Operation &&op) const	FunctionalMethods< Container, T >	inline
maps_if(Prop prop, Operation &op) const	FunctionalMethods< Container, T >	inline
maps_if(Prop prop, Operation &&op) const	FunctionalMethods< Container, T >	inline
max() const	Aleph::DynSetTree< Key, Tree, Compare >	inline
LocateFunctions::me() noexcept	LocateFunctions< Container, Type >	inlineprivate
min() const	Aleph::DynSetTree< Key, Tree, Compare >	inline
mutable_drop(const size_t n)	FunctionalMethods< Container, T >	inline
mutable_for_each(Operation &operation)	FunctionalMethods< Container, T >	inline
mutable_for_each(Operation &&operation)	FunctionalMethods< Container, T >	inline
nappend(Args ... args)	FunctionalMethods< Container, T >	inline
ninsert(Args ... args)	FunctionalMethods< Container, T >	inline
nnappend(size_t &)	FunctionalMethods< Container, T >	inlineprivate
nnappend(size_t &n, const T &item, Args &... args)	FunctionalMethods< Container, T >	inlineprivate
nninsert(size_t &)	FunctionalMethods< Container, T >	inlineprivate
nninsert(size_t &n, const T &item, Args &... args)	FunctionalMethods< Container, T >	inlineprivate
Node typedef	Aleph::DynSetTree< Key, Tree, Compare >
nth(const size_t n)	LocateFunctions< Container, Type >	inline
nth(const size_t n) const	LocateFunctions< Container, Type >	inline
nth_ne(const size_t n) noexcept	LocateFunctions< Container, Type >	inline
nth_ne(const size_t n) const noexcept	LocateFunctions< Container, Type >	inline
num_nodes	Aleph::DynSetTree< Key, Tree, Compare >	private
operation_is_noexcept() noexcept	LocateFunctions< Container, Type >	inlineprivatestatic
operator!=(const Container &r) const noexcept	EqualToMethod< Container >	inline
operator()(size_t i)	Aleph::DynSetTree< Key, Tree, Compare >	inline
operator=(const DynList< Key > &list)	Aleph::DynSetTree< Key, Tree, Compare >	inline
operator=(const DynSetTree &srcTree)	Aleph::DynSetTree< Key, Tree, Compare >	inline
operator=(DynSetTree &&srcTree) noexcept	Aleph::DynSetTree< Key, Tree, Compare >	inline
operator==(const Container &r) const noexcept	EqualToMethod< Container >	inline
operator[](const Key &key) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
operator[](const Key &key)	Aleph::DynSetTree< Key, Tree, Compare >	inline
partition(Operation &op) const	FunctionalMethods< Container, T >	inline
partition(Operation &&op) const	FunctionalMethods< Container, T >	inline
partition(size_t n) const	FunctionalMethods< Container, T >	inline
pfilter(Operation &operation) const	FunctionalMethods< Container, T >	inline
pfilter(Operation &&operation) const	FunctionalMethods< Container, T >	inline
position(const Key &key) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
ptr_filter(Operation &operation) const	FunctionalMethods< Container, T >	inline
ptr_filter(Operation &&operation) const	FunctionalMethods< Container, T >	inline
put(const Key &key)	Aleph::DynSetTree< Key, Tree, Compare >	inline
put(Key &&key)	Aleph::DynSetTree< Key, Tree, Compare >	inline
remove(const Key &key)	Aleph::DynSetTree< Key, Tree, Compare >	inline
remove_pos(const size_t i)	Aleph::DynSetTree< Key, Tree, Compare >	inline
rev() const	FunctionalMethods< Container, T >	inline
search(const Key &key) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
search_or_insert(const Key &key)	Aleph::DynSetTree< Key, Tree, Compare >	inline
search_or_insert(Key &&key)	Aleph::DynSetTree< Key, Tree, Compare >	inline
select(size_t i)	Aleph::DynSetTree< Key, Tree, Compare >	inline
select(size_t i) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
Set_Type typedef	Aleph::DynSetTree< Key, Tree, Compare >
size() const	Aleph::DynSetTree< Key, Tree, Compare >	inline
split_half() const	FunctionalMethods< Container, T >	inline
split_key(const Key &key, DynSetTree &l, DynSetTree &r)	Aleph::DynSetTree< Key, Tree, Compare >	inline
split_key_dup(const Key &key, DynSetTree &l, DynSetTree &r)	Aleph::DynSetTree< Key, Tree, Compare >	inline
split_pos(const size_t pos, DynSetTree &l, DynSetTree &r)	Aleph::DynSetTree< Key, Tree, Compare >	inline
swap(DynSetTree &dset) noexcept(noexcept(tree.swap(dset.tree)) and noexcept(std::swap(num_nodes, dset.num_nodes)) and noexcept(std::swap(arena_allocator, dset.arena_allocator)))	Aleph::DynSetTree< Key, Tree, Compare >	inline
take(const size_t n) const	FunctionalMethods< Container, T >	inline
take(size_t i, const size_t j, const size_t step=1) const	FunctionalMethods< Container, T >	inline
to_dynlist() const	FunctionalMethods< Container, T >	inline
to_vector() const	FunctionalMethods< Container, T >	inline
tpartition(Operation &op) const	FunctionalMethods< Container, T >	inline
tpartition(Operation &&op) const	FunctionalMethods< Container, T >	inline
traverse(Operation &op)	Aleph::DynSetTree< Key, Tree, Compare >	inline
traverse(Operation &&op=Operation())	Aleph::DynSetTree< Key, Tree, Compare >	inline
traverse(Operation &op) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
traverse(Operation &&op=Operation()) const	Aleph::DynSetTree< Key, Tree, Compare >	inline
tree	Aleph::DynSetTree< Key, Tree, Compare >	mutableprivate
Tree_Type typedef	Aleph::DynSetTree< Key, Tree, Compare >
uses_arena() const noexcept	Aleph::DynSetTree< Key, Tree, Compare >	inline
verify() const	Aleph::DynSetTree< Key, Tree, Compare >	inline
~DynSetTree()	Aleph::DynSetTree< Key, Tree, Compare >	inlinevirtual