distinct.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 "test/set.hh"
using namespace Gecode;
namespace Test { namespace Set {
namespace Distinct {
static IntSet ds_33(-2,2);
static IntSet ds_44(-4,4);
class AtmostOne : public SetTest {
public:
AtmostOne(const char* t)
: SetTest(t,3,ds_33,false) {}
virtual bool solution(const SetAssignment& x) const {
{
CountableSetRanges xr0(x.lub, x[0]);
CountableSetRanges xr1(x.lub, x[1]);
Iter::Ranges::Inter<CountableSetRanges,CountableSetRanges>
i(xr0,xr1);
if (Iter::Ranges::size(i)>1)
return false;
}
{
CountableSetRanges xr0(x.lub, x[0]);
CountableSetRanges xr2(x.lub, x[2]);
Iter::Ranges::Inter<CountableSetRanges,CountableSetRanges>
i(xr0,xr2);
if (Iter::Ranges::size(i)>1)
return false;
}
{
CountableSetRanges xr1(x.lub, x[1]);
CountableSetRanges xr2(x.lub, x[2]);
Iter::Ranges::Inter<CountableSetRanges,CountableSetRanges>
i(xr1,xr2);
if (Iter::Ranges::size(i)>1)
return false;
}
{
CountableSetRanges xr0(x.lub, x[0]);
CountableSetRanges xr1(x.lub, x[1]);
CountableSetRanges xr2(x.lub, x[2]);
if (Iter::Ranges::size(xr0)!=3 ||
Iter::Ranges::size(xr1)!=3 ||
Iter::Ranges::size(xr2)!=3)
return false;
}
return true;
}
virtual void post(Space& home, SetVarArray& x, IntVarArray&) {
SetVar s1(home, IntSet::empty, -2, 2, 0U, 1U);
Gecode::rel(home, x[0], SOT_INTER, x[1], SRT_EQ, s1);
SetVar s2(home, IntSet::empty, -2, 2, 0U, 1U);
Gecode::rel(home, x[0], SOT_INTER, x[2], SRT_EQ, s2);
SetVar s3(home, IntSet::empty, -2, 2, 0U, 1U);
Gecode::rel(home, x[1], SOT_INTER, x[2], SRT_EQ, s3);
Gecode::atmostOne(home, x, 3);
}
};
AtmostOne _atmostone("Distinct::AtmostOne");
}}}
// STATISTICS: test-set
Gecode::IntSet
Integer sets.
Definition int.hh:174
Gecode::IntSet::empty
static const IntSet empty
Empty set.
Definition int.hh:283
Gecode::IntVarArray
Integer variable array.
Definition int.hh:763
Gecode::Iter::Ranges::Inter
Range iterator for computing intersection (binary).
Definition ranges-inter.hpp:44
Gecode::SetVarArray
Set variable array
Definition set.hh:570
Gecode::SetVar
Set variables
Definition set.hh:127
Gecode::Space
Computation spaces.
Definition core.hpp:1742
Test::Set::CountableSetRanges
Range iterator producing subsets of an IntSet.
Definition set.hh:99
Test::Set::Distinct::AtmostOne
Test for the atmostone propagator
Definition distinct.cpp:53
Test::Set::Distinct::AtmostOne::solution
virtual bool solution(const SetAssignment &x) const
Test whether x is solution
Definition distinct.cpp:59
Test::Set::Distinct::AtmostOne::AtmostOne
AtmostOne(const char *t)
Create and register test.
Definition distinct.cpp:56
Test::Set::Distinct::AtmostOne::post
virtual void post(Space &home, SetVarArray &x, IntVarArray &)
Post constraint on x.
Definition distinct.cpp:96
Test::Set::SetAssignment
Generate all set assignments.
Definition set.hh:142
Test::Set::SetAssignment::lub
Gecode::IntSet lub
The common superset for all domains.
Definition set.hh:154
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::SOT_INTER
@ SOT_INTER
Intersection
Definition set.hh:663
Gecode::SRT_EQ
@ SRT_EQ
Equality ( ).
Definition set.hh:644
Gecode::Iter::Ranges::size
unsigned int size(I &i)
Size of all ranges of range iterator i.
Definition ranges-operations.hpp:74
Gecode
Gecode toplevel namespace
Gecode::atmostOne
void atmostOne(Home home, const SetVarArgs &x, unsigned int c)
Post propagator for and .
Definition distinct.cpp:41
Test::Set::Distinct
Tests for distinctness constraints
Definition distinct.cpp:41
Test::Set::Distinct::_atmostone
AtmostOne _atmostone("Distinct::AtmostOne")
Test::Set
Testing finite sets.
Definition set.cpp:42
Test
General test support.
Definition afc.cpp:39
set.hh