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 64 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
|
||||||||||
|
Default constructor.
Definition at line 186 of file ranges-union.icc. |
|
||||||||||||||||
|
Initialize with n iterators in i.
Definition at line 190 of file ranges-union.icc. |
Member Function Documentation
|
||||||||||||||||
|
Initialize with n iterators in i.
Definition at line 200 of file ranges-union.icc. |
|
||||||||||
|
Move iterator to next range (if possible).
Definition at line 163 of file ranges-union.icc. |
Member Data Documentation
|
|||||
|
Instance for order.
Definition at line 72 of file ranges-union.icc. |
|
|||||
|
Priority queue to give access to next range.
Definition at line 74 of file ranges-union.icc. |
The documentation for this class was generated from the following file:
- gecode/iter/ranges-union.icc (Revision: 3515)