Generated on Mon Jul 27 2020 00:00:00 for Gecode by doxygen 1.8.18
array.cpp
Go to the documentation of this file.
1 /* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
2 /*
3  * Main authors:
4  * Christian Schulte <schulte@gecode.org>
5  *
6  * Copyright:
7  * Christian Schulte, 2002
8  *
9  * This file is part of Gecode, the generic constraint
10  * development environment:
11  * http://www.gecode.org
12  *
13  * Permission is hereby granted, free of charge, to any person obtaining
14  * a copy of this software and associated documentation files (the
15  * "Software"), to deal in the Software without restriction, including
16  * without limitation the rights to use, copy, modify, merge, publish,
17  * distribute, sublicense, and/or sell copies of the Software, and to
18  * permit persons to whom the Software is furnished to do so, subject to
19  * the following conditions:
20  *
21  * The above copyright notice and this permission notice shall be
22  * included in all copies or substantial portions of the Software.
23  *
24  * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25  * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26  * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27  * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
28  * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
29  * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
30  * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
31  *
32  */
33 
34 #include <gecode/int.hh>
35 
36 namespace Gecode {
37 
38  IntVarArray::IntVarArray(Space& home, int n, int min, int max)
39  : VarArray<IntVar>(home,n) {
40  Int::Limits::check(min,"IntVarArray::IntVarArray");
41  Int::Limits::check(max,"IntVarArray::IntVarArray");
42  if (min > max)
43  throw Int::VariableEmptyDomain("IntVarArray::IntVarArray");
44  for (int i=0; i<size(); i++)
45  x[i]._init(home,min,max);
46  }
47 
48  IntVarArray::IntVarArray(Space& home, int n, const IntSet& s)
49  : VarArray<IntVar>(home,n) {
50  Int::Limits::check(s.min(),"IntVarArray::IntVarArray");
51  Int::Limits::check(s.max(),"IntVarArray::IntVarArray");
52  if (s.size() == 0)
53  throw Int::VariableEmptyDomain("IntVarArray::IntVarArray");
54  for (int i=0; i<size(); i++)
55  x[i]._init(home,s);
56  }
57 
58  BoolVarArray::BoolVarArray(Space& home, int n, int min, int max)
59  : VarArray<BoolVar>(home, n) {
60  if ((min < 0) || (max > 1))
61  throw Int::NotZeroOne("BoolVarArray::BoolVarArray");
62  if (min > max)
63  throw Int::VariableEmptyDomain("BoolVarArray::BoolVarArray");
64  for (int i=0; i<size(); i++)
65  x[i]._init(home,min,max);
66  }
67 
68  IntVarArgs::IntVarArgs(Space& home, int n, int min, int max)
69  : VarArgArray<IntVar>(n) {
70  Int::Limits::check(min,"IntVarArgs::IntVarArgs");
71  Int::Limits::check(max,"IntVarArgs::IntVarArgs");
72  if (min > max)
73  throw Int::VariableEmptyDomain("IntVarArgs::IntVarArgs");
74  for (int i=0; i<size(); i++)
75  a[i]._init(home,min,max);
76  }
77 
78  IntVarArgs::IntVarArgs(Space& home, int n, const IntSet& s)
79  : VarArgArray<IntVar>(n) {
80  Int::Limits::check(s.min(),"IntVarArgs::IntVarArgs");
81  Int::Limits::check(s.max(),"IntVarArgs::IntVarArgs");
82  if (s.size() == 0)
83  throw Int::VariableEmptyDomain("IntVarArgs::IntVarArgs");
84  for (int i=0; i<size(); i++)
85  a[i]._init(home,s);
86  }
87 
88  BoolVarArgs::BoolVarArgs(Space& home, int n, int min, int max)
89  : VarArgArray<BoolVar>(n) {
90  if ((min < 0) || (max > 1))
91  throw Int::NotZeroOne("BoolVarArgs::BoolVarArgs");
92  if (min > max)
93  throw Int::VariableEmptyDomain("BoolVarArgs::BoolVarArgs");
94  for (int i=0; i<size(); i++)
95  a[i]._init(home,min,max);
96  }
97 
98 }
99 
100 // STATISTICS: int-post
int min(int i) const
Return minimum of range at position i.
Definition: int-set-1.hpp:152
void max(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition: arithmetic.cpp:49
int max(int i) const
Return maximum of range at position i.
Definition: int-set-1.hpp:158
unsigned int size(I &i)
Size of all ranges of range iterator i.
void check(int n, const char *l)
Check whether n is in range, otherwise throw out of limits with information l.
Definition: limits.hpp:46
Computation spaces.
Definition: core.hpp:1742
IntVar * x
Array of variables.
Definition: array.hpp:117
BoolVarArgs(void)
Allocate empty array.
Definition: array.hpp:114
int size(void) const
Return size of array (number of elements)
Definition: array.hpp:926
unsigned int size(void) const
Return size (cardinality) of set.
Definition: int-set-1.hpp:198
IntVarArgs(void)
Allocate empty array.
Definition: array.hpp:85
Variable arrays
Definition: array.hpp:78
Exception: Not 0/1 integer
Definition: exception.hpp:51
Gecode toplevel namespace
Integer sets.
Definition: int.hh:174
Boolean integer variables.
Definition: int.hh:512
BoolVarArray(void)
Default constructor (array of size 0)
Definition: array.hpp:159
Integer variables.
Definition: int.hh:371
Exception: Variable created with empty domain
Definition: exception.hpp:59
struct Gecode::@602::NNF::@65::@67 a
For atomic nodes.
void min(Home home, FloatVar x0, FloatVar x1, FloatVar x2)
Post propagator for .
Definition: arithmetic.cpp:67
IntVarArray(void)
Default constructor (array of size 0)
Definition: array.hpp:143
int n
Number of negative literals for node type.
Definition: bool-expr.cpp:234
Argument array for variables.
Definition: array.hpp:79
Gecode::IntArgs i({1, 2, 3, 4})