Jip J. Dekker
3e72b0e857
git-subtree-dir: software/gecode_on_record git-subtree-split: 37ed9bda495ea87e63217c19a374b5a93bb0078e
113 lines
3.7 KiB
C++
113 lines
3.7 KiB
C++
/* -*- 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 {
|
|
|
|
/// %Tests for distinctness constraints
|
|
namespace Distinct {
|
|
|
|
/**
|
|
* \defgroup TaskTestSetDistinct Distinctness constraints
|
|
* \ingroup TaskTestSet
|
|
*/
|
|
//@{
|
|
|
|
static IntSet ds_33(-2,2);
|
|
static IntSet ds_44(-4,4);
|
|
|
|
/// %Test for the atmostone propagator
|
|
class AtmostOne : public SetTest {
|
|
public:
|
|
/// Create and register test
|
|
AtmostOne(const char* t)
|
|
: SetTest(t,3,ds_33,false) {}
|
|
/// %Test whether \a x is solution
|
|
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;
|
|
}
|
|
/// Post constraint on \a x
|
|
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
|