this repo has no description
dekker.one
1/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2/*
3 * Main authors:
4 * Christopher Mears <Chris.Mears@monash.edu>
5 *
6 * Contributing authors:
7 * Christian Schulte <schulte@gecode.org>
8 *
9 * Copyright:
10 * Christopher Mears, 2011
11 * Christian Schulte, 2011
12 *
13 * This file is part of Gecode, the generic constraint
14 * development environment:
15 * http://www.gecode.org
16 *
17 * Permission is hereby granted, free of charge, to any person obtaining
18 * a copy of this software and associated documentation files (the
19 * "Software"), to deal in the Software without restriction, including
20 * without limitation the rights to use, copy, modify, merge, publish,
21 * distribute, sublicense, and/or sell copies of the Software, and to
22 * permit persons to whom the Software is furnished to do so, subject to
23 * the following conditions:
24 *
25 * The above copyright notice and this permission notice shall be
26 * included in all copies or substantial portions of the Software.
27 *
28 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
29 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
30 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
31 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
32 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
33 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
34 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
35 *
36 */
37
38#include "test/int.hh"
39
40namespace Test { namespace Int {
41
42 /// %Tests for value precedence constraints
43 namespace Precede {
44
45 /// %Test for single value precedence constraint
46 class Single : public Test {
47 private:
48 /// The values for precedence
49 int s, t;
50 public:
51 /// Create and register test
52 Single(int s0, int t0)
53 : Test("Precede::Single::"+str(s0)+"<"+str(t0),8,1,4),
54 s(s0), t(t0) {}
55 /// %Test whether \a x is solution
56 virtual bool solution(const Assignment& x) const {
57 int n = x.size();
58 for (int i = 0 ; i < n ; i++) {
59 if (x[i] == t)
60 return false;
61 if (x[i] == s)
62 return true;
63 }
64 return true;
65 }
66 /// Post constraint on \a x
67 virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
68 Gecode::precede(home, x, s, t);
69 }
70 };
71
72 /// %Test for multiple value precedence constraint
73 class Multi : public Test {
74 private:
75 /// The values for precedence
76 Gecode::IntArgs c;
77 public:
78 /// Create and register test
79 Multi(const Gecode::IntArgs& c0)
80 : Test("Precede::Multi::"+str(c0),6,1,5), c(c0) {
81 contest = CTL_NONE;
82 }
83 /// %Test whether \a x is solution
84 virtual bool solution(const Assignment& x) const {
85 for (int j=0; j<c.size()-1; j++)
86 for (int i=0; i<x.size(); i++) {
87 if (x[i] == c[j+1])
88 return false;
89 if (x[i] == c[j])
90 break;
91 }
92 return true;
93 }
94 /// Post constraint on \a x
95 virtual void post(Gecode::Space& home, Gecode::IntVarArray& x) {
96 Gecode::precede(home, x, c);
97 }
98 };
99
100 Single _a(2, 3);
101 Single _b(1, 4);
102
103 Multi _c(Gecode::IntArgs({1,2,3}));
104 Multi _d(Gecode::IntArgs({3,2,1}));
105 Multi _e(Gecode::IntArgs({4,2,3,1}));
106
107 }
108
109}}
110
111// STATISTICS: test-int