Designar::DynArray< T > Member List

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

all(Pred &pred) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
all(Pred &&pred=Pred()) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
append(const T &item)	Designar::DynArray< T >	inline
append(T &&item)	Designar::DynArray< T >	inline
at(nat_t i)	Designar::DynArray< T >	inline
at(nat_t i) const	Designar::DynArray< T >	inline
begin()	Designar::DynArray< T >	inline
begin() const	Designar::DynArray< T >	inline
clear()	Designar::DynArray< T >	inline
DataType typedef	Designar::DynArray< T >
DynArray(nat_t cap)	Designar::DynArray< T >	inline
DynArray(nat_t cap, const T &init_val)	Designar::DynArray< T >	inline
DynArray()	Designar::DynArray< T >	inline
DynArray(const DynArray &a)	Designar::DynArray< T >	inline
DynArray(DynArray &&a)	Designar::DynArray< T >	inline
DynArray(const std::initializer_list< T > &)	Designar::DynArray< T >
end()	Designar::DynArray< T >	inline
end() const	Designar::DynArray< T >	inline
equal(const ContainerType2 &c, Eq &eq) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
equal(const ContainerType2 &c, Eq &&eq=Eq()) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
exists(Pred &pred) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
exists(Pred &&pred=Pred()) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
filter(Pred &pred) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
filter(Pred &&pred=Pred()) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
FixedArray()	Designar::FixedArray< T >	inlineprivate
FixedArray(nat_t c)	Designar::FixedArray< T >	inlineprivate
FixedArray(nat_t c, const T &init_value)	Designar::FixedArray< T >	inlineprivate
FixedArray(const FixedArray &a)	Designar::FixedArray< T >	inlineprivate
FixedArray(FixedArray &&a)	Designar::FixedArray< T >	inlineprivate
FixedArray(const std::initializer_list< T > &)	Designar::FixedArray< T >	private
fold(const RetT &init_val, Op &op) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
fold(const RetT &init_val, Op &&op=Op()) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
fold(RetT &&init_val, Op &op) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
fold(RetT &&init_val, Op &&op=Op()) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
for_each(Op &op) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
for_each(Op &&op=Op()) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
get_capacity() const	Designar::DynArray< T >	inline
get_first()	Designar::DynArray< T >	inline
get_first() const	Designar::DynArray< T >	inline
get_last()	Designar::DynArray< T >	inline
get_last() const	Designar::DynArray< T >	inline
insert(nat_t pos, const T &item)	Designar::DynArray< T >	inline
insert(nat_t pos, T &&item)	Designar::DynArray< T >	inline
insert(const T &item)	Designar::DynArray< T >	inline
insert(T &&item)	Designar::DynArray< T >	inline
is_empty() const	Designar::DynArray< T >	inline
is_sorted(Cmp &cmp) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
is_sorted(Cmp &&cmp=Cmp()) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
item_to_pos(T &item)	Designar::FixedArray< T >	inlineprivate
ItemType typedef	Designar::DynArray< T >
KeyType typedef	Designar::DynArray< T >
map(Op &op) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
map(Op &&op=Op()) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
map_if(Op &op, Pred &pred) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
map_if(Op &op, Pred &&pred=Pred()) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
map_if(Op &&op, Pred &pred) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
map_if(Op &&op=Op(), Pred &&pred=Pred()) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
none(Pred &pred) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
none(Pred &&pred=Pred()) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
nth(nat_t i)	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
nth(nat_t i) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
nth_ptr(nat_t i)	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
operator=(const DynArray &a)	Designar::DynArray< T >	inline
operator=(DynArray &&a)	Designar::DynArray< T >	inline
Designar::FixedArray::operator=(const FixedArray &a)	Designar::FixedArray< T >	inlineprivate
Designar::FixedArray::operator=(FixedArray &&a)	Designar::FixedArray< T >	inlineprivate
operator[](nat_t i)	Designar::DynArray< T >	inline
operator[](nat_t i) const	Designar::DynArray< T >	inline
remove(T &item)	Designar::DynArray< T >	inline
remove_closing_breach(T &item)	Designar::DynArray< T >	inline
remove_first()	Designar::DynArray< T >	inline
remove_first_if(Pred &pred)	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
remove_first_if(Pred &&pred=Pred())	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
remove_if(Pred &pred)	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
remove_if(Pred &&pred=Pred())	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
remove_last()	Designar::DynArray< T >	inline
remove_pos(nat_t pos)	Designar::DynArray< T >	inline
remove_pos_closing_breach(nat_t pos)	Designar::DynArray< T >	inline
resize(nat_t)	Designar::FixedArray< T >	private
search_ptr(Pred &pred) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
search_ptr(Pred &&pred=Pred()) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
size() const	Designar::DynArray< T >	inline
SizeType typedef	Designar::DynArray< T >
swap(DynArray &a)	Designar::DynArray< T >	inline
Designar::FixedArray::swap(FixedArray &a)	Designar::FixedArray< T >	inlineprivate
to_array() const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
to_list() const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
ValueType typedef	Designar::DynArray< T >
zip(const ContainerType2 &c) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
zip_eq(const ContainerType2 &c) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
zip_left(const ContainerType2 &c) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
zip_right(const ContainerType2 &c) const	Designar::ContainerAlgorithms< DynArray< T >, T >	inline
~FixedArray()	Designar::FixedArray< T >	inlineprivate