libdballe
7.6
|
Public Member Functions | |
Iterunion (const Iterunion< T > &sg) | |
Iterunion (std::unique_ptr< Sequences< T > > &sequences) | |
Iterunion< T > & | operator= (const Iterunion< T > &sg) |
const T & | get () const |
void | find_min () |
Find the next minimum value. More... | |
const T & | operator* () const |
Iterunion< T > & | operator++ () |
![]() | |
SequenceGenerator (const SequenceGenerator< T > &sg) | |
SequenceGenerator (std::unique_ptr< Sequences< T > > &sequences) | |
SequenceGenerator< T > & | operator= (const SequenceGenerator< T > &sg) |
void | clear () |
bool | has_items () const |
bool | operator== (const SequenceGenerator< T > &i) const |
bool | operator!= (const SequenceGenerator< T > &i) const |
Data Fields | |
const T * | minval |
![]() | |
Sequences< T > * | sequences |
void dballe::stl::stlutils::Iterunion< T >::find_min | ( | ) |
Find the next minimum value.
If minval is 0, set it to the minimum value. If minval points to an element, advance all sequences that have that element as minimum value, and set minval to the next minimum value.
Returns false when all sequences are exausted; true if a new minimum value was found.