File: array.hpp

package info (click to toggle)
gecode-snapshot 6.2.0%2Bgit20240207-2
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 35,308 kB
  • sloc: cpp: 475,516; perl: 2,077; makefile: 1,816; sh: 198
file content (175 lines) | stat: -rwxr-xr-x 4,518 bytes parent folder | download | duplicates (4)
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
/* -*- mode: C++; c-basic-offset: 2; indent-tabs-mode: nil -*- */
/*
 *  Main authors:
 *     Christian Schulte <schulte@gecode.org>
 *
 *  Copyright:
 *     Christian Schulte, 2005
 *
 *  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.
 *
 */

namespace Gecode {

  /*
   * Implementation
   *
   */

  forceinline
  IntArgs::IntArgs(void) : ArgArray<int>(0) {}

  forceinline
  IntArgs::IntArgs(int n) : ArgArray<int>(n) {}

  forceinline
  IntArgs::IntArgs(const SharedArray<int>& x)
    : ArgArray<int>(x.size()) {
    for (int i=0; i<x.size(); i++)
      a[i] = x[i];
  }

  forceinline
  IntArgs::IntArgs(const std::vector<int>& x)
    : ArgArray<int>(x) {}

  forceinline
  IntArgs::IntArgs(std::initializer_list<int> x)
    : ArgArray<int>(x) {}

  template<class InputIterator>
  forceinline
  IntArgs::IntArgs(InputIterator first, InputIterator last)
    : ArgArray<int>(first,last) {}

  forceinline
  IntArgs::IntArgs(int n, const int* e)
    : ArgArray<int>(n, e) {}

  forceinline
  IntArgs::IntArgs(const ArgArray<int>& a)
    : ArgArray<int>(a) {}

  forceinline IntArgs
  IntArgs::create(int n, int start, int inc) {
    IntArgs r(n);
    for (int i=0; i<n; i++, start+=inc)
      r[i] = start;
    return r;
  }


  forceinline
  IntVarArgs::IntVarArgs(void) {}

  forceinline
  IntVarArgs::IntVarArgs(int n)
    : VarArgArray<IntVar>(n) {}

  forceinline
  IntVarArgs::IntVarArgs(const IntVarArgs& a)
    : VarArgArray<IntVar>(a) {}

  forceinline
  IntVarArgs::IntVarArgs(const VarArray<IntVar>& a)
    : VarArgArray<IntVar>(a) {}

  forceinline
  IntVarArgs::IntVarArgs(const std::vector<IntVar>& a)
    : VarArgArray<IntVar>(a) {}

  forceinline
  IntVarArgs::IntVarArgs(std::initializer_list<IntVar> a)
    : VarArgArray<IntVar>(a) {}

  template<class InputIterator>
  forceinline
  IntVarArgs::IntVarArgs(InputIterator first, InputIterator last)
    : VarArgArray<IntVar>(first,last) {}


  forceinline
  BoolVarArgs::BoolVarArgs(void) {}

  forceinline
  BoolVarArgs::BoolVarArgs(int n)
    : VarArgArray<BoolVar>(n) {}

  forceinline
  BoolVarArgs::BoolVarArgs(const BoolVarArgs& a)
    : VarArgArray<BoolVar>(a) {}

  forceinline
  BoolVarArgs::BoolVarArgs(const VarArray<BoolVar>& a)
    : VarArgArray<BoolVar>(a) {}

  forceinline
  BoolVarArgs::BoolVarArgs(const std::vector<BoolVar>& a)
    : VarArgArray<BoolVar>(a) {}

  forceinline
  BoolVarArgs::BoolVarArgs(std::initializer_list<BoolVar> a)
    : VarArgArray<BoolVar>(a) {}

  template<class InputIterator>
  forceinline
  BoolVarArgs::BoolVarArgs(InputIterator first, InputIterator last)
    : VarArgArray<BoolVar>(first,last) {}


  forceinline
  IntVarArray::IntVarArray(void) {}

  forceinline
  IntVarArray::IntVarArray(Space& home, int n)
    : VarArray<IntVar>(home,n) {}

  forceinline
  IntVarArray::IntVarArray(const IntVarArray& a)
    : VarArray<IntVar>(a) {}

  forceinline
  IntVarArray::IntVarArray(Space& home, const IntVarArgs& a)
    : VarArray<IntVar>(home,a) {}


  forceinline
  BoolVarArray::BoolVarArray(void) {}

  forceinline
  BoolVarArray::BoolVarArray(Space& home, int n)
    : VarArray<BoolVar>(home,n) {}

  forceinline
  BoolVarArray::BoolVarArray(const BoolVarArray& a)
    : VarArray<BoolVar>(a) {}

  forceinline
  BoolVarArray::BoolVarArray(Space& home, const BoolVarArgs& a)
    : VarArray<BoolVar>(home,a) {}

}

// STATISTICS: int-other