Aleph-w  1.9
General library for algorithms and data structures
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) const noexcept(noexcept(operation))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
all(Operation &&operation) const noexcept(noexcept(operation))Aleph::FunctionalMethods< 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
append(const MemArray &a) (defined in Aleph::MemArray< T >)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)Aleph::ArrayQueue< T >inline
begin() noexcept (defined in StlAlephIterator< SetName >)StlAlephIterator< SetName >inline
begin() const noexcept (defined in StlAlephIterator< SetName >)StlAlephIterator< SetName >inline
capacity() const noexceptAleph::MemArray< T >inline
cbegin() const noexcept (defined in StlAlephIterator< SetName >)StlAlephIterator< SetName >inline
cbegin() noexcept (defined in StlAlephIterator< SetName >)StlAlephIterator< SetName >inline
cend() const noexcept (defined in StlAlephIterator< SetName >)StlAlephIterator< SetName >inline
cend() noexcept (defined in StlAlephIterator< SetName >)StlAlephIterator< SetName >inline
const_iterator typedef (defined in StlAlephIterator< SetName >)StlAlephIterator< SetName >
contract(const size_t first=0)Aleph::MemArray< T >inlineprotected
contract_threshold (defined in Aleph::MemArray< T >)Aleph::MemArray< T >mutable
dim (defined in Aleph::MemArray< T >)Aleph::MemArray< T >protected
drop(const size_t n) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
each(Operation &operation) noexcept(noexcept(operation))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
each(Operation &operation) const noexcept(noexcept(operation))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
each(Operation &&operation) const noexcept(noexcept(operation))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
each(Operation &&operation) noexcept(noexcept(operation))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
each(size_t pos, size_t slice, Operation &operation) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
each(size_t pos, size_t slice, Operation &&operation) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
emplace(Args &&... args)Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
emplace_end(Args &&... args)Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
emplace_ins(Args &&... args)Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
empty()Aleph::MemArray< T >inline
empty_and_release()Aleph::MemArray< T >inline
end() noexcept (defined in StlAlephIterator< SetName >)StlAlephIterator< SetName >inline
end() const noexcept (defined in StlAlephIterator< SetName >)StlAlephIterator< SetName >inline
equal_to(const ArrayQueue< T > &r) const noexceptAleph::EqualToMethod< ArrayQueue< T > >inline
exists(Operation &op) const noexcept(noexcept(op))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
exists(Operation &&op) const noexcept(noexcept(op))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
expand(const size_t first=0)Aleph::MemArray< T >inlineprotected
filter(Operation &operation) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
filter(Operation &&operation) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
find_index(Operation &operation) const noexcept(noexcept(operation))Aleph::LocateFunctions< ArrayQueue< T >, T >inline
find_index(Operation &&operation) const noexcept(noexcept(operation))Aleph::LocateFunctions< ArrayQueue< T >, T >inline
find_item(Operation &operation) noexcept(noexcept(operation))Aleph::LocateFunctions< ArrayQueue< T >, T >inline
find_item(Operation &operation) const noexcept(noexcept(operation))Aleph::LocateFunctions< ArrayQueue< T >, T >inline
find_item(Operation &&operation) noexcept(noexcept(operation))Aleph::LocateFunctions< ArrayQueue< T >, T >inline
find_item(Operation &&operation) const noexcept(noexcept(operation))Aleph::LocateFunctions< ArrayQueue< T >, T >inline
find_ptr(Operation &operation) noexcept(noexcept(operation))Aleph::LocateFunctions< ArrayQueue< T >, T >inline
find_ptr(Operation &operation) const noexcept(noexcept(operation))Aleph::LocateFunctions< ArrayQueue< T >, T >inline
find_ptr(Operation &&operation) const noexcept(noexcept(operation))Aleph::LocateFunctions< ArrayQueue< T >, T >inline
find_ptr(Operation &&operation) noexcept(noexcept(operation))Aleph::LocateFunctions< ArrayQueue< T >, T >inline
first() constAleph::MemArray< T >inline
fold(const T &init, Operation &operation) const noexcept(noexcept(operation))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
fold(const T &init, Operation &&operation) const noexcept(noexcept(operation))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
foldl(const __T &init, Op &op) const noexcept(noexcept(op))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
foldl(const __T &init, Op &&op=Op()) const noexcept(noexcept(op))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
for_each(Operation &operation) noexcept(noexcept(operation))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
for_each(Operation &operation) const noexcept(noexcept(operation))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
for_each(Operation &&operation) const noexcept(noexcept(operation))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
for_each(Operation &&operation) noexcept(noexcept(operation))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
front(const size_t i=0) constAleph::ArrayQueue< T >inline
get()Aleph::ArrayQueue< T >inline
Aleph::MemArray::get(size_t i=1)Aleph::MemArray< T >inline
get_dim() const noexceptAleph::MemArray< T >inline
get_first() constAleph::MemArray< T >inline
get_it() constAleph::LocateFunctions< ArrayQueue< T >, T >inline
get_it(size_t pos) constAleph::LocateFunctions< ArrayQueue< T >, T >inline
get_itor() constAleph::LocateFunctions< ArrayQueue< T >, T >inline
get_last() constAleph::MemArray< T >inline
get_ne(size_t i=1) noexcept (defined in Aleph::MemArray< T >)Aleph::MemArray< T >inline
get_ptr() const noexceptAleph::MemArray< T >inline
getn(const size_t i)Aleph::ArrayQueue< T >inline
init_dim(size_t d) noexcept (defined in Aleph::MemArray< T >)Aleph::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 noexcept (defined in Aleph::MemArray< T >)Aleph::MemArray< T >inline
Item_Type typedef (defined in Aleph::MemArray< T >)Aleph::MemArray< T >
items() constAleph::GenericItems< Container, T >inline
iterator typedef (defined in StlAlephIterator< SetName >)StlAlephIterator< SetName >
keys() constAleph::GenericItems< Container, T >inline
last() constAleph::MemArray< T >inline
length() const noexceptAleph::FunctionalMethods< ArrayQueue< T >, T >inline
maps(Operation &op) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
maps(Operation &&op) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
maps_if(Prop prop, Operation &op) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
maps_if(Prop prop, Operation &&op) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
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_Dim (defined in Aleph::MemArray< T >)Aleph::MemArray< T >static
mutable_drop(size_t n)Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
mutable_for_each(Operation &operation) noexcept(noexcept(operation)) (defined in Aleph::FunctionalMethods< ArrayQueue< T >, T >)Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
mutable_for_each(Operation &&operation) noexcept(noexcept(operation))Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
n (defined in Aleph::MemArray< T >)Aleph::MemArray< T >protected
nappend(Args ... args)Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
ninsert(Args ... args)Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
nth(const size_t n)Aleph::LocateFunctions< ArrayQueue< T >, T >inline
nth(const size_t n) constAleph::LocateFunctions< ArrayQueue< T >, T >inline
nth_ne(const size_t n) noexcept (defined in Aleph::LocateFunctions< ArrayQueue< T >, T >)Aleph::LocateFunctions< ArrayQueue< T >, T >inline
nth_ne(const size_t n) const noexceptAleph::LocateFunctions< ArrayQueue< T >, T >inline
operator!=(const ArrayQueue< T > &r) const noexceptAleph::EqualToMethod< 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 noexceptAleph::EqualToMethod< ArrayQueue< T > >inline
operator[](const size_t i) constAleph::MemArray< T >inline
partition(Operation &op) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
partition(Operation &&op) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
partition(size_t n) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
pfilter(Operation &operation) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
pfilter(Operation &&operation) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
pop()Aleph::MemArray< T >inline
ptr (defined in Aleph::MemArray< T >)Aleph::MemArray< T >protected
ptr_filter(Operation &operation) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
ptr_filter(Operation &&operation) const (defined in Aleph::FunctionalMethods< ArrayQueue< T >, T >)Aleph::FunctionalMethods< 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
remove_first()Aleph::MemArray< T >inline
remove_last()Aleph::MemArray< T >inline
reserve(const size_t cap)Aleph::MemArray< T >inline
rev() constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
reverse()Aleph::MemArray< T >inline
size() const noexceptAleph::MemArray< T >inline
Special_Ctors(ArrayQueue, T) (defined in Aleph::ArrayQueue< T >)Aleph::ArrayQueue< T >
swap(ArrayQueue &q) noexceptAleph::ArrayQueue< T >inline
Aleph::MemArray::swap(MemArray &a) noexceptAleph::MemArray< T >inline
take(const size_t n) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
take(size_t i, size_t j, size_t step=1) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
to_dynlist() const (defined in Aleph::FunctionalMethods< ArrayQueue< T >, T >)Aleph::FunctionalMethods< ArrayQueue< T >, T >inline
top() const (defined in Aleph::MemArray< T >)Aleph::MemArray< T >inline
tpartition(Operation &op) constAleph::FunctionalMethods< ArrayQueue< T >, T >inline
tpartition(Operation &&op) constAleph::FunctionalMethods< 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() (defined in Aleph::MemArray< T >)Aleph::MemArray< T >inline

Leandro Rabindranath León