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
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
|
#include <cassert>
#include <cctype>
#include <iostream>
#include <list>
#include <set>
#include <stack>
#include <vector>
#include "cctk.h"
#include "bbox.hh"
#include "defs.hh"
#include "dh.hh"
#include "region.hh"
#include "vect.hh"
using namespace std;
template <typename T>
inline T ipow_helper (T x, unsigned int y)
{
T z = y&1 ? x : 1;
while (y >>= 1)
{
x *= x;
if (y & 1) z *= x;
}
return z;
}
template<class T>
T ipow (T x, int y)
{
if (y < 0)
return T(1) / ipow_helper(x, -y);
else
return ipow_helper(x, y);
}
void skipws (istream& is) {
while (is.good() && isspace(is.peek())) {
is.get();
}
}
void expect (istream& is, const char c) {
if (is.peek() == c) return;
cout << "While reading characters from a stream:" << endl
<< " Character '" << c << "' expected, but not found." << endl
<< " The next up to 100 available characters are \"";
for (int i=0; i<100; ++i) {
const int uc = is.get();
if (uc<0) break;
cout << (unsigned char)uc;
}
cout << "\"." << endl;
throw input_error();
}
void consume (istream& is, const char c) {
expect (is, c);
is.get();
}
void consume (istream& is, const char * const s) {
for (const char * p = s; * p; ++ p) {
expect (is, * p);
is.get();
}
}
// Container memory usage
template <class T>
size_t
memoryof (list<T> const & c)
{
size_t s = sizeof c;
for (typename list<T>::const_iterator i=c.begin(); i!=c.end(); ++i) {
// Assume that there are two pointers per list element, pointing
// to the previous and next element, respectively
s += 2 * sizeof (void *) + memoryof(*i);
}
return s;
}
template <class T>
size_t
memoryof (set<T> const & c)
{
size_t s = sizeof c;
for (typename set<T>::const_iterator i=c.begin(); i!=c.end(); ++i) {
// Assume that there are three pointers per list element, forming
// a tree structure
s += 3 * sizeof (void *) + memoryof(*i);
}
return s;
}
template <class T>
size_t
memoryof (stack<T> const & c)
{
size_t s = sizeof c;
#if 0
for (typename stack<T>::const_iterator i=c.begin(); i!=c.end(); ++i) {
// Assume that a stack is stored in an efficient manner
s += memoryof(*i);
}
#endif
// Cannot access elements... a stack is LIFO!
s += c.size() * sizeof (T);
return s;
}
template <class T>
size_t
memoryof (vector<T> const & c)
{
size_t s = sizeof c;
for (typename vector<T>::const_iterator i=c.begin(); i!=c.end(); ++i) {
// Vectors are stored contiguously
s += memoryof(*i);
}
return s;
}
// Vector input
template<class T>
istream& input (istream& is, vector<T>& v) {
v.clear();
try {
skipws (is);
consume (is, '[');
skipws (is);
while (is.good() && is.peek() != ']') {
T elem;
is >> elem;
v.push_back (elem);
skipws (is);
if (is.peek() != ',') break;
is.get();
skipws (is);
}
skipws (is);
consume (is, ']');
} catch (input_error &err) {
cout << "Input error while reading a vector<>" << endl
<< " The following elements have been read so far: " << v << endl;
throw err;
}
return is;
}
// List output
template<class T>
ostream& output (ostream& os, const list<T>& l) {
os << "[";
for (typename list<T>::const_iterator ti=l.begin(); ti!=l.end(); ++ti) {
if (ti!=l.begin()) os << ",";
os << *ti;
}
os << "]";
return os;
}
// Set output
template<class T>
ostream& output (ostream& os, const set<T>& s) {
os << "{";
for (typename set<T>::const_iterator ti=s.begin(); ti!=s.end(); ++ti) {
if (ti!=s.begin()) os << ",";
os << *ti;
}
os << "}";
return os;
}
// Stack output
template<class T>
ostream& output (ostream& os, const stack<T>& s) {
stack<T> s2 (s);
list<T> l;
while (! s2.empty()) {
l.insert (l.begin(), s2.top());
s2.pop();
}
return output (os, l);
}
// Vector output
template<class T>
ostream& output (ostream& os, const vector<T>& v) {
os << "[";
// Do not number the elements, as this would lead to a format that
// cannot be read back in.
// int cnt=0;
for (typename vector<T>::const_iterator ti=v.begin(); ti!=v.end(); ++ti) {
if (ti!=v.begin()) os << ",";
// os << cnt++ << ":";
os << *ti;
}
os << "]";
return os;
}
#include "bbox.hh"
#include "bboxset.hh"
#include "dh.hh"
#include "fulltree.hh"
#include "gdata.hh"
#include "ggf.hh"
#include "region.hh"
#include "th.hh"
#include "vect.hh"
template int ipow (int x, int y);
template CCTK_REAL ipow (CCTK_REAL x, int y);
template vect<int,3> ipow (vect<int,3> x, int y);
template size_t memoryof (list<bbox<int,3> > const & l);
template size_t memoryof (list<vect<int,3> > const & l);
template size_t memoryof (list<dh*> const & l);
template size_t memoryof (list<ggf*> const & l);
template size_t memoryof (list<th*> const & l);
template size_t memoryof (stack<void*> const & s);
template size_t memoryof (vector<bool> const & v);
template size_t memoryof (vector<int> const & v);
template size_t memoryof (vector<CCTK_REAL> const & v);
template size_t memoryof (vector<bbox<int,3> > const & v);
template size_t memoryof (vector<vect<int,3> > const & v);
template size_t memoryof (vector<fulltree <int,3,pseudoregion_t> *> const & f);
template size_t memoryof (vector<pseudoregion_t> const & v);
template size_t memoryof (vector<region_t> const & v);
template size_t memoryof (vector<sendrecv_pseudoregion_t> const & v);
template size_t memoryof (vector<vector<int> > const & v);
template size_t memoryof (vector<vector<CCTK_REAL> > const & v);
template size_t memoryof (vector<vector<bbox<int,3> > > const & v);
template size_t memoryof (vector<vector<dh::dboxes> > const & v);
template size_t memoryof (vector<vector<dh::fast_dboxes> > const & v);
template size_t memoryof (vector<vector<region_t> > const & v);
template size_t memoryof (vector<vector<vector<dh::dboxes> > > const & v);
template size_t memoryof (vector<vector<vector<dh::fast_dboxes> > > const & v);
template size_t memoryof (vector<vector<vector<region_t> > > const & v);
template size_t memoryof (vector<vector<vector<gdata*> > > const & v);
template size_t memoryof (vector<vector<vector<vector<gdata*> > > > const & v);
template istream& input (istream& os, vector<int>& v);
template istream& input (istream& os, vector<CCTK_REAL>& v);
template istream& input (istream& os, vector<bbox<int,3> >& v);
template istream& input (istream& os, vector<bbox<CCTK_REAL,3> >& v);
template istream& input (istream& os, vector<vect<int,3> >& v);
template istream& input (istream& os, vector<vect<vect<bool,2>,3> >& v);
template istream& input (istream& os, vector<region_t>& v);
template istream& input (istream& os, vector<vector<CCTK_REAL> >& v);
template istream& input (istream& os, vector<vector<bbox<int,3> > >& v);
template istream& input (istream& os, vector<vector<bbox<CCTK_REAL,3> > >& v);
template istream& input (istream& os, vector<vector<vect<vect<bool,2>,3> > >& v);
template istream& input (istream& os, vector<vector<region_t> >& v);
template istream& input (istream& os, vector<vector<vector<CCTK_REAL> > >& v);
template istream& input (istream& os, vector<vector<vector<region_t> > >& v);
template ostream& output (ostream& os, const list<bbox<int,3> >& l);
template ostream& output (ostream& os, const list<region_t>& l);
template ostream& output (ostream& os, const set<bbox<int,3> >& s);
template ostream& output (ostream& os, const set<bboxset<int,3> >& s);
template ostream& output (ostream& os, const stack<bbox<int,3> >& s);
template ostream& output (ostream& os, const vector<bool>& v);
template ostream& output (ostream& os, const vector<int>& v);
template ostream& output (ostream& os, const vector<CCTK_REAL>& v);
template ostream& output (ostream& os, const vector<bbox<int,3> >& v);
template ostream& output (ostream& os, const vector<bbox<CCTK_REAL,3> >& v);
template ostream& output (ostream& os, const vector<vect<int,3> >& v);
template ostream& output (ostream& os, const vector<vect<vect<bool,2>,3> >& v);
template ostream& output (ostream& os, const vector<dh::dboxes> & v);
template ostream& output (ostream& os, const vector<dh::fast_dboxes> & v);
template ostream& output (ostream& os, const vector<region_t>& v);
template ostream& output (ostream& os, const vector<pseudoregion_t>& v);
template ostream& output (ostream& os, const vector<sendrecv_pseudoregion_t>& v);
template ostream& output (ostream& os, const vector<list<bbox<int,3> > >& v);
template ostream& output (ostream& os, const vector<vector<int> >& v);
template ostream& output (ostream& os, const vector<vector<CCTK_REAL> >& v);
template ostream& output (ostream& os, const vector<vector<bbox<int,3> > >& v);
template ostream& output (ostream& os, const vector<vector<bbox<CCTK_REAL,3> > >& v);
template ostream& output (ostream& os, const vector<vector<vect<vect<bool,2>,3> > >& v);
template ostream& output (ostream& os, const vector<vector<dh::dboxes> > & b);
template ostream& output (ostream& os, const vector<vector<dh::fast_dboxes> > & b);
template ostream& output (ostream& os, const vector<vector<region_t> >& v);
template ostream& output (ostream& os, const vector<vector<vector<CCTK_REAL> > >& v);
template ostream& output (ostream& os, const vector<vector<vector<bbox<int,3> > > >& v);
template ostream& output (ostream& os, const vector<vector<vector<dh::dboxes> > > & b);
template ostream& output (ostream& os, const vector<vector<vector<dh::fast_dboxes> > > & b);
template ostream& output (ostream& os, const vector<vector<vector<region_t> > >& v);
|
