| Overview | Group | Tree | Graph | Deprecated | Index | Concepts |

IloTupleSet.
It contains an internal tuple that is reused at each iteration. There is no allocation of a tuple per iteration.
| Method Summary | |
|---|---|
public | IloTupleIterator(IloTupleSet coll) |
public IloBool | ok() const |
public IloTuple | operator*() |
public void | operator++() |
| Method Detail |
|---|
Creates an iterator on the given collection.
The collection is frozen: you cannot commit on it until you end the iterator.
This member function returns IloTrue if there is a current element
and the invoking iterator points to it. Otherwise, it returns IloFalse.
To traverse the elements of a finite set of pointers, use the following code:
IloTuple val;
for(IloTupleIterator iter(set); iter.ok(); ++iter){
val = *iter;
// do something with val
}IloTrue if there is a current element
and the invoking iterator points to it. This operator returns the current tuple, the one to which the invoking iterator points.
This operator makes the iterator point to the next value in the data set.