DeSiGNAR
0.5a
Data Structures General Library
|
#include <range.H>
Additional Inherited Members | |
Public Types inherited from Designar::Range< long long > | |
using | ItemType = long long |
using | KeyType = long long |
using | DataType = long long |
using | ValueType = long long |
using | SizeType = nat_t |
Public Member Functions inherited from Designar::Range< long long > | |
Range (long long_first, long long_last, long long_step=long long(1)) | |
Range (long long_last) | |
Range () | |
long long | min () const |
long long | max () const |
long long | step_size () const |
nat_t | size () const |
bool | operator== (const Range &r) const |
bool | operator!= (const Range &r) const |
Iterator | begin () const |
Iterator | end () const |
Public Member Functions inherited from Designar::ContainerAlgorithms< Range< long long >, long long > | |
long long * | nth_ptr (nat_t i) |
long long & | nth (nat_t i) |
const long long & | nth (nat_t i) const |
void | for_each (Op &op) const |
void | for_each (Op &&op=Op()) const |
ContainerRet | filter (Pred &pred) const |
ContainerRet | filter (Pred &&pred=Pred()) const |
ContainerRet | map (Op &op) const |
ContainerRet | map (Op &&op=Op()) const |
ContainerRet | map_if (Op &op, Pred &pred) const |
ContainerRet | map_if (Op &op, Pred &&pred=Pred()) const |
ContainerRet | map_if (Op &&op, Pred &pred) const |
ContainerRet | map_if (Op &&op=Op(), Pred &&pred=Pred()) const |
RetT | fold (const RetT &init_val, Op &op) const |
RetT | fold (const RetT &init_val, Op &&op=Op()) const |
RetT | fold (RetT &&init_val, Op &op) const |
RetT | fold (RetT &&init_val, Op &&op=Op()) const |
bool | all (Pred &pred) const |
bool | all (Pred &&pred=Pred()) const |
bool | exists (Pred &pred) const |
bool | exists (Pred &&pred=Pred()) const |
bool | none (Pred &pred) const |
bool | none (Pred &&pred=Pred()) const |
long long * | search_ptr (Pred &pred) const |
long long * | search_ptr (Pred &&pred=Pred()) const |
bool | remove_first_if (Pred &pred) |
bool | remove_first_if (Pred &&pred=Pred()) |
void | remove_if (Pred &pred) |
void | remove_if (Pred &&pred=Pred()) |
bool | equal (const ContainerType2 &c, Eq &eq) const |
bool | equal (const ContainerType2 &c, Eq &&eq=Eq()) const |
bool | is_sorted (Cmp &cmp) const |
bool | is_sorted (Cmp &&cmp=Cmp()) const |
SLList< std::pair< long long, typename ContainerType2::KeyType > > | zip (const ContainerType2 &c) const |
SLList< std::pair< long long, typename ContainerType2::KeyType > > | zip_eq (const ContainerType2 &c) const |
SLList< std::pair< long long, typename ContainerType2::KeyType > > | zip_left (const ContainerType2 &c) const |
SLList< std::pair< long long, typename ContainerType2::KeyType > > | zip_right (const ContainerType2 &c) const |
DynArray< long long > | to_array () const |
SLList< long long > | to_list () const |