GNodeArray.cpp
10.8 KB
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
/***************************************************************************
* GNodeArray.cpp - Array of nodes class *
* ----------------------------------------------------------------------- *
* copyright : (C) 2008 by Jurgen Knodlseder *
* ----------------------------------------------------------------------- *
* *
* 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. *
* *
* ----------------------------------------------------------------------- *
***************************************************************************/
/**
* @file GNodeArray.cpp
* @brief GNodeArray class implementation.
* @author J. Knodlseder
*/
/* __ Includes ___________________________________________________________ */
#include <iostream>
#include <math.h>
#include "GException.hpp"
#include "GNodeArray.hpp"
/* __ Namespaces _________________________________________________________ */
/* __ Method name definitions ____________________________________________ */
/* __ Macros _____________________________________________________________ */
/* __ Coding definitions _________________________________________________ */
/* __ Debug definitions __________________________________________________ */
/* __ Constants __________________________________________________________ */
/*==========================================================================
= =
= GNodeArray constructors/destructors =
= =
==========================================================================*/
/***********************************************************************//**
* @brief Constructor
***************************************************************************/
GNodeArray::GNodeArray()
{
// Initialise class members for clean destruction
init_members();
// Return
return;
}
/***********************************************************************//**
* @brief Copy constructor
*
* @param array Array to be copied
***************************************************************************/
GNodeArray::GNodeArray(const GNodeArray& array)
{
// Initialise class members for clean destruction
init_members();
// Copy members
copy_members(array);
// Return
return;
}
/***********************************************************************//**
* @brief Destructor
***************************************************************************/
GNodeArray::~GNodeArray()
{
// Free members
free_members();
// Return
return;
}
/*==========================================================================
= =
= GNodeArray operators =
= =
==========================================================================*/
/***********************************************************************//**
* @brief Assignment operator
*
* @param array Array to be assigned
***************************************************************************/
GNodeArray& GNodeArray::operator= (const GNodeArray& array)
{
// Execute only if object is not identical
if (this != &array) {
// Free members
free_members();
// Initialise private members
init_members();
// Copy members
copy_members(array);
} // endif: object was not identical
// Return this object
return *this;
}
/*==========================================================================
= =
= GNodeArray public methods =
= =
==========================================================================*/
/***********************************************************************//**
* @brief Set node array
*
* @param[in] num Number of nodes
* @param[in] array Values of node array.
***************************************************************************/
void GNodeArray::nodes(const int& num, const double* array)
{
// Free any existing memory
free_members();
// Initialise members
init_members();
// Set number of nodes
m_nodes = num;
// Allocate memory
if (m_nodes > 0) {
m_node = new double[m_nodes];
m_step = new double[m_nodes];
}
// Copy node data
for (int i = 0; i < m_nodes; ++i)
m_node[i] = array[i];
// Setup
setup();
// Return
return;
}
/***********************************************************************//**
* @brief Set node array from vector
*
* @param[in] vector Vector from which node array will be built.
***************************************************************************/
void GNodeArray::nodes(const GVector& vector)
{
// Free any existing memory
free_members();
// Initialise members
init_members();
// Set number of nodes
m_nodes = vector.size();
// Allocate memory
if (m_nodes > 0) {
m_node = new double[m_nodes];
m_step = new double[m_nodes];
}
// Copy node data
for (int i = 0; i < m_nodes; ++i)
m_node[i] = vector(i);
// Setup
setup();
// Return
return;
}
/***********************************************************************//**
* @brief Set indices and weighting factors for interpolation
*
* @param[in] value Value for which the interpolation should be done.
*
* Set the indices that bound the specified value and the corresponding
* weighting factors for linear interpolation. If the array has a linear
* form (i.e. the nodes are equidistant), an analytic formula is used to
* determine the boundary indices. If the nodes are not equidistant the
* boundary indices are searched by bisection.
***************************************************************************/
void GNodeArray::set_value(const double& value)
{
// If array is linear then get left index from analytic formula
if (m_is_linear) {
// Set left index
m_inx_left = m_linear_slope * value + m_linear_offset;
// Keep index in valid range
if (m_inx_left < 0) m_inx_left = 0;
else if (m_inx_left >= m_nodes-1) m_inx_left = m_nodes - 2;
} // endif: array is linear
// ... otherwise search the relevant indices by bisection
else {
// Set left index if value is before first node
if (value < m_node[0])
m_inx_left = 0;
// Set left index if value is after last node
else if (value > m_node[m_nodes-1])
m_inx_left = m_nodes - 2;
// Set left index by bisection
else {
int low = 0;
int high = m_nodes - 1;
int mid = 0;
while ((high - low) > 1) {
int mid = (low+high) / 2;
if (m_node[mid] > value)
high = mid;
else if (m_node[mid] <= value)
low = mid;
}
m_inx_left = low;
} // endelse: did bisection
}
// Set right index
m_inx_right = m_inx_left + 1;
// Set weighting factors
m_wgt_right = (value - m_node[m_inx_left]) / m_step[m_inx_left];
m_wgt_left = 1.0 - m_wgt_right;
// Return
return;
}
/*==========================================================================
= =
= GNodeArray private methods =
= =
==========================================================================*/
/***********************************************************************//**
* @brief Initialise class members
***************************************************************************/
void GNodeArray::init_members(void)
{
// Initialise members
m_nodes = 0;
m_node = NULL;
m_step = NULL;
m_is_linear = 0;
m_linear_slope = 0.0;
m_linear_offset = 0.0;
// Return
return;
}
/***********************************************************************//**
* @brief Copy class members
*
* @param[in] array Array to be copied
***************************************************************************/
void GNodeArray::copy_members(const GNodeArray& array)
{
// Copy number of bins
m_nodes = array.m_nodes;
m_is_linear = array.m_is_linear;
m_linear_slope = array.m_linear_slope;
m_linear_offset = array.m_linear_offset;
// Copy nodes
if (m_nodes > 0) {
m_node = new double[m_nodes];
m_step = new double[m_nodes];
memcpy(m_node, array.m_node, m_nodes*sizeof(double));
memcpy(m_step, array.m_step, m_nodes*sizeof(double));
}
// Return
return;
}
/***********************************************************************//**
* @brief Delete class members
***************************************************************************/
void GNodeArray::free_members(void)
{
// Free memory
if (m_node != NULL) delete [] m_node;
if (m_step != NULL) delete [] m_step;
// Signal that memory is free
m_node = NULL;
m_step = NULL;
// Return
return;
}
/***********************************************************************//**
* @brief Compute distance array and linear slope/offset
***************************************************************************/
void GNodeArray::setup(void)
{
// Setup distance array between subsequent nodes
for (int i = 0; i < m_nodes-1; ++i)
m_step[i] = m_node[i+1] - m_node[i];
// Evaluate linear slope and offset
m_linear_slope = double(m_nodes-1) / (m_node[m_nodes-1] - m_node[0]);
m_linear_offset = -m_linear_slope * m_node[0];
// Check if nodes form a linear array
m_is_linear = 1;
for (int i = 0; i < m_nodes-1; ++i) {
double eps = m_linear_slope * m_node[i] + m_linear_offset - double(i);
if (fabs(eps) > 1.0e-6) {
m_is_linear = 0;
break;
}
}
// Return
return;
}