DeSiGNAR  0.5a
Data Structures General Library
Designar::Range< T > Member List

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

all(Pred &pred) constDesignar::ContainerAlgorithms< Range< T >, T >inline
all(Pred &&pred=Pred()) constDesignar::ContainerAlgorithms< Range< T >, T >inline
begin() const Designar::Range< T >inline
DataType typedefDesignar::Range< T >
end() const Designar::Range< T >inline
equal(const ContainerType2 &c, Eq &eq) constDesignar::ContainerAlgorithms< Range< T >, T >inline
equal(const ContainerType2 &c, Eq &&eq=Eq()) constDesignar::ContainerAlgorithms< Range< T >, T >inline
exists(Pred &pred) constDesignar::ContainerAlgorithms< Range< T >, T >inline
exists(Pred &&pred=Pred()) constDesignar::ContainerAlgorithms< Range< T >, T >inline
filter(Pred &pred) constDesignar::ContainerAlgorithms< Range< T >, T >inline
filter(Pred &&pred=Pred()) constDesignar::ContainerAlgorithms< Range< T >, T >inline
fold(const RetT &init_val, Op &op) constDesignar::ContainerAlgorithms< Range< T >, T >inline
fold(const RetT &init_val, Op &&op=Op()) constDesignar::ContainerAlgorithms< Range< T >, T >inline
fold(RetT &&init_val, Op &op) constDesignar::ContainerAlgorithms< Range< T >, T >inline
fold(RetT &&init_val, Op &&op=Op()) constDesignar::ContainerAlgorithms< Range< T >, T >inline
for_each(Op &op) constDesignar::ContainerAlgorithms< Range< T >, T >inline
for_each(Op &&op=Op()) constDesignar::ContainerAlgorithms< Range< T >, T >inline
is_sorted(Cmp &cmp) constDesignar::ContainerAlgorithms< Range< T >, T >inline
is_sorted(Cmp &&cmp=Cmp()) constDesignar::ContainerAlgorithms< Range< T >, T >inline
ItemType typedefDesignar::Range< T >
KeyType typedefDesignar::Range< T >
map(Op &op) constDesignar::ContainerAlgorithms< Range< T >, T >inline
map(Op &&op=Op()) constDesignar::ContainerAlgorithms< Range< T >, T >inline
map_if(Op &op, Pred &pred) constDesignar::ContainerAlgorithms< Range< T >, T >inline
map_if(Op &op, Pred &&pred=Pred()) constDesignar::ContainerAlgorithms< Range< T >, T >inline
map_if(Op &&op, Pred &pred) constDesignar::ContainerAlgorithms< Range< T >, T >inline
map_if(Op &&op=Op(), Pred &&pred=Pred()) constDesignar::ContainerAlgorithms< Range< T >, T >inline
max() const Designar::Range< T >inline
min() const Designar::Range< T >inline
none(Pred &pred) constDesignar::ContainerAlgorithms< Range< T >, T >inline
none(Pred &&pred=Pred()) constDesignar::ContainerAlgorithms< Range< T >, T >inline
nth(nat_t i)Designar::ContainerAlgorithms< Range< T >, T >inline
nth(nat_t i) constDesignar::ContainerAlgorithms< Range< T >, T >inline
nth_ptr(nat_t i)Designar::ContainerAlgorithms< Range< T >, T >inline
operator!=(const Range &r) const Designar::Range< T >inline
operator==(const Range &r) const Designar::Range< T >inline
Range(T _first, T _last, T _step=T(1))Designar::Range< T >inline
Range(T _last)Designar::Range< T >inline
Range()Designar::Range< T >inline
remove_first_if(Pred &pred)Designar::ContainerAlgorithms< Range< T >, T >inline
remove_first_if(Pred &&pred=Pred())Designar::ContainerAlgorithms< Range< T >, T >inline
remove_if(Pred &pred)Designar::ContainerAlgorithms< Range< T >, T >inline
remove_if(Pred &&pred=Pred())Designar::ContainerAlgorithms< Range< T >, T >inline
search_ptr(Pred &pred) constDesignar::ContainerAlgorithms< Range< T >, T >inline
search_ptr(Pred &&pred=Pred()) constDesignar::ContainerAlgorithms< Range< T >, T >inline
size() const Designar::Range< T >inline
SizeType typedefDesignar::Range< T >
step_size() const Designar::Range< T >inline
to_array() constDesignar::ContainerAlgorithms< Range< T >, T >inline
to_list() constDesignar::ContainerAlgorithms< Range< T >, T >inline
ValueType typedefDesignar::Range< T >
zip(const ContainerType2 &c) constDesignar::ContainerAlgorithms< Range< T >, T >inline
zip_eq(const ContainerType2 &c) constDesignar::ContainerAlgorithms< Range< T >, T >inline
zip_left(const ContainerType2 &c) constDesignar::ContainerAlgorithms< Range< T >, T >inline
zip_right(const ContainerType2 &c) constDesignar::ContainerAlgorithms< Range< T >, T >inline