main page
modules
namespaces
classes
files
Gecode home
Generated on Sat Aug 25 2012 03:32:44 for Gecode by
doxygen
1.8.1.2
gecode
int
array.hpp
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, 2005
8
*
9
* Last modified:
10
* $Date: 2011-04-28 22:05:18 +1000 (Thu, 28 Apr 2011) $ by $Author: tack $
11
* $Revision: 11968 $
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
namespace
Gecode {
39
40
/*
41
* Implementation
42
*
43
*/
44
45
forceinline
46
IntArgs::IntArgs
(
void
) :
PrimArgArray
<int>(0) {}
47
48
forceinline
49
IntArgs::IntArgs
(
int
n) :
PrimArgArray
<int>(n) {}
50
51
forceinline
52
IntArgs::IntArgs
(
const
SharedArray<int>
& x)
53
:
PrimArgArray
<int>(x.
size
()) {
54
for
(
int
i
=x.
size
();
i
--;)
55
a
[
i
] = x[
i
];
56
}
57
forceinline
58
IntArgs::IntArgs
(
const
std::vector<int>& x)
59
:
PrimArgArray
<int>(static_cast<int>(x.
size
())) {
60
for
(std::vector<int>::size_type
i
=x.
size
();
i
--;)
61
a
[
i
] = x[
i
];
62
}
63
64
forceinline
65
IntArgs::IntArgs
(
int
n,
const
int
* e) :
PrimArgArray
<int>(n, e) {}
66
67
forceinline
68
IntArgs::IntArgs
(
const
PrimArgArray<int>
&
a
) :
PrimArgArray
<int>(a) {}
69
70
forceinline
IntArgs
71
IntArgs::create
(
int
n,
int
start,
int
inc) {
72
IntArgs
r
(n);
73
for
(
int
i
=0;
i
<
n
;
i
++, start+=inc)
74
r[
i
] = start;
75
return
r
;
76
}
77
78
forceinline
79
IntVarArray::IntVarArray
(
void
) {}
80
81
forceinline
82
IntVarArray::IntVarArray
(
Space
& home,
int
n)
83
:
VarArray
<
IntVar
>(home,n) {}
84
85
forceinline
86
IntVarArray::IntVarArray
(
const
IntVarArray
&
a
)
87
:
VarArray
<
IntVar
>(a) {}
88
89
forceinline
90
IntVarArray::IntVarArray
(
Space
& home,
const
IntVarArgs
&
a
)
91
:
VarArray
<
IntVar
>(home,a) {}
92
93
94
forceinline
95
BoolVarArray::BoolVarArray
(
void
) {}
96
97
forceinline
98
BoolVarArray::BoolVarArray
(
Space
& home,
int
n)
99
:
VarArray
<
BoolVar
>(home,n) {}
100
101
forceinline
102
BoolVarArray::BoolVarArray
(
const
BoolVarArray
&
a
)
103
:
VarArray
<
BoolVar
>(a) {}
104
105
forceinline
106
BoolVarArray::BoolVarArray
(
Space
& home,
const
BoolVarArgs
&
a
)
107
:
VarArray
<
BoolVar
>(home,a) {}
108
109
}
110
111
// STATISTICS: int-other