Overview | Group | Tree | Graph | Index | Concepts |
An instance of this class represents a set of enumerated values. The same
enumerated value will not appear more than once in a set. The elements of a
set are not ordered. The class IloAnySet::Iterator
offers you a way to traverse the elements of such a set.
If you are considering modeling issues where you want to represent repeated
elements or where you want to exploit an indexed order among the elements, then
you might want to look at the class IloAnyArray
instead of this class for sets.
Most member functions in this class contain assert
statements. For
an explanation of the macro NDEBUG
(a way to turn on or turn off these
assert
statements), see the concept
Assert and NDEBUG.
See Also:
IloAny, IloAnyArray, IloAnySet::Iterator
Constructor Summary | |
---|---|
public | IloAnySet(const IloEnv, const IloAnyArray) |
public | IloAnySet(const IloEnv) |
Method Summary | |
---|---|
public void | add(IloAnySet) |
public void | add(IloAny) |
public IloBool | contains(IloAnySet) |
public IloBool | contains(IloAny) |
public IloAnySet | copy() |
public void | empty() |
public void | end() |
public IloEnv | getEnv() |
public IloInt | getSize() |
public IloBool | intersects(IloAnySet) |
public void | remove(IloAnySet) |
public void | remove(IloAny) |
public void | setIntersection(IloAnySet) |
public void | setIntersection(IloAny) |
Inner Class | |
---|---|
IloAnySet::Iterator |
An iterator to traverse the elements of IloAnySet .
|
Constructor Detail |
---|
This constructor creates a set of enumerated values for env
from the elements in array
.
This constructor creates an empty set (no elements) for env
.
You must use the member function IloAnySet::add
to fill this set
with elements.
Method Detail |
---|
This member function adds set
to the invoking set. By adds, we
mean that the invoking set becomes the union of its former elements and the
elements of set
.
This member function adds elt
to the invoking set. By adds, we
mean that the invoking set becomes the union of its former elements and the new
elt
.
This member function returns a Boolean value (zero or one) that indicates whether
set
intersects the invoking set. The value one indicates that the
invoking set contains all the elements of set
, and that the intersection
of the invoking set with set
is precisely set. The value zero indicates
that the intersection of the invoking set set
is not precisely
set
.
This member function returns a Boolean value (zero or one) that indicates whether
elt
is an element of the invoking set. The value one indicates that the
invoking set contains elt
; the value zero indicates that the invoking
set does not contain elt
.
This member functions creates a clone of the array.
This member function removes the elements from the invoking set. In other words, the invoking set becomes the empty set.
This member functions reclaims memory associated with the invoking set.
This member function returns the environment of the invoking set.
This member function returns an integer indicating the size of the invoking set (that is, how many elements it contains).
This member function returns a Boolean value (zero or one) that indicates whether
set
intersects the invoking set. The value one indicates that the
intersection of set
and the invoking set is not empty (at least one
element in common); the value zero indicates that the intersection of set
and the invoking set is empty (no elements in common).
This member function removes all the elements of set
from the
invoking set.
This member function removes elt
from the invoking set.
This member function changes the invoking set so that it includes only the
elements of set
. In other words, the invoking set becomes the
intersection of its former elements with the elements of set
.
This member function changes the invoking set so that it includes only the
element indicated by elt
. In other words, the invoking set becomes
the intersection of its former elements with elt
.