Generated on Sat Nov 9 2013 19:18:25 for Gecode by doxygen 1.8.4
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: 2012-03-30 01:56:07 +0200 (Fri, 30 Mar 2012) $ by $Author: tack $
11  * $Revision: 12663 $
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 
46  IntArgs::IntArgs(void) : PrimArgArray<int>(0) {}
47 
49  IntArgs::IntArgs(int n) : PrimArgArray<int>(n) {}
50 
53  : PrimArgArray<int>(x.size()) {
54  for (int i=x.size(); i--;)
55  a[i] = x[i];
56  }
58  IntArgs::IntArgs(const std::vector<int>& x)
59  : PrimArgArray<int>(x) {}
60  template<class InputIterator>
62  IntArgs::IntArgs(InputIterator first, InputIterator last)
63  : PrimArgArray<int>(first,last) {}
64 
66  IntArgs::IntArgs(int n, const int* e) : PrimArgArray<int>(n, e) {}
67 
70 
72  IntArgs::create(int n, int start, int inc) {
73  IntArgs r(n);
74  for (int i=0; i<n; i++, start+=inc)
75  r[i] = start;
76  return r;
77  }
78 
81 
84  : VarArray<IntVar>(home,n) {}
85 
88  : VarArray<IntVar>(a) {}
89 
92  : VarArray<IntVar>(home,a) {}
93 
94 
97 
100  : VarArray<BoolVar>(home,n) {}
101 
104  : VarArray<BoolVar>(a) {}
105 
108  : VarArray<BoolVar>(home,a) {}
109 
110 }
111 
112 // STATISTICS: int-other