ranges-operations.icc File Reference
(Revision: 3188)
Go to the source code of this file.
Namespaces | |
| namespace | Gecode |
| namespace | Gecode::Iter |
| namespace | Gecode::Iter::Ranges |
Enumerations | |
| enum | Gecode::Iter::Ranges::SubsumtionStatus { Gecode::Iter::Ranges::SS_SUBSUMED, Gecode::Iter::Ranges::SS_EMPTY, Gecode::Iter::Ranges::SS_NONE } |
| Is one iterator subsumed by another, or is the intersection empty? More... | |
Functions | |
| template<class I> | |
| unsigned int | Gecode::Iter::Ranges::size (I &i) |
| Size of all ranges of range iterator i. | |
| template<class I, class J> | |
| bool | Gecode::Iter::Ranges::equal (I &i, J &j) |
| Check whether range iterators i and j are equal. | |
| template<class I, class J> | |
| bool | Gecode::Iter::Ranges::subset (I &i, J &j) |
| Check whether range iterator i is subset of range iterator j. | |
| template<class I, class J> | |
| bool | Gecode::Iter::Ranges::disjoint (I &i, J &j) |
| Check whether range iterators i and j are disjoint. | |
| template<class I, class J> | |
| SubsumtionStatus | Gecode::Iter::Ranges::subsumes (I &i, J &j) |
| Check whether range iterator i subsumes j, or whether intersection is empty. | |