ranges-operations.hpp
Go to the documentation of this file.
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2004
*
* This file is part of Gecode, the generic constraint
* development environment:
* http://www.gecode.org
*
* Permission is hereby granted, free of charge, to any person obtaining
* a copy of this software and associated documentation files (the
* "Software"), to deal in the Software without restriction, including
* without limitation the rights to use, copy, modify, merge, publish,
* distribute, sublicense, and/or sell copies of the Software, and to
* permit persons to whom the Software is furnished to do so, subject to
* the following conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
* MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
* LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
* OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
* WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
*
*/
namespace Gecode { namespace Iter { namespace Ranges {
template<class I>
unsigned int size(I& i);
template<class I, class J>
bool equal(I& i, J& j);
template<class I, class J>
bool subset(I& i, J& j);
template<class I, class J>
bool disjoint(I& i, J& j);
enum CompareStatus {
CS_SUBSET,
CS_DISJOINT,
CS_NONE
};
template<class I, class J>
CompareStatus compare(I& i, J& j);
template<class I>
inline unsigned int
size(I& i) {
unsigned int s = 0;
while (i()) {
s += i.width(); ++i;
}
return s;
}
template<class I, class J>
forceinline bool
equal(I& i, J& j) {
// Are i and j equal?
while (i() && j())
if ((i.min() == j.min()) && (i.max() == j.max())) {
++i; ++j;
} else {
return false;
}
return !i() && !j();
}
template<class I, class J>
forceinline bool
subset(I& i, J& j) {
// Is i subset of j?
while (i() && j())
if (j.max() < i.min()) {
++j;
} else if ((i.min() >= j.min()) && (i.max() <= j.max())) {
++i;
} else {
return false;
}
return !i();
}
template<class I, class J>
forceinline bool
disjoint(I& i, J& j) {
// Are i and j disjoint?
while (i() && j())
if (j.max() < i.min()) {
++j;
} else if (i.max() < j.min()) {
++i;
} else {
return false;
}
return true;
}
template<class I, class J>
forceinline CompareStatus
compare(I& i, J& j) {
bool subset = true;
bool disjoint = true;
while (i() && j()) {
if (j.max() < i.min()) {
++j;
} else if (i.max() < j.min()) {
++i; subset = false;
} else if ((i.min() >= j.min()) && (i.max() <= j.max())) {
++i; disjoint = false;
} else if (i.max() <= j.max()) {
++i; disjoint = false; subset = false;
} else if (j.max() <= i.max()) {
++j; disjoint = false; subset = false;
}
}
if (i())
subset = false;
if (subset)
return CS_SUBSET;
return disjoint ? CS_DISJOINT : CS_NONE;
}
}}}
// STATISTICS: iter-any
Gecode::Iter::Ranges
Range iterators.
Definition iter.hh:43
Gecode::Iter::Ranges::CompareStatus
CompareStatus
Comapre two iterators with each other.
Definition ranges-operations.hpp:60
Gecode::Iter::Ranges::CS_NONE
@ CS_NONE
Neither of the above.
Definition ranges-operations.hpp:63
Gecode::Iter::Ranges::CS_SUBSET
@ CS_SUBSET
First is subset of second iterator.
Definition ranges-operations.hpp:61
Gecode::Iter::Ranges::CS_DISJOINT
@ CS_DISJOINT
Intersection is empty.
Definition ranges-operations.hpp:62
Gecode::Iter::Ranges::subset
bool subset(I &i, J &j)
Check whether range iterator i is subset of range iterator j.
Definition ranges-operations.hpp:97
Gecode::Iter::Ranges::compare
CompareStatus compare(I &i, J &j)
Check whether range iterator i is a subset of j, or whether they are disjoint.
Definition ranges-operations.hpp:127
Gecode::Iter::Ranges::size
unsigned int size(I &i)
Size of all ranges of range iterator i.
Definition ranges-operations.hpp:74
Gecode::Iter::Ranges::equal
bool equal(I &i, J &j)
Check whether range iterators i and j are equal.
Definition ranges-operations.hpp:84
Gecode::Iter::Ranges::disjoint
bool disjoint(I &i, J &j)
Check whether range iterators i and j are disjoint.
Definition ranges-operations.hpp:112
Gecode::Iter
Range and value iterators.
Definition iter.hh:41
Gecode
Gecode toplevel namespace
forceinline
#define forceinline
Definition config.hpp:187