Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::DynSkipList< Key, Compare > Member List

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

all(Pred &pred) constAleph::DynSkipList< Key, Compare >inline
all(Pred &&pred=Pred()) constAleph::DynSkipList< Key, Compare >inline
FunctionalMethods::all(Operation &operation) constFunctionalMethods< Container, T >inline
FunctionalMethods::all(Operation &&operation) constFunctionalMethods< Container, T >inline
append(const Key &key)Aleph::DynSkipList< Key, Compare >inline
append(Key &&key)Aleph::DynSkipList< Key, Compare >inline
LocateFunctions::base() constLocateFunctions< Container, Type >inlineprivate
begin() const noexceptAleph::DynSkipList< Key, Compare >inline
StlAlephIterator::begin() noexceptStlAlephIterator< SetName >inline
cbegin() const noexceptStlAlephIterator< SetName >inline
cend() const noexceptStlAlephIterator< SetName >inline
clear() noexceptAleph::DynSkipList< Key, Compare >inline
cmpAleph::DynSkipList< Key, Compare >private
const_iterator typedefStlAlephIterator< SetName >
LocateFunctions::const_me() const noexceptLocateFunctions< Container, Type >inlineprivate
contains(const Key &key) const noexceptAleph::DynSkipList< Key, Compare >inline
current_levelAleph::DynSkipList< Key, Compare >private
defaultProbabilityAleph::DynSkipList< Key, Compare >static
del(const Key &key)Aleph::DynSkipList< Key, Compare >inline
diff(const DynSkipList &other) constAleph::DynSkipList< Key, Compare >inline
drop(const size_t n) constFunctionalMethods< Container, T >inline
DynSkipList(unsigned long seed, double p=defaultProbability)Aleph::DynSkipList< Key, Compare >inline
DynSkipList(double p=defaultProbability)Aleph::DynSkipList< Key, Compare >inlineexplicit
DynSkipList(const List< Key > &l)Aleph::DynSkipList< Key, Compare >inline
DynSkipList(It b, It e)Aleph::DynSkipList< Key, Compare >inline
DynSkipList(std::initializer_list< Key > l)Aleph::DynSkipList< Key, Compare >inline
DynSkipList(const DynSkipList &other)Aleph::DynSkipList< Key, Compare >inline
DynSkipList(DynSkipList &&other) noexceptAleph::DynSkipList< Key, Compare >inline
each(Operation &operation)FunctionalMethods< Container, T >inline
each(Operation &operation) constFunctionalMethods< Container, T >inline
each(Operation &&operation) constFunctionalMethods< Container, T >inline
each(Operation &&operation)FunctionalMethods< Container, T >inline
each(size_t pos, const size_t slice, Operation &operation) constFunctionalMethods< Container, T >inline
each(const size_t pos, const size_t slice, Operation &&operation) constFunctionalMethods< Container, T >inline
eachFunctionalMethods< Container, T >related
eachFunctionalMethods< Container, T >related
eachFunctionalMethods< 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() noexceptAleph::DynSkipList< Key, Compare >inline
end() const noexceptAleph::DynSkipList< Key, Compare >inline
StlAlephIterator::end() noexceptStlAlephIterator< SetName >inline
exist(const Key &key) const noexceptAleph::DynSkipList< Key, Compare >inline
exists(Pred &pred) constAleph::DynSkipList< Key, Compare >inline
exists(Pred &&pred=Pred()) constAleph::DynSkipList< Key, Compare >inline
FunctionalMethods::exists(Operation &op) constFunctionalMethods< Container, T >inline
FunctionalMethods::exists(Operation &&op) constFunctionalMethods< Container, T >inline
filter(Operation &operation) constFunctionalMethods< Container, T >inline
filter(Operation &&operation) constFunctionalMethods< Container, T >inline
find(const Key &key)Aleph::DynSkipList< Key, Compare >inline
find(const Key &key) constAleph::DynSkipList< Key, 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_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) constFunctionalMethods< Container, T >inline
fold(const T &init, Operation &&operation) constFunctionalMethods< Container, T >inline
fold_left(const __T &init, Op &op) constFunctionalMethods< Container, T >inline
fold_left(const __T &init, Op &&op=Op()) constFunctionalMethods< Container, T >inline
foldl(const T &init, std::function< T(const T &, const Key &)> op) constAleph::DynSkipList< Key, Compare >inline
foldl(const T &init, Operation &op) constAleph::DynSkipList< Key, Compare >inline
foldl(const T &init, Operation &&op) constAleph::DynSkipList< Key, Compare >inline
FunctionalMethods::foldl(const __T &init, Op &op) constFunctionalMethods< Container, T >inline
FunctionalMethods::foldl(const __T &init, Op &&op=Op()) constFunctionalMethods< Container, T >inline
for_each(Operation &op) constAleph::DynSkipList< Key, Compare >inline
for_each(Operation &&op=Operation()) constAleph::DynSkipList< Key, Compare >inline
FunctionalMethods::for_each(Operation &operation)FunctionalMethods< Container, T >inline
FunctionalMethods::for_each(Operation &&operation)FunctionalMethods< Container, T >inline
get_compare() noexceptAleph::DynSkipList< Key, Compare >inline
get_compare() const noexceptAleph::DynSkipList< Key, Compare >inline
get_first() constAleph::DynSkipList< Key, Compare >inline
get_it() const noexceptAleph::DynSkipList< Key, Compare >inline
LocateFunctions::get_it(const size_t pos) constLocateFunctions< Container, Type >inline
get_itor() constLocateFunctions< Container, Type >inline
get_last() constAleph::DynSkipList< Key, Compare >inline
gsl_rng_object() noexceptAleph::DynSkipList< Key, Compare >inline
has(const Key &key) const noexceptAleph::DynSkipList< Key, Compare >inline
headerAleph::DynSkipList< Key, Compare >private
init(unsigned long seed)Aleph::DynSkipList< Key, Compare >inlineprivate
insert(const Key &key)Aleph::DynSkipList< Key, Compare >inline
insert(Key &&key)Aleph::DynSkipList< Key, Compare >inline
insert_unique(const Key &key)Aleph::DynSkipList< Key, Compare >inline
intersect(const DynSkipList &other) constAleph::DynSkipList< Key, Compare >inline
is_empty() const noexceptAleph::DynSkipList< Key, Compare >inline
Item_Type typedefAleph::DynSkipList< Key, Compare >
items() constGenericItems< Container, T >inline
iterator typedefStlAlephIterator< SetName >
join(const DynSkipList &other) constAleph::DynSkipList< Key, Compare >inline
Key_Type typedefAleph::DynSkipList< Key, Compare >
keys() constGenericItems< Container, T >inline
keys_equal(const Key &k1, const Key &k2) const noexceptAleph::DynSkipList< Key, Compare >inlineprivate
length() const noexceptFunctionalMethods< Container, T >inline
maps(Operation &op) constFunctionalMethods< Container, T >inline
maps(Operation &&op) constFunctionalMethods< Container, T >inline
maps_if(Prop prop, Operation &op) constFunctionalMethods< Container, T >inline
maps_if(Prop prop, Operation &&op) constFunctionalMethods< Container, T >inline
max() constAleph::DynSkipList< Key, Compare >inline
maxLevelAleph::DynSkipList< Key, Compare >static
LocateFunctions::me() noexceptLocateFunctions< Container, Type >inlineprivate
min() constAleph::DynSkipList< Key, 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
none(Pred &pred) constAleph::DynSkipList< Key, Compare >inline
none(Pred &&pred=Pred()) constAleph::DynSkipList< Key, Compare >inline
nth(const size_t n)LocateFunctions< Container, Type >inline
nth(const size_t n) constLocateFunctions< Container, Type >inline
nth_ne(const size_t n) noexceptLocateFunctions< Container, Type >inline
nth_ne(const size_t n) const noexceptLocateFunctions< Container, Type >inline
num_nodesAleph::DynSkipList< Key, Compare >private
operation_is_noexcept() noexceptLocateFunctions< Container, Type >inlineprivatestatic
operator=(const DynSkipList &other)Aleph::DynSkipList< Key, Compare >inline
operator=(DynSkipList &&other) noexceptAleph::DynSkipList< Key, Compare >inline
SpecialCtors::operator=(const SpecialCtors &)SpecialCtors< Container, T >inline
SpecialCtors::operator=(SpecialCtors &&) noexceptSpecialCtors< Container, T >inline
partition(Operation &op) constFunctionalMethods< Container, T >inline
partition(Operation &&op) constFunctionalMethods< Container, T >inline
partition(size_t n) constFunctionalMethods< Container, T >inline
pfilter(Operation &operation) constFunctionalMethods< Container, T >inline
pfilter(Operation &&operation) constFunctionalMethods< Container, T >inline
probabilityAleph::DynSkipList< Key, Compare >private
ptr_filter(Operation &operation) constFunctionalMethods< Container, T >inline
ptr_filter(Operation &&operation) constFunctionalMethods< Container, T >inline
rAleph::DynSkipList< Key, Compare >private
random_level() const noexceptAleph::DynSkipList< Key, Compare >inlineprivate
remove(const Key &key)Aleph::DynSkipList< Key, Compare >inline
rev() constFunctionalMethods< Container, T >inline
search(const Key &key) const noexceptAleph::DynSkipList< Key, Compare >inline
search_or_insert(const Key &key)Aleph::DynSkipList< Key, Compare >inline
set_seed(unsigned long seed) noexceptAleph::DynSkipList< Key, Compare >inline
Set_Type typedefAleph::DynSkipList< Key, Compare >
size() const noexceptAleph::DynSkipList< Key, Compare >inline
SpecialCtors()=defaultSpecialCtors< Container, T >
SpecialCtors(const SpecialCtors &)=defaultSpecialCtors< Container, T >
SpecialCtors(SpecialCtors &&) noexceptSpecialCtors< Container, T >inline
SpecialCtors(const Aleph::DynList< T > &l)SpecialCtors< Container, T >inline
SpecialCtors(It b, It e)SpecialCtors< Container, T >inline
SpecialCtors(std::initializer_list< T > l)SpecialCtors< Container, T >inline
split_half() constFunctionalMethods< Container, T >inline
swap(DynSkipList &other) noexceptAleph::DynSkipList< Key, Compare >inline
take(const size_t n) constFunctionalMethods< Container, T >inline
take(size_t i, const size_t j, const size_t step=1) constFunctionalMethods< Container, T >inline
to_dynlist() constFunctionalMethods< Container, T >inline
to_vector() constFunctionalMethods< Container, T >inline
tpartition(Operation &op) constFunctionalMethods< Container, T >inline
tpartition(Operation &&op) constFunctionalMethods< Container, T >inline
traverse(Operation &op) constAleph::DynSkipList< Key, Compare >inline
traverse(Operation &&op=Operation()) constAleph::DynSkipList< Key, Compare >inline
GenericTraverse::traverse(Operation &operation) noexcept(traverse_is_noexcept< Operation >())GenericTraverse< Container >inline
GenericTraverse::traverse(Operation &&operation) noexcept(traverse_is_noexcept< Operation >())GenericTraverse< Container >inline
traverse_is_noexcept() noexceptGenericTraverse< Container >inlineprivatestatic
~DynSkipList()Aleph::DynSkipList< Key, Compare >inline