Gecode::Iter::Ranges::Virt::NaryUnion Class Reference
[Range iterators with virtual member functions]
Range iterator for union for any number of iterators. More...
#include <virtual-ranges-union.hpp>
Classes | |
class | RangeUnionOrder |
Order for iterators: by increasing minimum of next range. More... | |
Protected Attributes | |
RangeUnionOrder | order |
Instance for order. | |
PriorityQueue< Iterator *, RangeUnionOrder > | r |
Priority queue to give access to next range. | |
Constructors and initialization | |
| |
NaryUnion (void) | |
Default constructor. | |
NaryUnion (Iterator **i, int n) | |
Initialize with n iterators in i. | |
Range access | |
| |
virtual int | min (void) const |
Return smallest value of range. | |
virtual int | max (void) const |
Return largest value of range. | |
virtual unsigned int | width (void) const |
Return width of range (distance between minimum and maximum). | |
Iteration control | |
| |
void | operator++ (void) |
Move iterator to next range (if possible). | |
virtual bool | operator() (void) |
Test whether iterator is still at a range or done. |
Detailed Description
Range iterator for union for any number of iterators.
Definition at line 88 of file virtual-ranges-union.hpp.
Constructor & Destructor Documentation
Gecode::Iter::Ranges::Virt::NaryUnion::NaryUnion | ( | void | ) | [inline] |
Default constructor.
Definition at line 223 of file virtual-ranges-union.hpp.
Gecode::Iter::Ranges::Virt::NaryUnion::NaryUnion | ( | Iterator ** | i, | |
int | n | |||
) | [inline] |
Initialize with n iterators in i.
Definition at line 226 of file virtual-ranges-union.hpp.
Member Function Documentation
int Gecode::Iter::Ranges::Virt::NaryUnion::min | ( | void | ) | const [inline, virtual] |
Return smallest value of range.
Reimplemented from Gecode::Iter::Ranges::MinMax.
Definition at line 238 of file virtual-ranges-union.hpp.
int Gecode::Iter::Ranges::Virt::NaryUnion::max | ( | void | ) | const [inline, virtual] |
Return largest value of range.
Reimplemented from Gecode::Iter::Ranges::MinMax.
Definition at line 241 of file virtual-ranges-union.hpp.
unsigned int Gecode::Iter::Ranges::Virt::NaryUnion::width | ( | void | ) | const [inline, virtual] |
Return width of range (distance between minimum and maximum).
Reimplemented from Gecode::Iter::Ranges::MinMax.
Definition at line 244 of file virtual-ranges-union.hpp.
void Gecode::Iter::Ranges::Virt::NaryUnion::operator++ | ( | void | ) | [inline, virtual] |
Move iterator to next range (if possible).
Implements Gecode::Iter::Ranges::Virt::Iterator.
Definition at line 201 of file virtual-ranges-union.hpp.
bool Gecode::Iter::Ranges::Virt::NaryUnion::operator() | ( | void | ) | [inline, virtual] |
Test whether iterator is still at a range or done.
Implements Gecode::Iter::Ranges::Virt::Iterator.
Definition at line 235 of file virtual-ranges-union.hpp.
Member Data Documentation
Instance for order.
Definition at line 98 of file virtual-ranges-union.hpp.
Priority queue to give access to next range.
Definition at line 100 of file virtual-ranges-union.hpp.
The documentation for this class was generated from the following file:
- gecode/iter/virtual-ranges-union.hpp (Revision: 7989)