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
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Patrick Pekczynski <pekczynski@ps.uni-sb.de>
*
* Copyright:
* Patrick Pekczynski, 2004
*
* 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 <gecode/int/sorted.hh>
namespace Gecode {
void
sorted(Home home, const IntVarArgs& x, const IntVarArgs& y,
const IntVarArgs& z, IntPropLevel) {
using namespace Int;
if ((x.size() != y.size()) || (x.size() != z.size()))
throw ArgumentSizeMismatch("Int::Sorted");
if (same(x,y) || same(x,z) || same(y,z))
throw ArgumentSame("Int::Sorted");
GECODE_POST;
if (x.size()==0) return;
ViewArray<IntView> x0(home,x), y0(home,y), z0(home,z);
GECODE_ES_FAIL(
(Sorted::Sorted<IntView,true>::post(home,x0,y0,z0)));
}
void
sorted(Home home, const IntVarArgs& x, const IntVarArgs& y,
IntPropLevel) {
using namespace Int;
if (x.size() != y.size())
throw ArgumentSizeMismatch("Int::Sorted");
if (same(x,y))
throw ArgumentSame("Int::Sorted");
GECODE_POST;
if (x.size()==0) return;
ViewArray<IntView> x0(home,x), y0(home,y), z0(home,0);
GECODE_ES_FAIL(
(Sorted::Sorted<IntView,false>::post(home,x0,y0,z0)));
}
}
// STATISTICS: int-post
|
