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
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
|
/**
* $Id$
* ***** BEGIN GPL/BL DUAL LICENSE BLOCK *****
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version. The Blender
* Foundation also sells licenses for use in proprietary software under
* the Blender License. See http://www.blender.org/BL/ for information
* about this.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software Foundation,
* Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*
* The Original Code is Copyright (C) 2001-2002 by NaN Holding BV.
* All rights reserved.
*
* The Original Code is: all of this file.
*
* Contributor(s): none yet.
*
* ***** END GPL/BL DUAL LICENSE BLOCK *****
*/
/*
*
* Template Numerical Toolkit (TNT): Linear Algebra Module
*
* Mathematical and Computational Sciences Division
* National Institute of Technology,
* Gaithersburg, MD USA
*
*
* This software was developed at the National Institute of Standards and
* Technology (NIST) by employees of the Federal Government in the course
* of their official duties. Pursuant to title 17 Section 105 of the
* United States Code, this software is not subject to copyright protection
* and is in the public domain. The Template Numerical Toolkit (TNT) is
* an experimental system. NIST assumes no responsibility whatsoever for
* its use by other parties, and makes no guarantees, expressed or implied,
* about its quality, reliability, or any other characteristic.
*
* BETA VERSION INCOMPLETE AND SUBJECT TO CHANGE
* see http://math.nist.gov/tnt for latest updates.
*
*/
#ifndef REGION1D_H
#define REGION1D_H
#include "subscript.h"
#include "index.h"
#include <iostream>
#include <cassert>
namespace TNT
{
template <class Array1D>
class const_Region1D;
template <class Array1D>
class Region1D
{
protected:
Array1D & A_;
Subscript offset_; // 0-based
Subscript dim_;
typedef typename Array1D::element_type T;
public:
const Array1D & array() const { return A_; }
Subscript offset() const { return offset_;}
Subscript dim() const { return dim_; }
Subscript offset(Subscript i) const
{
#ifdef TNT_BOUNDS_CHECK
assert(i==TNT_BASE_OFFSET);
#endif
return offset_;
}
Subscript dim(Subscript i) const
{
#ifdef TNT_BOUNDS_CHECK
assert(i== TNT_BASE_OFFSET);
#endif
return offset_;
}
Region1D(Array1D &A, Subscript i1, Subscript i2) : A_(A)
{
#ifdef TNT_BOUNDS_CHECK
assert(TNT_BASE_OFFSET <= i1 );
assert(i2 <= A.dim() + (TNT_BASE_OFFSET-1));
assert(i1 <= i2);
#endif
offset_ = i1 - TNT_BASE_OFFSET;
dim_ = i2-i1 + 1;
}
Region1D(Array1D &A, const Index1D &I) : A_(A)
{
#ifdef TNT_BOUNDS_CHECK
assert(TNT_BASE_OFFSET <=I.lbound());
assert(I.ubound() <= A.dim() + (TNT_BASE_OFFSET-1));
assert(I.lbound() <= I.ubound());
#endif
offset_ = I.lbound() - TNT_BASE_OFFSET;
dim_ = I.ubound() - I.lbound() + 1;
}
Region1D(Region1D<Array1D> &A, Subscript i1, Subscript i2) :
A_(A.A_)
{
#ifdef TNT_BOUNDS_CHECK
assert(TNT_BASE_OFFSET <= i1 );
assert(i2 <= A.dim() + (TNT_BASE_OFFSET - 1));
assert(i1 <= i2);
#endif
// (old-offset) (new-offset)
//
offset_ = (i1 - TNT_BASE_OFFSET) + A.offset_;
dim_ = i2-i1 + 1;
}
Region1D<Array1D> operator()(Subscript i1, Subscript i2)
{
#ifdef TNT_BOUNDS_CHECK
assert(TNT_BASE_OFFSET <= i1);
assert(i2 <= dim() + (TNT_BASE_OFFSET -1));
assert(i1 <= i2);
#endif
// offset_ is 0-based, so no need for
// ( - TNT_BASE_OFFSET)
//
return Region1D<Array1D>(A_, i1+offset_,
offset_ + i2);
}
Region1D<Array1D> operator()(const Index1D &I)
{
#ifdef TNT_BOUNDS_CHECK
assert(TNT_BASE_OFFSET<=I.lbound());
assert(I.ubound() <= dim() + (TNT_BASE_OFFSET-1));
assert(I.lbound() <= I.ubound());
#endif
return Region1D<Array1D>(A_, I.lbound()+offset_,
offset_ + I.ubound());
}
T & operator()(Subscript i)
{
#ifdef TNT_BOUNDS_CHECK
assert(TNT_BASE_OFFSET <= i);
assert(i <= dim() + (TNT_BASE_OFFSET-1));
#endif
return A_(i+offset_);
}
const T & operator() (Subscript i) const
{
#ifdef TNT_BOUNDS_CHECK
assert(TNT_BASE_OFFSET <= i);
assert(i <= dim() + (TNT_BASE_OFFSET-1));
#endif
return A_(i+offset_);
}
Region1D<Array1D> & operator=(const Region1D<Array1D> &R)
{
// make sure both sides conform
assert(dim() == R.dim());
Subscript N = dim();
Subscript i;
Subscript istart = TNT_BASE_OFFSET;
Subscript iend = istart + N-1;
for (i=istart; i<=iend; i++)
(*this)(i) = R(i);
return *this;
}
Region1D<Array1D> & operator=(const const_Region1D<Array1D> &R)
{
// make sure both sides conform
assert(dim() == R.dim());
Subscript N = dim();
Subscript i;
Subscript istart = TNT_BASE_OFFSET;
Subscript iend = istart + N-1;
for (i=istart; i<=iend; i++)
(*this)(i) = R(i);
return *this;
}
Region1D<Array1D> & operator=(const T& t)
{
Subscript N=dim();
Subscript i;
Subscript istart = TNT_BASE_OFFSET;
Subscript iend = istart + N-1;
for (i=istart; i<= iend; i++)
(*this)(i) = t;
return *this;
}
Region1D<Array1D> & operator=(const Array1D &R)
{
// make sure both sides conform
Subscript N = dim();
assert(dim() == R.dim());
Subscript i;
Subscript istart = TNT_BASE_OFFSET;
Subscript iend = istart + N-1;
for (i=istart; i<=iend; i++)
(*this)(i) = R(i);
return *this;
}
};
template <class Array1D>
std::ostream& operator<<(std::ostream &s, Region1D<Array1D> &A)
{
Subscript N=A.dim();
Subscript istart = TNT_BASE_OFFSET;
Subscript iend = N - 1 + TNT_BASE_OFFSET;
for (Subscript i=istart; i<=iend; i++)
s << A(i) << endl;
return s;
}
/* --------- class const_Region1D ------------ */
template <class Array1D>
class const_Region1D
{
protected:
const Array1D & A_;
Subscript offset_; // 0-based
Subscript dim_;
typedef typename Array1D::element_type T;
public:
const Array1D & array() const { return A_; }
Subscript offset() const { return offset_;}
Subscript dim() const { return dim_; }
Subscript offset(Subscript i) const
{
#ifdef TNT_BOUNDS_CHECK
assert(i==TNT_BASE_OFFSET);
#endif
return offset_;
}
Subscript dim(Subscript i) const
{
#ifdef TNT_BOUNDS_CHECK
assert(i== TNT_BASE_OFFSET);
#endif
return offset_;
}
const_Region1D(const Array1D &A, Subscript i1, Subscript i2) : A_(A)
{
#ifdef TNT_BOUNDS_CHECK
assert(TNT_BASE_OFFSET <= i1 );
assert(i2 <= A.dim() + (TNT_BASE_OFFSET-1));
assert(i1 <= i2);
#endif
offset_ = i1 - TNT_BASE_OFFSET;
dim_ = i2-i1 + 1;
}
const_Region1D(const Array1D &A, const Index1D &I) : A_(A)
{
#ifdef TNT_BOUNDS_CHECK
assert(TNT_BASE_OFFSET <=I.lbound());
assert(I.ubound() <= A.dim() + (TNT_BASE_OFFSET-1));
assert(I.lbound() <= I.ubound());
#endif
offset_ = I.lbound() - TNT_BASE_OFFSET;
dim_ = I.ubound() - I.lbound() + 1;
}
const_Region1D(const_Region1D<Array1D> &A, Subscript i1, Subscript i2) :
A_(A.A_)
{
#ifdef TNT_BOUNDS_CHECK
assert(TNT_BASE_OFFSET <= i1 );
assert(i2 <= A.dim() + (TNT_BASE_OFFSET - 1));
assert(i1 <= i2);
#endif
// (old-offset) (new-offset)
//
offset_ = (i1 - TNT_BASE_OFFSET) + A.offset_;
dim_ = i2-i1 + 1;
}
const_Region1D<Array1D> operator()(Subscript i1, Subscript i2)
{
#ifdef TNT_BOUNDS_CHECK
assert(TNT_BASE_OFFSET <= i1);
assert(i2 <= dim() + (TNT_BASE_OFFSET -1));
assert(i1 <= i2);
#endif
// offset_ is 0-based, so no need for
// ( - TNT_BASE_OFFSET)
//
return const_Region1D<Array1D>(A_, i1+offset_,
offset_ + i2);
}
const_Region1D<Array1D> operator()(const Index1D &I)
{
#ifdef TNT_BOUNDS_CHECK
assert(TNT_BASE_OFFSET<=I.lbound());
assert(I.ubound() <= dim() + (TNT_BASE_OFFSET-1));
assert(I.lbound() <= I.ubound());
#endif
return const_Region1D<Array1D>(A_, I.lbound()+offset_,
offset_ + I.ubound());
}
const T & operator() (Subscript i) const
{
#ifdef TNT_BOUNDS_CHECK
assert(TNT_BASE_OFFSET <= i);
assert(i <= dim() + (TNT_BASE_OFFSET-1));
#endif
return A_(i+offset_);
}
};
template <class Array1D>
std::ostream& operator<<(std::ostream &s, const_Region1D<Array1D> &A)
{
Subscript N=A.dim();
for (Subscript i=1; i<=N; i++)
s << A(i) << endl;
return s;
}
} // namespace TNT
#endif
// const_Region1D_H
|
