Gecode::Iter::Ranges::NaryAppend< I > Class Template Reference
[Range iterators]
Inherits Gecode::Iter::Ranges::MinMax.
Detailed Description
template<class I>
class Gecode::Iter::Ranges::NaryAppend< I >
Range iterator for appending arbitrarily many iterators.
The iterators are allowed to be adjacent but not to overlap (in this case, use Gecode::Iter::NaryUnion)
Definition at line 85 of file ranges-append.icc.
Constructors and initialization | |
| NaryAppend (void) | |
| Default constructor. | |
| NaryAppend (I *i, unsigned int n) | |
| Initialize with n iterators in i. | |
| void | init (I *i, unsigned int n) |
| Initialize with n iterators in i. | |
Iteration control | |
| void | operator++ (void) |
| Move iterator to next range (if possible). | |
Protected Attributes | |
| I * | r |
| The array of iterators to be appended. | |
| unsigned int | n |
| Number of iterators. | |
| unsigned int | active |
| Number of current iterator being processed. | |
Constructor & Destructor Documentation
template<class I>
| Gecode::Iter::Ranges::NaryAppend< I >::NaryAppend | ( | void | ) | [inline] |
template<class I>
| Gecode::Iter::Ranges::NaryAppend< I >::NaryAppend | ( | I * | i, | |
| unsigned int | n | |||
| ) | [inline] |
Member Function Documentation
template<class I>
| void Gecode::Iter::Ranges::NaryAppend< I >::init | ( | I * | i, | |
| unsigned int | n | |||
| ) | [inline] |
template<class I>
| void Gecode::Iter::Ranges::NaryAppend< I >::operator++ | ( | void | ) | [inline] |
Member Data Documentation
template<class I>
I* Gecode::Iter::Ranges::NaryAppend< I >::r [protected] |
template<class I>
unsigned int Gecode::Iter::Ranges::NaryAppend< I >::n [protected] |
template<class I>
unsigned int Gecode::Iter::Ranges::NaryAppend< I >::active [protected] |
The documentation for this class was generated from the following file:
- gecode/iter/ranges-append.icc (Revision: 4973)