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
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christopher Mears <Chris.Mears@monash.edu>
*
* Contributing authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christopher Mears, 2011
* Christian Schulte, 2011
*
* 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/int.hh"
namespace Test { namespace Int {
/// %Tests for value precedence constraints
namespace Precede {
/// %Test for single value precedence constraint
class Single : public Test {
private:
/// The values for precedence
int s, t;
public:
/// Create and register test
Single(int s0, int t0)
: Test("Precede::Single::"+str(s0)+"<"+str(t0),8,1,4),
s(s0), t(t0) {}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
int n = x.size();
for (int i = 0 ; i < n ; i++) {
if (x[i] == t)
return false;
if (x[i] == s)
return true;
}
return true;
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
Gecode::precede(home, x, s, t);
}
};
/// %Test for multiple value precedence constraint
class Multi : public Test {
private:
/// The values for precedence
Gecode::IntArgs c;
public:
/// Create and register test
Multi(const Gecode::IntArgs& c0)
: Test("Precede::Multi::"+str(c0),6,1,5), c(c0) {
contest = CTL_NONE;
}
/// %Test whether \a x is solution
virtual bool solution(const Assignment& x) const {
for (int j=0; j<c.size()-1; j++)
for (int i=0; i<x.size(); i++) {
if (x[i] == c[j+1])
return false;
if (x[i] == c[j])
break;
}
return true;
}
/// Post constraint on \a x
virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
Gecode::precede(home, x, c);
}
};
Single _a(2, 3);
Single _b(1, 4);
Multi _c(Gecode::IntArgs({1,2,3}));
Multi _d(Gecode::IntArgs({3,2,1}));
Multi _e(Gecode::IntArgs({4,2,3,1}));
}
}}
// STATISTICS: test-int
|
