-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathnrutil_nr.h
472 lines (409 loc) · 10.4 KB
/
nrutil_nr.h
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
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
#ifndef _NR_UTIL_H_
#define _NR_UTIL_H_
#include <string>
#include <cmath>
#include <complex>
#include <iostream>
using namespace std;
typedef double DP;
template<class T>
inline const T SQR(const T a) {return a*a;}
template<class T>
inline const T MAX(const T &a, const T &b)
{return b > a ? (b) : (a);}
inline float MAX(const double &a, const float &b)
{return b > a ? (b) : float(a);}
inline float MAX(const float &a, const double &b)
{return b > a ? float(b) : (a);}
template<class T>
inline const T MIN(const T &a, const T &b)
{return b < a ? (b) : (a);}
inline float MIN(const double &a, const float &b)
{return b < a ? (b) : float(a);}
inline float MIN(const float &a, const double &b)
{return b < a ? float(b) : (a);}
template<class T>
inline const T SIGN(const T &a, const T &b)
{return b >= 0 ? (a >= 0 ? a : -a) : (a >= 0 ? -a : a);}
inline float SIGN(const float &a, const double &b)
{return b >= 0 ? (a >= 0 ? a : -a) : (a >= 0 ? -a : a);}
inline float SIGN(const double &a, const float &b)
{return b >= 0 ? (a >= 0 ? a : -a) : (a >= 0 ? -a : a);}
template<class T>
inline void SWAP(T &a, T &b)
{T dum=a; a=b; b=dum;}
namespace NR {
inline void nrerror(const string error_text)
// Numerical Recipes standard error handler
{
cerr << "Numerical Recipes run-time error..." << endl;
cerr << error_text << endl;
cerr << "...now exiting to system..." << endl;
exit(1);
}
}
template <class T>
class NRVec {
private:
int nn; // size of array. upper index is nn-1
T *v;
public:
NRVec();
explicit NRVec(int n); // Zero-based array
NRVec(const T &a, int n); //initialize to constant value
NRVec(const T *a, int n); // Initialize to array
NRVec(const NRVec &rhs); // Copy constructor
NRVec & operator=(const NRVec &rhs); //assignment
NRVec & operator=(const T &a); //assign a to every element
inline T & operator[](const int i); //i'th element
inline const T & operator[](const int i) const;
inline int size() const;
~NRVec();
};
template <class T>
NRVec<T>::NRVec() : nn(0), v(0) {}
template <class T>
NRVec<T>::NRVec(int n) : nn(n), v(new T[n]) {}
template <class T>
NRVec<T>::NRVec(const T& a, int n) : nn(n), v(new T[n])
{
for(int i=0; i<n; i++)
v[i] = a;
}
template <class T>
NRVec<T>::NRVec(const T *a, int n) : nn(n), v(new T[n])
{
for(int i=0; i<n; i++)
v[i] = *a++;
}
template <class T>
NRVec<T>::NRVec(const NRVec<T> &rhs) : nn(rhs.nn), v(new T[nn])
{
for(int i=0; i<nn; i++)
v[i] = rhs[i];
}
template <class T>
NRVec<T> & NRVec<T>::operator=(const NRVec<T> &rhs)
// postcondition: normal assignment via copying has been performed;
// if vector and rhs were different sizes, vector
// has been resized to match the size of rhs
{
if (this != &rhs)
{
if (nn != rhs.nn) {
if (v != 0) delete [] (v);
nn=rhs.nn;
v= new T[nn];
}
for (int i=0; i<nn; i++)
v[i]=rhs[i];
}
return *this;
}
template <class T>
NRVec<T> & NRVec<T>::operator=(const T &a) //assign a to every element
{
for (int i=0; i<nn; i++)
v[i]=a;
return *this;
}
template <class T>
inline T & NRVec<T>::operator[](const int i) //subscripting
{
return v[i];
}
template <class T>
inline const T & NRVec<T>::operator[](const int i) const //subscripting
{
return v[i];
}
template <class T>
inline int NRVec<T>::size() const
{
return nn;
}
template <class T>
NRVec<T>::~NRVec()
{
if (v != 0)
delete[] (v);
}
template <class T>
class NRMat {
private:
int nn;
int mm;
T **v;
public:
NRMat();
NRMat(int n, int m); // Zero-based array
NRMat(const T &a, int n, int m); //Initialize to constant
NRMat(const T *a, int n, int m); // Initialize to array
NRMat(const NRMat &rhs); // Copy constructor
NRMat & operator=(const NRMat &rhs); //assignment
NRMat & operator=(const T &a); //assign a to every element
inline T* operator[](const int i); //subscripting: pointer to row i
inline const T* operator[](const int i) const;
inline int nrows() const;
inline int ncols() const;
~NRMat();
};
template <class T>
NRMat<T>::NRMat() : nn(0), mm(0), v(0) {}
template <class T>
NRMat<T>::NRMat(int n, int m) : nn(n), mm(m), v(new T*[n])
{
v[0] = new T[m*n];
for (int i=1; i< n; i++)
v[i] = v[i-1] + m;
}
template <class T>
NRMat<T>::NRMat(const T &a, int n, int m) : nn(n), mm(m), v(new T*[n])
{
int i,j;
v[0] = new T[m*n];
for (i=1; i< n; i++)
v[i] = v[i-1] + m;
for (i=0; i< n; i++)
for (j=0; j<m; j++)
v[i][j] = a;
}
template <class T>
NRMat<T>::NRMat(const T *a, int n, int m) : nn(n), mm(m), v(new T*[n])
{
int i,j;
v[0] = new T[m*n];
for (i=1; i< n; i++)
v[i] = v[i-1] + m;
for (i=0; i< n; i++)
for (j=0; j<m; j++)
v[i][j] = *a++;
}
template <class T>
NRMat<T>::NRMat(const NRMat &rhs) : nn(rhs.nn), mm(rhs.mm), v(new T*[nn])
{
int i,j;
v[0] = new T[mm*nn];
for (i=1; i< nn; i++)
v[i] = v[i-1] + mm;
for (i=0; i< nn; i++)
for (j=0; j<mm; j++)
v[i][j] = rhs[i][j];
}
template <class T>
NRMat<T> & NRMat<T>::operator=(const NRMat<T> &rhs)
// postcondition: normal assignment via copying has been performed;
// if matrix and rhs were different sizes, matrix
// has been resized to match the size of rhs
{
if (this != &rhs) {
int i,j;
if (nn != rhs.nn || mm != rhs.mm) {
if (v != 0) {
delete[] (v[0]);
delete[] (v);
}
nn=rhs.nn;
mm=rhs.mm;
v = new T*[nn];
v[0] = new T[mm*nn];
}
for (i=1; i< nn; i++)
v[i] = v[i-1] + mm;
for (i=0; i< nn; i++)
for (j=0; j<mm; j++)
v[i][j] = rhs[i][j];
}
return *this;
}
template <class T>
NRMat<T> & NRMat<T>::operator=(const T &a) //assign a to every element
{
for (int i=0; i< nn; i++)
for (int j=0; j<mm; j++)
v[i][j] = a;
return *this;
}
template <class T>
inline T* NRMat<T>::operator[](const int i) //subscripting: pointer to row i
{
return v[i];
}
template <class T>
inline const T* NRMat<T>::operator[](const int i) const
{
return v[i];
}
template <class T>
inline int NRMat<T>::nrows() const
{
return nn;
}
template <class T>
inline int NRMat<T>::ncols() const
{
return mm;
}
template <class T>
NRMat<T>::~NRMat()
{
if (v != 0) {
delete[] (v[0]);
delete[] (v);
}
}
template <class T>
class NRMat3d {
private:
int nn;
int mm;
int kk;
T ***v;
public:
NRMat3d();
NRMat3d(int n, int m, int k);
inline T** operator[](const int i); //subscripting: pointer to row i
inline const T* const * operator[](const int i) const;
inline int dim1() const;
inline int dim2() const;
inline int dim3() const;
~NRMat3d();
};
template <class T>
NRMat3d<T>::NRMat3d(): nn(0), mm(0), kk(0), v(0) {}
template <class T>
NRMat3d<T>::NRMat3d(int n, int m, int k) : nn(n), mm(m), kk(k), v(new T**[n])
{
int i,j;
v[0] = new T*[n*m];
v[0][0] = new T[n*m*k];
for(j=1; j<m; j++)
v[0][j] = v[0][j-1] + k;
for(i=1; i<n; i++) {
v[i] = v[i-1] + m;
v[i][0] = v[i-1][0] + m*k;
for(j=1; j<m; j++)
v[i][j] = v[i][j-1] + k;
}
}
template <class T>
inline T** NRMat3d<T>::operator[](const int i) //subscripting: pointer to row i
{
return v[i];
}
template <class T>
inline const T* const * NRMat3d<T>::operator[](const int i) const
{
return v[i];
}
template <class T>
inline int NRMat3d<T>::dim1() const
{
return nn;
}
template <class T>
inline int NRMat3d<T>::dim2() const
{
return mm;
}
template <class T>
inline int NRMat3d<T>::dim3() const
{
return kk;
}
template <class T>
NRMat3d<T>::~NRMat3d()
{
if (v != 0) {
delete[] (v[0][0]);
delete[] (v[0]);
delete[] (v);
}
}
//The next 3 classes are used in artihmetic coding, Huffman coding, and
//wavelet transforms respectively. This is as good a place as any to put them!
class arithcode {
private:
NRVec<unsigned long> *ilob_p,*iupb_p,*ncumfq_p;
public:
NRVec<unsigned long> &ilob,&iupb,&ncumfq;
unsigned long jdif,nc,minint,nch,ncum,nrad;
arithcode(unsigned long n1, unsigned long n2, unsigned long n3)
: ilob_p(new NRVec<unsigned long>(n1)),
iupb_p(new NRVec<unsigned long>(n2)),
ncumfq_p(new NRVec<unsigned long>(n3)),
ilob(*ilob_p),iupb(*iupb_p),ncumfq(*ncumfq_p) {}
~arithcode() {
if (ilob_p != 0) delete ilob_p;
if (iupb_p != 0) delete iupb_p;
if (ncumfq_p != 0) delete ncumfq_p;
}
};
class huffcode {
private:
NRVec<unsigned long> *icod_p,*ncod_p,*left_p,*right_p;
public:
NRVec<unsigned long> &icod,&ncod,&left,&right;
int nch,nodemax;
huffcode(unsigned long n1, unsigned long n2, unsigned long n3,
unsigned long n4) :
icod_p(new NRVec<unsigned long>(n1)),
ncod_p(new NRVec<unsigned long>(n2)),
left_p(new NRVec<unsigned long>(n3)),
right_p(new NRVec<unsigned long>(n4)),
icod(*icod_p),ncod(*ncod_p),left(*left_p),right(*right_p) {}
~huffcode() {
if (icod_p != 0) delete icod_p;
if (ncod_p != 0) delete ncod_p;
if (left_p != 0) delete left_p;
if (right_p != 0) delete right_p;
}
};
class wavefilt {
private:
NRVec<DP> *cc_p,*cr_p;
public:
int ncof,ioff,joff;
NRVec<DP> &cc,&cr;
wavefilt() : cc(*cc_p),cr(*cr_p) {}
wavefilt(const DP *a, const int n) : //initialize to array
cc_p(new NRVec<DP>(n)),cr_p(new NRVec<DP>(n)),
ncof(n),ioff(-(n >> 1)),joff(-(n >> 1)),cc(*cc_p),cr(*cr_p) {
int i;
for (i=0; i<n; i++)
cc[i] = *a++;
DP sig = -1.0;
for (i=0; i<n; i++) {
cr[n-1-i]=sig*cc[i];
sig = -sig;
}
}
~wavefilt() {
if (cc_p != 0) delete cc_p;
if (cr_p != 0) delete cr_p;
}
};
//Overloaded complex operations to handle mixed float and double
//This takes care of e.g. 1.0/z, z complex<float>
inline const complex<float> operator+(const double &a,
const complex<float> &b) { return float(a)+b; }
inline const complex<float> operator+(const complex<float> &a,
const double &b) { return a+float(b); }
inline const complex<float> operator-(const double &a,
const complex<float> &b) { return float(a)-b; }
inline const complex<float> operator-(const complex<float> &a,
const double &b) { return a-float(b); }
inline const complex<float> operator*(const double &a,
const complex<float> &b) { return float(a)*b; }
inline const complex<float> operator*(const complex<float> &a,
const double &b) { return a*float(b); }
inline const complex<float> operator/(const double &a,
const complex<float> &b) { return float(a)/b; }
inline const complex<float> operator/(const complex<float> &a,
const double &b) { return a/float(b); }
//some compilers choke on pow(float,double) in single precision. also atan2
inline float pow (float x, double y) {return pow(double(x),y);}
inline float pow (double x, float y) {return pow(x,double(y));}
inline float atan2 (float x, double y) {return atan2(double(x),y);}
inline float atan2 (double x, float y) {return atan2(x,double(y));}
#endif /* _NR_UTIL_H_ */