dom.cpp
Go to the documentation of this file.
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Guido Tack, 2005
*
* 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.
*
*/
#include <gecode/minimodel.hh>
#include "test/set.hh"
using namespace Gecode;
namespace Test { namespace Set {
namespace Dom {
static const int d1r[4][2] = {
{-4,-3},{-1,-1},{1,1},{3,5}
};
static IntSet d1(d1r,4);
static const int d1cr[5][2] = {
{Gecode::Set::Limits::min,-5},
{-2,-2},{0,0},{2,2},
{6,Gecode::Set::Limits::max}
};
static IntSet d1c(d1cr,5);
static IntSet ds_33(-3,3);
static const int d2r[2][2] = {
{Gecode::Set::Limits::min,-4}, {4,Gecode::Set::Limits::max}
};
static IntSet ds_33c(d2r,2);
namespace {
static int minSymDiff(const SetAssignment& x, int i, const IntSet& is) {
typedef Iter::Ranges::Diff<CountableSetRanges,IntSetRanges> DiffA;
CountableSetRanges xr00(x.lub, x[i]);
IntSetRanges xr10(is);
DiffA a(xr00,xr10);
typedef Iter::Ranges::Diff<IntSetRanges,CountableSetRanges> DiffB;
CountableSetRanges xr01(x.lub, x[i]);
IntSetRanges xr11(is);
DiffB b(xr11,xr01);
Iter::Ranges::Union<DiffA,DiffB> u(a,b);
return u() ? u.min() : Gecode::Set::Limits::max+1;
}
template<class I>
static bool in(int i, I& c, bool eq=false) {
if (eq && i==Gecode::Set::Limits::max+1)
return true;
Iter::Ranges::Singleton s(i,i);
return Iter::Ranges::subset(s,c);
}
}
class DomRange : public SetTest {
private:
Gecode::SetRelType srt;
IntSet is;
public:
DomRange(SetRelType srt0, int n) :
SetTest("Dom::Range::"+str(srt0)+"::"+str(n),n,ds_33,(n == 1)),
srt(srt0), is(srt == Gecode::SRT_CMPL ? ds_33c: ds_33) {}
virtual bool solution(const SetAssignment& x) const {
for (int i=x.size(); i--; ) {
CountableSetRanges xr(x.lub, x[i]);
IntSetRanges dr(is);
switch (srt) {
case SRT_EQ:
if (!Iter::Ranges::equal(xr, dr))
return false;
break;
case SRT_LQ:
if (!((!xr()) || in(minSymDiff(x,i,is),dr,true)))
return false;
break;
case SRT_LE:
if (!(xr() ? in(minSymDiff(x,i,is),dr) : dr()))
return false;
break;
case SRT_GQ:
if (!((!dr()) || in(minSymDiff(x,i,is),xr,true)))
return false;
break;
case SRT_GR:
if (!(dr() ? in(minSymDiff(x,i,is),xr) : xr()))
return false;
break;
case SRT_NQ:
if (Iter::Ranges::equal(xr, dr))
return false;
break;
case SRT_SUB:
if (!Iter::Ranges::subset(xr, dr))
return false;
break;
case SRT_SUP:
if (!Iter::Ranges::subset(dr, xr))
return false;
break;
case SRT_DISJ:
{
Gecode::Iter::Ranges::Inter<CountableSetRanges,IntSetRanges>
inter(xr, dr);
if (inter())
return false;
}
break;
case SRT_CMPL:
{
Gecode::Set::RangesCompl<IntSetRanges> drc(dr);
if (!Iter::Ranges::equal(xr,drc))
return false;
}
break;
default: GECODE_NEVER;
}
}
return true;
}
virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
if (x.size() == 1)
Gecode::dom(home, x[0], srt, is);
else
Gecode::dom(home, x, srt, is);
}
virtual void post(Space& home, SetVarArray& x, IntVarArray&, Reify r) {
assert(x.size() == 1);
if (Base::rand(2) != 0) {
Gecode::dom(home, x[0], srt, is, r);
} else {
switch (r.mode()) {
case Gecode::RM_EQV:
Gecode::rel(home, Gecode::dom(x[0], srt, is) == r.var()); break;
case Gecode::RM_IMP:
Gecode::rel(home, Gecode::dom(x[0], srt, is) << r.var()); break;
case Gecode::RM_PMI:
Gecode::rel(home, Gecode::dom(x[0], srt, is) >> r.var()); break;
default: GECODE_NEVER;
}
}
}
};
class DomIntRange : public SetTest {
private:
Gecode::SetRelType srt;
public:
DomIntRange(Gecode::SetRelType srt0, int n)
: SetTest("Dom::IntRange::"+str(srt0)+"::"+str(n),1,ds_33,n==1),
srt(srt0) {}
virtual bool solution(const SetAssignment& x) const {
for (int i=x.size(); i--; ) {
CountableSetRanges xr(x.lub, x[i]);
IntSet is(-3,-1);
IntSetRanges dr(is);
switch (srt) {
case SRT_EQ:
if (!Iter::Ranges::equal(xr, dr))
return false;
break;
case SRT_LQ:
if (!((!xr()) || in(minSymDiff(x,i,is),dr,true)))
return false;
break;
case SRT_LE:
if (!(xr() ? in(minSymDiff(x,i,is),dr) : dr()))
return false;
break;
case SRT_GQ:
if (!((!dr()) || in(minSymDiff(x,i,is),xr,true)))
return false;
break;
case SRT_GR:
if (!(dr() ? in(minSymDiff(x,i,is),xr) : xr()))
return false;
break;
case SRT_NQ:
if (!(!Iter::Ranges::equal(xr, dr)))
return false;
break;
case SRT_SUB:
if (!(Iter::Ranges::subset(xr, dr)))
return false;
break;
case SRT_SUP:
if (!(Iter::Ranges::subset(dr, xr)))
return false;
break;
case SRT_DISJ:
{
Gecode::Iter::Ranges::Inter<CountableSetRanges,IntSetRanges>
inter(xr, dr);
if (inter())
return false;
}
break;
case SRT_CMPL:
{
Gecode::Set::RangesCompl<IntSetRanges> drc(dr);
if (!Iter::Ranges::equal(xr,drc))
return false;
}
break;
default: GECODE_NEVER;
}
}
return true;
}
virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
if (x.size() == 1)
Gecode::dom(home, x[0], srt, -3, -1);
else
Gecode::dom(home, x, srt, -3, -1);
}
virtual void post(Space& home, SetVarArray& x, IntVarArray&, Reify r) {
assert(x.size() == 1);
if (Base::rand(2) != 0) {
Gecode::dom(home, x[0], srt, -3, -1, r);
} else {
switch (r.mode()) {
case Gecode::RM_EQV:
Gecode::rel(home, Gecode::dom(x[0], srt, -3, -1) == r.var()); break;
case Gecode::RM_IMP:
Gecode::rel(home, Gecode::dom(x[0], srt, -3, -1) << r.var()); break;
case Gecode::RM_PMI:
Gecode::rel(home, Gecode::dom(x[0], srt, -3, -1) >> r.var()); break;
default: GECODE_NEVER;
}
}
}
};
class DomInt : public SetTest {
private:
Gecode::SetRelType srt;
public:
DomInt(Gecode::SetRelType srt0, int n) :
SetTest("Dom::Int::"+str(srt0)+"::"+str(n),n,ds_33,n==1),
srt(srt0) {}
virtual bool solution(const SetAssignment& x) const {
IntSet is(-3,-3);
for (int i=x.size(); i--; ) {
CountableSetRanges xr(x.lub, x[i]);
IntSetRanges dr(is);
switch (srt) {
case SRT_EQ:
if (!Iter::Ranges::equal(xr, dr))
return false;
break;
case SRT_LQ:
if (!((!xr()) || in(minSymDiff(x,i,is),dr,true)))
return false;
break;
case SRT_LE:
if (!(xr() ? in(minSymDiff(x,i,is),dr) : dr()))
return false;
break;
case SRT_GQ:
if (!((!dr()) || in(minSymDiff(x,i,is),xr,true)))
return false;
break;
case SRT_GR:
if (!(dr() ? in(minSymDiff(x,i,is),xr) : xr()))
return false;
break;
case SRT_NQ:
if (Iter::Ranges::equal(xr, dr))
return false;
break;
case SRT_SUB:
if (!(Iter::Ranges::subset(xr, dr)))
return false;
break;
case SRT_SUP:
if (!(Iter::Ranges::subset(dr, xr)))
return false;
break;
case SRT_DISJ:
{
Gecode::Iter::Ranges::Inter<CountableSetRanges,IntSetRanges>
inter(xr, dr);
if (inter())
return false;
break;
}
case SRT_CMPL:
{
Gecode::Set::RangesCompl<IntSetRanges> drc(dr);
if (!Iter::Ranges::equal(xr,drc))
return false;
break;
}
default: GECODE_NEVER;
}
}
return true;
}
virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
if (x.size() == 1)
Gecode::dom(home, x[0], srt, -3);
else
Gecode::dom(home, x, srt, -3);
}
virtual void post(Space& home, SetVarArray& x, IntVarArray&, Reify r) {
assert(x.size() == 1);
if (Base::rand(2) != 0) {
Gecode::dom(home, x[0], srt, -3, r);
} else {
switch (r.mode()) {
case Gecode::RM_EQV:
Gecode::rel(home, Gecode::dom(x[0], srt, -3) == r.var()); break;
case Gecode::RM_IMP:
Gecode::rel(home, Gecode::dom(x[0], srt, -3) << r.var()); break;
case Gecode::RM_PMI:
Gecode::rel(home, Gecode::dom(x[0], srt, -3) >> r.var()); break;
default: GECODE_NEVER;
}
}
}
};
class DomDom : public SetTest {
private:
Gecode::SetRelType srt;
Gecode::IntSet is;
public:
DomDom(Gecode::SetRelType srt0, int n) :
SetTest("Dom::Dom::"+str(srt0)+"::"+str(n),n,d1,(n == 1)),
srt(srt0), is(srt == Gecode::SRT_CMPL ? d1c: d1) {}
virtual bool solution(const SetAssignment& x) const {
for (int i=x.size(); i--; ) {
CountableSetRanges xr(x.lub, x[i]);
IntSetRanges dr(is);
switch (srt) {
case SRT_EQ:
if (!Iter::Ranges::equal(xr, dr))
return false;
break;
case SRT_LQ:
if (!((!xr()) || in(minSymDiff(x,i,is),dr,true)))
return false;
break;
case SRT_LE:
if (!(xr() ? in(minSymDiff(x,i,is),dr) : dr()))
return false;
break;
case SRT_GQ:
if (!((!dr()) || in(minSymDiff(x,i,is),xr,true)))
return false;
break;
case SRT_GR:
if (!(dr() ? in(minSymDiff(x,i,is),xr) : xr()))
return false;
break;
case SRT_NQ:
if (Iter::Ranges::equal(xr, dr))
return false;
break;
case SRT_SUB:
if (!Iter::Ranges::subset(xr, dr))
return false;
break;
case SRT_SUP:
if (!Iter::Ranges::subset(dr, xr))
return false;
break;
case SRT_DISJ:
{
Gecode::Iter::Ranges::Inter<CountableSetRanges,IntSetRanges>
inter(xr, dr);
if (inter())
return false;
}
break;
case SRT_CMPL:
{
Gecode::Set::RangesCompl<IntSetRanges> drc(dr);
if (!Iter::Ranges::equal(xr,drc))
return false;
}
break;
default: GECODE_NEVER;
}
}
return true;
}
virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
if (x.size() == 1)
Gecode::dom(home, x[0], srt, is);
else
Gecode::dom(home, x, srt, is);
}
virtual void post(Space& home, SetVarArray& x, IntVarArray&, Reify r) {
assert(x.size() == 1);
Gecode::dom(home, x[0], srt, is, r);
}
};
class CardRange : public SetTest {
public:
CardRange(int n)
: SetTest("Dom::CardRange::"+str(n),n,d1,false) {}
virtual bool solution(const SetAssignment& x) const {
for (int i=x.size(); i--; ) {
CountableSetRanges xr(x.lub, x[i]);
unsigned int card = Iter::Ranges::size(xr);
if ((card < 2) || (card > 3))
return false;
}
return true;
}
virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
if (x.size() == 1)
Gecode::cardinality(home, x[0], 2, 3);
else
Gecode::cardinality(home, x, 2, 3);
}
};
DomRange _domrange_eq1(SRT_EQ,1);
DomRange _domrange_lq1(SRT_LQ,1);
DomRange _domrange_le1(SRT_LE,1);
DomRange _domrange_gq1(SRT_GQ,1);
DomRange _domrange_gr1(SRT_GR,1);
DomRange _domrange_nq1(SRT_NQ,1);
DomRange _domrange_sub1(SRT_SUB,1);
DomRange _domrange_sup1(SRT_SUP,1);
DomRange _domrange_disj1(SRT_DISJ,1);
DomRange _domrange_cmpl1(SRT_CMPL,1);
DomRange _domrange_eq2(SRT_EQ,2);
DomRange _domrange_lq2(SRT_LQ,2);
DomRange _domrange_le2(SRT_LE,2);
DomRange _domrange_gq2(SRT_GQ,2);
DomRange _domrange_gr2(SRT_GR,2);
DomRange _domrange_nq2(SRT_NQ,2);
DomRange _domrange_sub2(SRT_SUB,2);
DomRange _domrange_sup2(SRT_SUP,2);
DomRange _domrange_disj2(SRT_DISJ,2);
DomRange _domrange_cmpl2(SRT_CMPL,2);
DomIntRange _domintrange_eq1(SRT_EQ,1);
DomIntRange _domintrange_lq1(SRT_LQ,1);
DomIntRange _domintrange_le1(SRT_LE,1);
DomIntRange _domintrange_gq1(SRT_GQ,1);
DomIntRange _domintrange_gr1(SRT_GR,1);
DomIntRange _domintrange_nq1(SRT_NQ,1);
DomIntRange _domintrange_sub1(SRT_SUB,1);
DomIntRange _domintrange_sup1(SRT_SUP,1);
DomIntRange _domintrange_disj1(SRT_DISJ,1);
DomIntRange _domintrange_cmpl1(SRT_CMPL,1);
DomIntRange _domintrange_eq2(SRT_EQ,2);
DomIntRange _domintrange_lq2(SRT_LQ,2);
DomIntRange _domintrange_le2(SRT_LE,2);
DomIntRange _domintrange_gq2(SRT_GQ,2);
DomIntRange _domintrange_gr2(SRT_GR,2);
DomIntRange _domintrange_nq2(SRT_NQ,2);
DomIntRange _domintrange_sub2(SRT_SUB,2);
DomIntRange _domintrange_sup2(SRT_SUP,2);
DomIntRange _domintrange_disj2(SRT_DISJ,2);
DomIntRange _domintrange_cmpl2(SRT_CMPL,2);
DomInt _domint_eq1(SRT_EQ,1);
DomInt _domint_lq1(SRT_LQ,1);
DomInt _domint_le1(SRT_LE,1);
DomInt _domint_gq1(SRT_GQ,1);
DomInt _domint_gr1(SRT_GR,1);
DomInt _domint_nq1(SRT_NQ,1);
DomInt _domint_sub1(SRT_SUB,1);
DomInt _domint_sup1(SRT_SUP,1);
DomInt _domint_disj1(SRT_DISJ,1);
DomInt _domint_cmpl1(SRT_CMPL,1);
DomInt _domint_eq2(SRT_EQ,2);
DomInt _domint_lq2(SRT_LQ,2);
DomInt _domint_le2(SRT_LE,2);
DomInt _domint_gq2(SRT_GQ,2);
DomInt _domint_gr2(SRT_GR,2);
DomInt _domint_nq2(SRT_NQ,2);
DomInt _domint_sub2(SRT_SUB,2);
DomInt _domint_sup2(SRT_SUP,2);
DomInt _domint_disj2(SRT_DISJ,2);
DomInt _domint_cmpl2(SRT_CMPL,2);
DomDom _domdom_eq1(SRT_EQ,1);
DomDom _domdom_lq1(SRT_LQ,1);
DomDom _domdom_le1(SRT_LE,1);
DomDom _domdom_gq1(SRT_GQ,1);
DomDom _domdom_gr1(SRT_GR,1);
DomDom _domdom_nq1(SRT_NQ,1);
DomDom _domdom_sub1(SRT_SUB,1);
DomDom _domdom_sup1(SRT_SUP,1);
DomDom _domdom_disj1(SRT_DISJ,1);
DomDom _domdom_cmpl1(SRT_CMPL,1);
DomDom _domdom_eq2(SRT_EQ,2);
DomDom _domdom_lq2(SRT_LQ,2);
DomDom _domdom_le2(SRT_LE,2);
DomDom _domdom_gq2(SRT_GQ,2);
DomDom _domdom_gr2(SRT_GR,2);
DomDom _domdom_nq2(SRT_NQ,2);
DomDom _domdom_sub2(SRT_SUB,2);
DomDom _domdom_sup2(SRT_SUP,2);
DomDom _domdom_disj2(SRT_DISJ,2);
DomDom _domdom_cmpl2(SRT_CMPL,2);
CardRange _cr1(1);
CardRange _cr2(2);
}}}
// STATISTICS: test-set
Gecode::IntSetRanges
Range iterator for integer sets.
Definition int.hh:292
Gecode::IntSet
Integer sets.
Definition int.hh:174
Gecode::IntVarArray
Integer variable array.
Definition int.hh:763
Gecode::Iter::Ranges::Diff
Range iterator for computing set difference.
Definition ranges-diff.hpp:43
Gecode::Iter::Ranges::Inter
Range iterator for computing intersection (binary).
Definition ranges-inter.hpp:44
Gecode::Iter::Ranges::MinMax::min
int min(void) const
Return smallest value of range.
Definition ranges-minmax.hpp:99
Gecode::Iter::Ranges::Singleton
Range iterator for singleton range.
Definition ranges-singleton.hpp:42
Gecode::Iter::Ranges::Union
Range iterator for computing union (binary).
Definition ranges-union.hpp:44
Gecode::Reify
Reification specification.
Definition int.hh:876
Gecode::SetVarArray
Set variable array
Definition set.hh:570
Gecode::Set::RangesCompl
A complement iterator spezialized for the BndSet limits.
Definition var-imp.hpp:293
Gecode::Space
Computation spaces.
Definition core.hpp:1742
Gecode::VarArray::size
int size(void) const
Return size of array (number of elements).
Definition array.hpp:926
Test::Base::rand
static Gecode::Support::RandomGenerator rand
Random number generator.
Definition test.hh:134
Test::Set::CountableSetRanges
Range iterator producing subsets of an IntSet.
Definition set.hh:99
Test::Set::Dom::CardRange
Test for cardinality range
Definition dom.cpp:459
Test::Set::Dom::CardRange::post
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
Definition dom.cpp:475
Test::Set::Dom::CardRange::CardRange
CardRange(int n)
Create and register test.
Definition dom.cpp:462
Test::Set::Dom::CardRange::solution
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
Definition dom.cpp:465
Test::Set::Dom::DomDom
Test for equality with a domain
Definition dom.cpp:377
Test::Set::Dom::DomDom::solution
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
Definition dom.cpp:387
Test::Set::Dom::DomDom::post
virtual void post(Space &home, SetVarArray &x, IntVarArray &, Reify r)
Post reified constraint on x for b.
Definition dom.cpp:452
Test::Set::Dom::DomDom::DomDom
DomDom(Gecode::SetRelType srt0, int n)
Create and register test.
Definition dom.cpp:383
Test::Set::Dom::DomDom::post
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
Definition dom.cpp:445
Test::Set::Dom::DomIntRange
Test for equality with an integer range
Definition dom.cpp:187
Test::Set::Dom::DomIntRange::post
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
Definition dom.cpp:255
Test::Set::Dom::DomIntRange::post
virtual void post(Space &home, SetVarArray &x, IntVarArray &, Reify r)
Post reified constraint on x for b.
Definition dom.cpp:262
Test::Set::Dom::DomIntRange::DomIntRange
DomIntRange(Gecode::SetRelType srt0, int n)
Create and register test.
Definition dom.cpp:192
Test::Set::Dom::DomIntRange::solution
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
Definition dom.cpp:196
Test::Set::Dom::DomInt
Test for equality with an integer
Definition dom.cpp:281
Test::Set::Dom::DomInt::post
virtual void post(Space &home, SetVarArray &x, IntVarArray &, Reify r)
Post reified constraint on x for b.
Definition dom.cpp:358
Test::Set::Dom::DomInt::post
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
Definition dom.cpp:351
Test::Set::Dom::DomInt::DomInt
DomInt(Gecode::SetRelType srt0, int n)
Create and register test.
Definition dom.cpp:286
Test::Set::Dom::DomInt::solution
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
Definition dom.cpp:290
Test::Set::Dom::DomRange
Test for equality with a range
Definition dom.cpp:93
Test::Set::Dom::DomRange::post
virtual void post(Space &home, SetVarArray &x, IntVarArray &, Reify r)
Post reified constraint on x for b.
Definition dom.cpp:168
Test::Set::Dom::DomRange::post
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
Definition dom.cpp:161
Test::Set::Dom::DomRange::solution
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
Definition dom.cpp:103
Test::Set::Dom::DomRange::DomRange
DomRange(SetRelType srt0, int n)
Create and register test.
Definition dom.cpp:99
Test::Set::SetAssignment
Generate all set assignments.
Definition set.hh:142
Test::Set::SetAssignment::size
int size(void) const
Return arity.
Definition set.hh:173
Test::Set::SetAssignment::lub
Gecode::IntSet lub
The common superset for all domains.
Definition set.hh:154
Test::Set::SetTest::str
static std::string str(Gecode::SetRelType srt)
Map set relation to string.
Definition set.hpp:46
Test::Set::SetTest::SetTest
SetTest(const std::string &s, int a, const Gecode::IntSet &d, bool r=false, int w=0)
Constructor.
Definition set.hh:304
Gecode::rel
void rel(Home home, FloatVar x0, FloatRelType frt, FloatVar x1)
Post propagator for .
Definition rel.cpp:68
Gecode::RM_IMP
@ RM_IMP
Implication for reification.
Definition int.hh:862
Gecode::RM_PMI
@ RM_PMI
Inverse implication for reification.
Definition int.hh:869
Gecode::RM_EQV
@ RM_EQV
Equivalence for reification (default).
Definition int.hh:855
Gecode::SetRelType
SetRelType
Common relation types for sets.
Definition set.hh:643
Gecode::SRT_GQ
@ SRT_GQ
Greater or equal ( ).
Definition set.hh:652
Gecode::SRT_CMPL
@ SRT_CMPL
Complement.
Definition set.hh:649
Gecode::SRT_GR
@ SRT_GR
Greater ( ).
Definition set.hh:653
Gecode::SRT_LQ
@ SRT_LQ
Less or equal ( ).
Definition set.hh:650
Gecode::SRT_NQ
@ SRT_NQ
Disequality ( ).
Definition set.hh:645
Gecode::SRT_LE
@ SRT_LE
Less ( ).
Definition set.hh:651
Gecode::SRT_EQ
@ SRT_EQ
Equality ( ).
Definition set.hh:644
Gecode::SRT_SUP
@ SRT_SUP
Superset ( ).
Definition set.hh:647
Gecode::SRT_DISJ
@ SRT_DISJ
Disjoint ( ).
Definition set.hh:648
Gecode::SRT_SUB
@ SRT_SUB
Subset ( ).
Definition set.hh:646
minimodel.hh
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::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::Set::Limits::min
const int min
Smallest allowed integer in integer set.
Definition set.hh:99
Gecode::Set::Limits::max
const int max
Largest allowed integer in integer set.
Definition set.hh:97
Gecode
Gecode toplevel namespace
Gecode::dom
void dom(Home home, FloatVar x, FloatVal n)
Propagates .
Definition dom.cpp:40
Gecode::inter
SetExpr inter(const SetVarArgs &)
Intersection of set variables.
Definition set-expr.cpp:696
Gecode::cardinality
LinIntExpr cardinality(const SetExpr &)
Cardinality of set expression.
Definition set-expr.cpp:817
Test::Set::Dom
Tests for domain constraints
Definition dom.cpp:43
Test::Set::Dom::_domintrange_sup1
DomIntRange _domintrange_sup1(SRT_SUP, 1)
Test::Set::Dom::_domintrange_nq1
DomIntRange _domintrange_nq1(SRT_NQ, 1)
Test::Set::Dom::_domint_nq1
DomInt _domint_nq1(SRT_NQ, 1)
Test::Set::Dom::_domrange_le1
DomRange _domrange_le1(SRT_LE, 1)
Test::Set::Dom::_domintrange_sub2
DomIntRange _domintrange_sub2(SRT_SUB, 2)
Test::Set::Dom::_domint_gr1
DomInt _domint_gr1(SRT_GR, 1)
Test::Set::Dom::_domintrange_eq1
DomIntRange _domintrange_eq1(SRT_EQ, 1)
Test::Set::Dom::_domdom_lq1
DomDom _domdom_lq1(SRT_LQ, 1)
Test::Set::Dom::_domrange_gr1
DomRange _domrange_gr1(SRT_GR, 1)
Test::Set::Dom::_domint_lq1
DomInt _domint_lq1(SRT_LQ, 1)
Test::Set::Dom::_domrange_sup2
DomRange _domrange_sup2(SRT_SUP, 2)
Test::Set::Dom::_domdom_eq1
DomDom _domdom_eq1(SRT_EQ, 1)
Test::Set::Dom::_domdom_cmpl1
DomDom _domdom_cmpl1(SRT_CMPL, 1)
Test::Set::Dom::_domintrange_gq2
DomIntRange _domintrange_gq2(SRT_GQ, 2)
Test::Set::Dom::_domdom_gq1
DomDom _domdom_gq1(SRT_GQ, 1)
Test::Set::Dom::_domintrange_disj1
DomIntRange _domintrange_disj1(SRT_DISJ, 1)
Test::Set::Dom::_domrange_disj1
DomRange _domrange_disj1(SRT_DISJ, 1)
Test::Set::Dom::_domdom_disj1
DomDom _domdom_disj1(SRT_DISJ, 1)
Test::Set::Dom::_domintrange_gq1
DomIntRange _domintrange_gq1(SRT_GQ, 1)
Test::Set::Dom::_domint_gr2
DomInt _domint_gr2(SRT_GR, 2)
Test::Set::Dom::_domdom_gq2
DomDom _domdom_gq2(SRT_GQ, 2)
Test::Set::Dom::_domint_lq2
DomInt _domint_lq2(SRT_LQ, 2)
Test::Set::Dom::_domint_disj2
DomInt _domint_disj2(SRT_DISJ, 2)
Test::Set::Dom::_domrange_gq1
DomRange _domrange_gq1(SRT_GQ, 1)
Test::Set::Dom::_domintrange_gr1
DomIntRange _domintrange_gr1(SRT_GR, 1)
Test::Set::Dom::_domrange_lq2
DomRange _domrange_lq2(SRT_LQ, 2)
Test::Set::Dom::_domrange_gq2
DomRange _domrange_gq2(SRT_GQ, 2)
Test::Set::Dom::_domdom_nq1
DomDom _domdom_nq1(SRT_NQ, 1)
Test::Set::Dom::_domrange_gr2
DomRange _domrange_gr2(SRT_GR, 2)
Test::Set::Dom::_domrange_eq1
DomRange _domrange_eq1(SRT_EQ, 1)
Test::Set::Dom::_domrange_nq2
DomRange _domrange_nq2(SRT_NQ, 2)
Test::Set::Dom::_domint_le2
DomInt _domint_le2(SRT_LE, 2)
Test::Set::Dom::_domint_sup2
DomInt _domint_sup2(SRT_SUP, 2)
Test::Set::Dom::_domintrange_nq2
DomIntRange _domintrange_nq2(SRT_NQ, 2)
Test::Set::Dom::_domintrange_gr2
DomIntRange _domintrange_gr2(SRT_GR, 2)
Test::Set::Dom::_domrange_lq1
DomRange _domrange_lq1(SRT_LQ, 1)
Test::Set::Dom::_domintrange_sub1
DomIntRange _domintrange_sub1(SRT_SUB, 1)
Test::Set::Dom::_domrange_sub1
DomRange _domrange_sub1(SRT_SUB, 1)
Test::Set::Dom::_domintrange_cmpl2
DomIntRange _domintrange_cmpl2(SRT_CMPL, 2)
Test::Set::Dom::_domrange_cmpl1
DomRange _domrange_cmpl1(SRT_CMPL, 1)
Test::Set::Dom::_domint_eq1
DomInt _domint_eq1(SRT_EQ, 1)
Test::Set::Dom::_domintrange_le1
DomIntRange _domintrange_le1(SRT_LE, 1)
Test::Set::Dom::_domdom_gr1
DomDom _domdom_gr1(SRT_GR, 1)
Test::Set::Dom::_domint_sup1
DomInt _domint_sup1(SRT_SUP, 1)
Test::Set::Dom::_domdom_le1
DomDom _domdom_le1(SRT_LE, 1)
Test::Set::Dom::_domrange_cmpl2
DomRange _domrange_cmpl2(SRT_CMPL, 2)
Test::Set::Dom::_domrange_disj2
DomRange _domrange_disj2(SRT_DISJ, 2)
Test::Set::Dom::_domint_nq2
DomInt _domint_nq2(SRT_NQ, 2)
Test::Set::Dom::_domint_cmpl1
DomInt _domint_cmpl1(SRT_CMPL, 1)
Test::Set::Dom::_domint_gq1
DomInt _domint_gq1(SRT_GQ, 1)
Test::Set::Dom::_domdom_sub2
DomDom _domdom_sub2(SRT_SUB, 2)
Test::Set::Dom::_domintrange_lq2
DomIntRange _domintrange_lq2(SRT_LQ, 2)
Test::Set::Dom::_domdom_eq2
DomDom _domdom_eq2(SRT_EQ, 2)
Test::Set::Dom::_domrange_sup1
DomRange _domrange_sup1(SRT_SUP, 1)
Test::Set::Dom::_domrange_nq1
DomRange _domrange_nq1(SRT_NQ, 1)
Test::Set::Dom::_domdom_le2
DomDom _domdom_le2(SRT_LE, 2)
Test::Set::Dom::_domint_eq2
DomInt _domint_eq2(SRT_EQ, 2)
Test::Set::Dom::_domintrange_lq1
DomIntRange _domintrange_lq1(SRT_LQ, 1)
Test::Set::Dom::_domrange_le2
DomRange _domrange_le2(SRT_LE, 2)
Test::Set::Dom::_cr2
CardRange _cr2(2)
Test::Set::Dom::_domdom_sub1
DomDom _domdom_sub1(SRT_SUB, 1)
Test::Set::Dom::_domdom_gr2
DomDom _domdom_gr2(SRT_GR, 2)
Test::Set::Dom::_domdom_lq2
DomDom _domdom_lq2(SRT_LQ, 2)
Test::Set::Dom::_domdom_sup1
DomDom _domdom_sup1(SRT_SUP, 1)
Test::Set::Dom::_domintrange_disj2
DomIntRange _domintrange_disj2(SRT_DISJ, 2)
Test::Set::Dom::_domint_gq2
DomInt _domint_gq2(SRT_GQ, 2)
Test::Set::Dom::_domrange_eq2
DomRange _domrange_eq2(SRT_EQ, 2)
Test::Set::Dom::_domdom_nq2
DomDom _domdom_nq2(SRT_NQ, 2)
Test::Set::Dom::_domint_disj1
DomInt _domint_disj1(SRT_DISJ, 1)
Test::Set::Dom::_domint_le1
DomInt _domint_le1(SRT_LE, 1)
Test::Set::Dom::_domrange_sub2
DomRange _domrange_sub2(SRT_SUB, 2)
Test::Set::Dom::_domint_sub1
DomInt _domint_sub1(SRT_SUB, 1)
Test::Set::Dom::_domintrange_le2
DomIntRange _domintrange_le2(SRT_LE, 2)
Test::Set::Dom::_domint_cmpl2
DomInt _domint_cmpl2(SRT_CMPL, 2)
Test::Set::Dom::_domdom_disj2
DomDom _domdom_disj2(SRT_DISJ, 2)
Test::Set::Dom::_cr1
CardRange _cr1(1)
Test::Set::Dom::_domint_sub2
DomInt _domint_sub2(SRT_SUB, 2)
Test::Set::Dom::_domdom_cmpl2
DomDom _domdom_cmpl2(SRT_CMPL, 2)
Test::Set::Dom::_domintrange_eq2
DomIntRange _domintrange_eq2(SRT_EQ, 2)
Test::Set::Dom::_domintrange_cmpl1
DomIntRange _domintrange_cmpl1(SRT_CMPL, 1)
Test::Set::Dom::_domdom_sup2
DomDom _domdom_sup2(SRT_SUP, 2)
Test::Set::Dom::_domintrange_sup2
DomIntRange _domintrange_sup2(SRT_SUP, 2)
Test::Set
Testing finite sets.
Definition set.cpp:42
Test
General test support.
Definition afc.cpp:39
Test::r
Region r
Definition region.cpp:65
GECODE_NEVER
#define GECODE_NEVER
Assert that this command is never executed.
Definition macros.hpp:56
set.hh