Gecode::Iter::Ranges::NaryUnion< I > Class Template Reference
[Range iterators]
Inherits Gecode::Iter::Ranges::MinMax.
Detailed Description
template<class I>
class Gecode::Iter::Ranges::NaryUnion< I >
Range iterator for union for any number of iterators.
Definition at line 77 of file ranges-union.icc.
Constructors and initialization | |
| NaryUnion (void) | |
| Default constructor. | |
| NaryUnion (I *i, int n) | |
| Initialize with n iterators in i. | |
| void | init (I *i, int n) |
| Initialize with n iterators in i. | |
Iteration control | |
| void | operator++ (void) |
| Move iterator to next range (if possible). | |
Protected Attributes | |
| RangeUnionOrder | order |
| Instance for order. | |
| Support::PQueue< I, RangeUnionOrder > | r |
| Priority queue to give access to next range. | |
Classes | |
| class | RangeUnionOrder |
| Order for iterators: by increasing minimum of next range. More... | |
Constructor & Destructor Documentation
template<class I>
| Gecode::Iter::Ranges::NaryUnion< I >::NaryUnion | ( | void | ) | [inline] |
template<class I>
| Gecode::Iter::Ranges::NaryUnion< I >::NaryUnion | ( | I * | i, | |
| int | n | |||
| ) | [inline] |
Member Function Documentation
template<class I>
| void Gecode::Iter::Ranges::NaryUnion< I >::init | ( | I * | i, | |
| int | n | |||
| ) | [inline] |
template<class I>
| void Gecode::Iter::Ranges::NaryUnion< I >::operator++ | ( | void | ) | [inline] |
Member Data Documentation
template<class I>
RangeUnionOrder Gecode::Iter::Ranges::NaryUnion< I >::order [protected] |
template<class I>
Support::PQueue<I,RangeUnionOrder> Gecode::Iter::Ranges::NaryUnion< I >::r [protected] |
The documentation for this class was generated from the following file:
- gecode/iter/ranges-union.icc (Revision: 4973)