1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Guido Tack <tack@gecode.org>
*
* Copyright:
* Guido Tack, 2005
*
* Last modified:
* $Date: 2010-04-08 12:35:31 +0200 (Thu, 08 Apr 2010) $ by $Author: schulte $
* $Revision: 10684 $
*
* 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, 0,1);
Gecode::rel(home, x[0], SOT_INTER, x[1], SRT_EQ, s1);
SetVar s2(home, IntSet::empty, -2, 2, 0,1);
Gecode::rel(home, x[0], SOT_INTER, x[2], SRT_EQ, s2);
SetVar s3(home, IntSet::empty, -2, 2, 0,1);
Gecode::rel(home, x[1], SOT_INTER, x[2], SRT_EQ, s3);
Gecode::atmostOne(home, x, 3);
}
};
AtmostOne _atmostone("Distinct::AtmostOne");
//@}
}}}
// STATISTICS: test-set
|
