
Range iterator for union for any number of iterators. More...
#include <ranges-union.hpp>
Protected Member Functions | |
| RangeList * | range (RangeList *&f, int min, int max) |
| Create new range possibly from freelist f and init. | |
| RangeList * | range (RangeList *&f, I &i) |
| Create new range possibly from freelist f and init. | |
Constructors and initialization | |
| NaryUnion (void) | |
| Default constructor. | |
| NaryUnion (Region &r, I *i, int n) | |
| Initialize with n iterators in i. | |
| void | init (Region &r, I *i, int n) |
| Initialize with n iterators in i. | |
| NaryUnion & | operator= (const NaryUnion &m) |
| Assignment operator. | |
Range iterator for union for any number of iterators.
Definition at line 79 of file ranges-union.hpp.
| Gecode::Iter::Ranges::NaryUnion< I >::NaryUnion | ( | void | ) | [inline] |
Default constructor.
Definition at line 165 of file ranges-union.hpp.
| Gecode::Iter::Ranges::NaryUnion< I >::NaryUnion | ( | Region & | r, |
| I * | i, | ||
| int | n | ||
| ) | [inline] |
Initialize with n iterators in i.
Definition at line 320 of file ranges-union.hpp.
| RangeListIter::RangeList * Gecode::Iter::Ranges::NaryUnion< I >::range | ( | RangeList *& | f, |
| int | min, | ||
| int | max | ||
| ) | [inline, protected] |
Create new range possibly from freelist f and init.
Definition at line 169 of file ranges-union.hpp.
| RangeListIter::RangeList * Gecode::Iter::Ranges::NaryUnion< I >::range | ( | RangeList *& | f, |
| I & | i | ||
| ) | [inline, protected] |
Create new range possibly from freelist f and init.
Definition at line 183 of file ranges-union.hpp.
| void Gecode::Iter::Ranges::NaryUnion< I >::init | ( | Region & | r, |
| I * | i, | ||
| int | n | ||
| ) |
Initialize with n iterators in i.
Definition at line 189 of file ranges-union.hpp.
| NaryUnion< I > & Gecode::Iter::Ranges::NaryUnion< I >::operator= | ( | const NaryUnion< I > & | m | ) | [inline] |
Assignment operator.
Definition at line 326 of file ranges-union.hpp.