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
|
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
* Main authors:
* Christian Schulte <schulte@gecode.org>
*
* Copyright:
* Christian Schulte, 2002
*
* 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.hh>
namespace Gecode {
IntVarArray::IntVarArray(Space& home, int n, int min, int max)
: VarArray<IntVar>(home,n) {
Int::Limits::check(min,"IntVarArray::IntVarArray");
Int::Limits::check(max,"IntVarArray::IntVarArray");
if (min > max)
throw Int::VariableEmptyDomain("IntVarArray::IntVarArray");
for (int i=0; i<size(); i++)
x[i]._init(home,min,max);
}
IntVarArray::IntVarArray(Space& home, int n, const IntSet& s)
: VarArray<IntVar>(home,n) {
Int::Limits::check(s.min(),"IntVarArray::IntVarArray");
Int::Limits::check(s.max(),"IntVarArray::IntVarArray");
if (s.size() == 0)
throw Int::VariableEmptyDomain("IntVarArray::IntVarArray");
for (int i=0; i<size(); i++)
x[i]._init(home,s);
}
BoolVarArray::BoolVarArray(Space& home, int n, int min, int max)
: VarArray<BoolVar>(home, n) {
if ((min < 0) || (max > 1))
throw Int::NotZeroOne("BoolVarArray::BoolVarArray");
if (min > max)
throw Int::VariableEmptyDomain("BoolVarArray::BoolVarArray");
for (int i=0; i<size(); i++)
x[i]._init(home,min,max);
}
IntVarArgs::IntVarArgs(Space& home, int n, int min, int max)
: VarArgArray<IntVar>(n) {
Int::Limits::check(min,"IntVarArgs::IntVarArgs");
Int::Limits::check(max,"IntVarArgs::IntVarArgs");
if (min > max)
throw Int::VariableEmptyDomain("IntVarArgs::IntVarArgs");
for (int i=0; i<size(); i++)
a[i]._init(home,min,max);
}
IntVarArgs::IntVarArgs(Space& home, int n, const IntSet& s)
: VarArgArray<IntVar>(n) {
Int::Limits::check(s.min(),"IntVarArgs::IntVarArgs");
Int::Limits::check(s.max(),"IntVarArgs::IntVarArgs");
if (s.size() == 0)
throw Int::VariableEmptyDomain("IntVarArgs::IntVarArgs");
for (int i=0; i<size(); i++)
a[i]._init(home,s);
}
BoolVarArgs::BoolVarArgs(Space& home, int n, int min, int max)
: VarArgArray<BoolVar>(n) {
if ((min < 0) || (max > 1))
throw Int::NotZeroOne("BoolVarArgs::BoolVarArgs");
if (min > max)
throw Int::VariableEmptyDomain("BoolVarArgs::BoolVarArgs");
for (int i=0; i<size(); i++)
a[i]._init(home,min,max);
}
}
// STATISTICS: int-post
|
