Value iterator for the intersection of two value iterators.
More...
#include <values-inter.hpp>
Protected Member Functions |
| void | next (void) |
| | Find next element from intersection.
|
Protected Attributes |
| I | i |
| | First iterator.
|
| J | j |
| | Second iterator.
|
Constructors and initialization |
| | Inter (void) |
| | Default constructor.
|
| | Inter (I &i, J &j) |
| | Initialize with values from i and j.
|
| void | init (I &i, J &j) |
| | Initialize with values from i and j.
|
Iteration control |
| bool | operator() (void) const |
| | Test whether iterator is still at a value or done.
|
| void | operator++ (void) |
| | Move iterator to next value (if possible)
|
Value access |
| int | val (void) const |
| | Return current value.
|
Detailed Description
template<class I, class J>
class Gecode::Iter::Values::Inter< I, J >
Value iterator for the intersection of two value iterators.
Definition at line 47 of file values-inter.hpp.
Constructor & Destructor Documentation
template<class I , class J >
template<class I , class J >
Member Function Documentation
template<class I , class J >
template<class I , class J >
template<class I , class J >
template<class I , class J >
template<class I , class J >
Member Data Documentation
template<class I , class J >
template<class I , class J >
The documentation for this class was generated from the following file:
