File: sorted.cpp

package info (click to toggle)
gecode 3.4.0-1
  • links: PTS
  • area: main
  • in suites: squeeze
  • size: 10,136 kB
  • ctags: 16,905
  • sloc: cpp: 124,581; perl: 2,004; makefile: 1,453; sh: 247
file content (165 lines) | stat: -rw-r--r-- 4,927 bytes parent folder | download | duplicates (3)
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
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
 *  Main authors:
 *     Patrick Pekczynski <pekczynski@ps.uni-sb.de>
 *
 *  Contributing authors:
 *     Christian Schulte <schulte@gecode.org>
 *
 *  Copyright:
 *     Patrick Pekczynski, 2005
 *     Christian Schulte, 2007
 *
 *  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/int.hh"

namespace Test { namespace Int {

   /// %Tests for sorted constraints
   namespace Sorted {

     /**
      * \defgroup TaskTestIntSorted Sorted constraints
      * \ingroup TaskTestInt
      */
     //@{

     /// Relation for sorting integers in increasing order
     class SortIntMin {
     public:
       /// %Test whether \a x is less than \a y
       bool operator()(const int x, const int y) {
         return x<y;
       }
     };

     /// %Test sorted without permutation variables
     class NoVar : public Test {
     protected:
       /// Number of variables to be sorted
       static const int n = 3;
     public:
       /// Create and register test
       NoVar(void) : Test("Sorted::NoVar",2*n,0,3) {}
       /// %Test whether \a xy is solution
       virtual bool solution(const Assignment& xy) const {
         int x[n], y[n];
         for (int i=0;i<3; i++) {
           x[i]=xy[i]; y[i]=xy[n+i];
         }

         for (int i=0; i<n-1; i++)
           if (y[i]>y[i+1])
             return false;

         SortIntMin sim;
         Gecode::Support::quicksort<int,SortIntMin>(x,n,sim);

         for (int i=0; i<n; i++)
           if (x[i] != y[i])
             return false;
         return true;
       }
       /// Post constraint on \a xy
       virtual void post(Gecode::Space& home, Gecode::IntVarArray& xy) {
         Gecode::IntVarArgs x(n), y(n);
         for (int i=0; i<n; i++) {
           x[i]=xy[i]; y[i]=xy[n+i];
         }
         Gecode::sorted(home,x,y);
       }
     };


     /// %Test sorted with permutation variables
     class PermVar : public Test {
     protected:
       /// Number of variables to be sorted
       static const int n = 3;
     public:
       /// Create and register test
       PermVar(void) : Test("Sorted::PermVar",3*n,0,2) {}
       /// %Test whether \a xyz is solution
       virtual bool solution(const Assignment& xyz) const {
         int x[n], y[n], z[n];
         for (int i=0; i<n; i++) {
           x[i]=xyz[i]; y[i]=xyz[n+i]; z[i]=xyz[2*n+i];
         }
         // check for permutation
         for (int i=0; i<n; i++)
           for (int j=i+1; j<n; j++)
             if (z[i]==z[j])
               return false;

         // y must to be sorted
         for (int i=0; i<n-1; i++)
           if (y[i]>y[i+1])
             return false;

         // check whether permutation is in range
         for (int i=0; i<n; i++)
           if ((z[i] < 0) || (z[i] >= n))
             return false;

         // check whether permutation info is correct
         for (int i=0; i<n; i++)
           if (x[i] != y[z[i]])
             return false;

         // check for sorting
         SortIntMin sim;
         Gecode::Support::quicksort<int,SortIntMin>(x,n,sim);
         for (int i=0; i<n; i++)
           if (x[i] != y[i])
             return false;

         return true;
       }
       /// Post constraint on \a xyz
       virtual void post(Gecode::Space& home, Gecode::IntVarArray& xyz) {
         Gecode::IntVarArgs x(n), y(n), z(n);
         for (int i=0; i<n; i++) {
           x[i]=xyz[i]; y[i]=xyz[n+i]; z[i]=xyz[2*n+i];
         }
         Gecode::sorted(home,x,y,z);
       }
     };


     NoVar novar;
     PermVar permvar;
     //@}

   }
}}

// STATISTICS: test-int