Aleph-w 3.0
A C++ Library for Data Structures and Algorithms
Loading...
Searching...
No Matches
Aleph::ArrayQueue< T > Member List

This is the complete list of members for Aleph::ArrayQueue< T >, including all inherited members.

access(const size_t i) const noexceptAleph::MemArray< T >inline
all(Operation &operation) constFunctionalMethods< ArrayQueue< T >, T >inline
all(Operation &&operation) constFunctionalMethods< ArrayQueue< T >, T >inline
allocate()Aleph::MemArray< T >inlineprotected
append(const T &item)Aleph::ArrayQueue< T >inline
append(T &&item)Aleph::ArrayQueue< T >inline
Aleph::MemArray::append(T &item)Aleph::MemArray< T >inline
Aleph::MemArray::append(const MemArray &a)Aleph::MemArray< T >inline
ArrayQueue(const size_t sz=8)Aleph::ArrayQueue< T >inline
ArrayQueue(const ArrayQueue &q)Aleph::ArrayQueue< T >inline
ArrayQueue(ArrayQueue &&q) noexceptAleph::ArrayQueue< T >inline
ArrayQueue(const List< T > &l)Aleph::ArrayQueue< T >inline
ArrayQueue(It b, It e)Aleph::ArrayQueue< T >inline
ArrayQueue(std::initializer_list< T > l)Aleph::ArrayQueue< T >inline
LocateFunctions< ArrayQueue< T >, T >::base() constLocateFunctions< ArrayQueue< T >, T >inlineprivate
begin() noexceptStlAlephIterator< ArrayQueue< T > >inline
begin() const noexceptStlAlephIterator< ArrayQueue< T > >inline
capacity() const noexceptAleph::MemArray< T >inline
cbegin() const noexceptStlAlephIterator< ArrayQueue< T > >inline
cend() const noexceptStlAlephIterator< ArrayQueue< T > >inline
close_gap(size_t pos, size_t num_entries=1)Aleph::MemArray< T >inlineprivate
complete_put() noexceptAleph::ArrayQueue< T >inlineprivate
const_iterator typedefStlAlephIterator< ArrayQueue< T > >
LocateFunctions< ArrayQueue< T >, T >::const_me() const noexceptLocateFunctions< ArrayQueue< T >, T >inlineprivate
contract(const size_t first=0)Aleph::MemArray< T >inlineprotected
contract_thresholdAleph::MemArray< T >mutable
dimAleph::MemArray< T >protected
drop(const size_t n) constFunctionalMethods< ArrayQueue< T >, T >inline
each(Operation &operation)FunctionalMethods< ArrayQueue< T >, T >inline
each(Operation &operation) constFunctionalMethods< ArrayQueue< T >, T >inline
each(Operation &&operation) constFunctionalMethods< ArrayQueue< T >, T >inline
each(Operation &&operation)FunctionalMethods< ArrayQueue< T >, T >inline
each(size_t pos, const size_t slice, Operation &operation) constFunctionalMethods< ArrayQueue< T >, T >inline
each(const size_t pos, const size_t slice, Operation &&operation) constFunctionalMethods< ArrayQueue< T >, T >inline
eachFunctionalMethods< ArrayQueue< T >, T >related
eachFunctionalMethods< ArrayQueue< T >, T >related
eachFunctionalMethods< ArrayQueue< T >, T >related
emplace(Args &&... args)FunctionalMethods< ArrayQueue< T >, T >inline
emplace_end(Args &&... args)FunctionalMethods< ArrayQueue< T >, T >inline
emplace_ins(Args &&... args)FunctionalMethods< ArrayQueue< T >, T >inline
empty()Aleph::MemArray< T >inline
empty_and_release()Aleph::MemArray< T >inline
end() noexceptStlAlephIterator< ArrayQueue< T > >inline
end() const noexceptStlAlephIterator< ArrayQueue< T > >inline
equal_to(const ArrayQueue< T > &r) const noexceptEqualToMethod< ArrayQueue< T > >inline
exists(Operation &op) constFunctionalMethods< ArrayQueue< T >, T >inline
exists(Operation &&op) constFunctionalMethods< ArrayQueue< T >, T >inline
expand(const size_t first=0)Aleph::MemArray< T >inlineprotected
filter(Operation &operation) constFunctionalMethods< ArrayQueue< T >, T >inline
filter(Operation &&operation) constFunctionalMethods< ArrayQueue< T >, T >inline
find_index(Operation &operation) const noexcept(operation_is_noexcept< Operation >())LocateFunctions< ArrayQueue< T >, T >inline
find_index(Operation &&operation) const noexcept(operation_is_noexcept< Operation >())LocateFunctions< ArrayQueue< T >, T >inline
find_item(Operation &operation) noexcept(operation_is_noexcept< Operation >())LocateFunctions< ArrayQueue< T >, T >inline
find_item(Operation &operation) const noexcept(operation_is_noexcept< Operation >())LocateFunctions< ArrayQueue< T >, T >inline
find_item(Operation &&operation) noexcept(operation_is_noexcept< Operation >())LocateFunctions< ArrayQueue< T >, T >inline
find_item(Operation &&operation) const noexcept(operation_is_noexcept< Operation >())LocateFunctions< ArrayQueue< T >, T >inline
find_ptr(Operation &operation) noexcept(operation_is_noexcept< Operation >())LocateFunctions< ArrayQueue< T >, T >inline
find_ptr(Operation &operation) const noexcept(operation_is_noexcept< Operation >())LocateFunctions< ArrayQueue< T >, T >inline
find_ptr(Operation &&operation) const noexcept(operation_is_noexcept< Operation >())LocateFunctions< ArrayQueue< T >, T >inline
find_ptr(Operation &&operation) noexcept(operation_is_noexcept< Operation >())LocateFunctions< ArrayQueue< T >, T >inline
first() constAleph::MemArray< T >inline
fold(const T &init, Operation &operation) constFunctionalMethods< ArrayQueue< T >, T >inline
fold(const T &init, Operation &&operation) constFunctionalMethods< ArrayQueue< T >, T >inline
fold_left(const __T &init, Op &op) constFunctionalMethods< ArrayQueue< T >, T >inline
fold_left(const __T &init, Op &&op=Op()) constFunctionalMethods< ArrayQueue< T >, T >inline
foldl(const __T &init, Op &op) constFunctionalMethods< ArrayQueue< T >, T >inline
foldl(const __T &init, Op &&op=Op()) constFunctionalMethods< ArrayQueue< T >, T >inline
for_each(Operation &operation)FunctionalMethods< ArrayQueue< T >, T >inline
for_each(Operation &operation) constFunctionalMethods< ArrayQueue< T >, T >inline
for_each(Operation &&operation) constFunctionalMethods< ArrayQueue< T >, T >inline
for_each(Operation &&operation)FunctionalMethods< ArrayQueue< T >, T >inline
front(const size_t i=0) constAleph::ArrayQueue< T >inline
front_indexAleph::ArrayQueue< T >private
get()Aleph::ArrayQueue< T >inline
Aleph::MemArray::get(const size_t i=1)Aleph::MemArray< T >inline
get_dim() const noexceptAleph::MemArray< T >inline
get_first() constAleph::MemArray< T >inline
get_it() constLocateFunctions< ArrayQueue< T >, T >inline
get_it(const size_t pos) constLocateFunctions< ArrayQueue< T >, T >inline
get_itor() constLocateFunctions< ArrayQueue< T >, T >inline
get_last() constAleph::MemArray< T >inline
get_ne(const size_t i=1) noexceptAleph::MemArray< T >inline
get_ptr() const noexceptAleph::MemArray< T >inline
getn(const size_t i)Aleph::ArrayQueue< T >inline
increase_index(size_t &i, const size_t inc=1) const noexceptAleph::ArrayQueue< T >inlineprivate
init_dim(size_t d) noexceptAleph::MemArray< T >inlineprotected
insert(const T &item)Aleph::ArrayQueue< T >inline
insert(T &&item)Aleph::ArrayQueue< T >inline
Aleph::MemArray::insert(T &item)Aleph::MemArray< T >inline
is_empty() const noexceptAleph::MemArray< T >inline
is_valid() const noexceptAleph::MemArray< T >inline
Item_Type typedefAleph::MemArray< T >
items() constGenericItems< Container, T >inline
iterator typedefStlAlephIterator< ArrayQueue< T > >
keys() constGenericItems< Container, T >inline
last() constAleph::MemArray< T >inline
length() const noexceptFunctionalMethods< ArrayQueue< T >, T >inline
maps(Operation &op) constFunctionalMethods< ArrayQueue< T >, T >inline
maps(Operation &&op) constFunctionalMethods< ArrayQueue< T >, T >inline
maps_if(Prop prop, Operation &op) constFunctionalMethods< ArrayQueue< T >, T >inline
maps_if(Prop prop, Operation &&op) constFunctionalMethods< ArrayQueue< T >, T >inline
LocateFunctions< ArrayQueue< T >, T >::me() noexceptLocateFunctions< ArrayQueue< T >, T >inlineprivate
MemArray(size_t __dim=Min_Dim)Aleph::MemArray< T >inline
MemArray(const MemArray &a)Aleph::MemArray< T >inline
MemArray(MemArray &&a) noexceptAleph::MemArray< T >inline
Min_DimAleph::MemArray< T >static
mutable_drop(const size_t n)FunctionalMethods< ArrayQueue< T >, T >inline
mutable_for_each(Operation &operation)FunctionalMethods< ArrayQueue< T >, T >inline
mutable_for_each(Operation &&operation)FunctionalMethods< ArrayQueue< T >, T >inline
nAleph::MemArray< T >protected
nappend(Args ... args)FunctionalMethods< ArrayQueue< T >, T >inline
ninsert(Args ... args)FunctionalMethods< ArrayQueue< T >, T >inline
nnappend(size_t &)FunctionalMethods< ArrayQueue< T >, T >inlineprivate
nnappend(size_t &n, const T &item, Args &... args)FunctionalMethods< ArrayQueue< T >, T >inlineprivate
nninsert(size_t &)FunctionalMethods< ArrayQueue< T >, T >inlineprivate
nninsert(size_t &n, const T &item, Args &... args)FunctionalMethods< ArrayQueue< T >, T >inlineprivate
nth(const size_t n)LocateFunctions< ArrayQueue< T >, T >inline
nth(const size_t n) constLocateFunctions< ArrayQueue< T >, T >inline
nth_ne(const size_t n) noexceptLocateFunctions< ArrayQueue< T >, T >inline
nth_ne(const size_t n) const noexceptLocateFunctions< ArrayQueue< T >, T >inline
open_gap(size_t pos=0, size_t num_entries=1)Aleph::MemArray< T >inlineprivate
operation_is_noexcept() noexceptLocateFunctions< ArrayQueue< T >, T >inlineprivatestatic
operator!=(const ArrayQueue< T > &r) const noexceptEqualToMethod< ArrayQueue< T > >inline
operator()(const size_t i) const noexceptAleph::MemArray< T >inline
operator=(const ArrayQueue &q)Aleph::ArrayQueue< T >inline
operator=(ArrayQueue &&q)Aleph::ArrayQueue< T >inline
Aleph::MemArray::operator=(const MemArray &a)Aleph::MemArray< T >inline
Aleph::MemArray::operator=(MemArray &&a) noexceptAleph::MemArray< T >inline
operator==(const ArrayQueue< T > &r) const noexceptEqualToMethod< ArrayQueue< T > >inline
operator[](const size_t i) constAleph::MemArray< T >inline
partition(Operation &op) constFunctionalMethods< ArrayQueue< T >, T >inline
partition(Operation &&op) constFunctionalMethods< ArrayQueue< T >, T >inline
partition(size_t n) constFunctionalMethods< ArrayQueue< T >, T >inline
pfilter(Operation &operation) constFunctionalMethods< ArrayQueue< T >, T >inline
pfilter(Operation &&operation) constFunctionalMethods< ArrayQueue< T >, T >inline
pop()Aleph::MemArray< T >inline
ptrAleph::MemArray< T >protected
ptr_filter(Operation &operation) constFunctionalMethods< ArrayQueue< T >, T >inline
ptr_filter(Operation &&operation) constFunctionalMethods< ArrayQueue< T >, T >inline
push(const T &item)Aleph::MemArray< T >inline
push(T &&item)Aleph::MemArray< T >inline
put(const T &item)Aleph::ArrayQueue< T >inline
put(T &&item)Aleph::ArrayQueue< T >inline
putn(size_t sz)Aleph::ArrayQueue< T >inline
rear(const size_t i=0) constAleph::ArrayQueue< T >inline
rear_indexAleph::ArrayQueue< T >private
rear_item(const size_t i=0) const noexceptAleph::ArrayQueue< T >inlineprivate
recenter_indices() noexceptAleph::ArrayQueue< T >inlineprivate
remove_first()Aleph::MemArray< T >inline
remove_last()Aleph::MemArray< T >inline
reserve(const size_t cap)Aleph::MemArray< T >inline
rev() constFunctionalMethods< ArrayQueue< T >, T >inline
reverse()Aleph::MemArray< T >inline
size() const noexceptAleph::MemArray< T >inline
split_half() constFunctionalMethods< ArrayQueue< T >, T >inline
swap(ArrayQueue &q) noexceptAleph::ArrayQueue< T >inline
Aleph::MemArray::swap(MemArray &a) noexceptAleph::MemArray< T >inline
take(const size_t n) constFunctionalMethods< ArrayQueue< T >, T >inline
take(size_t i, const size_t j, const size_t step=1) constFunctionalMethods< ArrayQueue< T >, T >inline
to_dynlist() constFunctionalMethods< ArrayQueue< T >, T >inline
to_vector() constFunctionalMethods< ArrayQueue< T >, T >inline
top() constAleph::MemArray< T >inline
tpartition(Operation &op) constFunctionalMethods< ArrayQueue< T >, T >inline
tpartition(Operation &&op) constFunctionalMethods< ArrayQueue< T >, T >inline
traverse(Operation &operation)Aleph::ArrayQueue< T >inline
traverse(Operation &operation) constAleph::ArrayQueue< T >inline
traverse(Operation &&operation) constAleph::ArrayQueue< T >inline
traverse(Operation &&operation)Aleph::ArrayQueue< T >inline
~MemArray()Aleph::MemArray< T >inline