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
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
|
/* Copyright (c) 2020, Dyssol Development Team. All rights reserved. This file is part of Dyssol. See LICENSE file for license information. */
#include "TDArray.h"
#include "DyssolUtilities.h"
CTDArray::CTDArray(void):
m_nLastTimePos(0)
{}
CTDArray::CTDArray(CTDArray& _source):
m_data(_source.m_data),
m_nLastTimePos(_source.m_nLastTimePos)
{}
CTDArray::~CTDArray(void)
{
Clear();
}
void CTDArray::AddTimePoint(double _dTime, double _dSourceTimePoint /*= -1 */)
{
if( m_data.empty() ) // nothing to do if its empty
return;
if( _dTime < 0 ) // wrong time
return;
size_t index = GetIndexByTime( _dTime, false ); // get new index to insert
if( index < m_data.size() )
if( m_data[index].time == _dTime ) // time point already exists
return;
if( _dSourceTimePoint == -1 )
{
if( index != 0 )
SetData( index, _dTime, m_data[index-1].value );
else
SetData( index, _dTime, 0 );
}
else
SetData( index, _dTime, GetValue( _dSourceTimePoint ) );
}
void CTDArray::RemoveTimePoint(double _dTime)
{
size_t index = GetIndexByTime( _dTime );
if( index == -1 ) // no such time point
return;
m_data.erase( m_data.begin() + index );
}
void CTDArray::RemoveTimePoints(double _dStartTime, double _dEndTime)
{
if( _dStartTime > _dEndTime ) // wrong time interval
return;
if( m_data.empty() ) // nothing to remove
return;
size_t iLast = GetIndexByTime( _dEndTime, false );
size_t iFirst = GetIndexByTime( _dStartTime, false );
if( ( iLast >= m_data.size() ) || ( m_data[iLast].time != _dEndTime )) // iLast correction
iLast--;
m_data.erase( m_data.begin() + iFirst, m_data.begin() + (iLast + 1) );
}
void CTDArray::ChangeTimePoint(double _dOldTime, double _dNewTime)
{
size_t index = GetIndexByTime( _dOldTime );
if( index == -1 ) // no such time point
return;
if( m_data.size() > 1 )
{
if(( index != 0 ) && ( m_data[index-1].time >= _dNewTime ) ) // new time value is before the previous time point
return;
if(( index != m_data.size()-1 ) && ( m_data[index+1].time <= _dNewTime ) ) // new time value is bigger than the next time point
return;
}
SetData( index, _dNewTime, -1 );
}
double CTDArray::GetValue(double _dTime)
{
if( m_data.size() == 0 ) // no time points
return 0;
size_t index = GetIndexByTime( _dTime );
if( index != -1 ) // time point is found
return m_data[index].value;
if( m_data.size() == 1 ) // not enough data for interpolation
return m_data.front().value;
size_t indexAfter = GetIndexByTime( _dTime, false );
if(( indexAfter != m_data.size() ) && ( indexAfter != 0 )) // point inside - interpolation
//return GetInterpolation( indexAfter-1, indexAfter, _dTime );
return Interpolate( m_data[indexAfter].time, m_data[indexAfter-1].time, m_data[indexAfter].value, m_data[indexAfter-1].value, _dTime );
else if( indexAfter == m_data.size() ) // point after the last - extrapolation
//return GetInterpolation( indexAfter-2, indexAfter-1, _dTime );
return m_data.back().value;
else // point at the beginning - extrapolation
//return GetInterpolation( indexAfter+1, indexAfter+0, _dTime );
return m_data.front().value;
}
void CTDArray::GetVectorValue(const std::vector<double>& _dTimes, std::vector<double>& _vRes)
{
_vRes.resize( _dTimes.size() );
for(size_t i=0; i<_dTimes.size(); ++i )
_vRes[i] = GetValue( _dTimes[i] );
}
void CTDArray::SetValue(double _dTime, double _dValue)
{
if( _dTime < 0 ) // wrong time
return;
if( _dValue < 0 )
_dValue = 0;
size_t index = GetIndexByTime( _dTime );
if( index == -1 ) // no such time point
{
index = GetIndexByTime( _dTime, false ); // get new index to insert
SetData( index, _dTime, _dValue );
}
else // set new value for time point
{
SetData( index, -1, _dValue );
}
}
void CTDArray::CopyFrom(CTDArray& _source, double _dTime)
{
SetValue( _dTime, _source.GetValue( _dTime ) );
}
void CTDArray::CopyFrom(CTDArray& _source, double _dStartTime, double _dEndTime)
{
if( _dStartTime == _dEndTime ) // for single time point
SetValue( _dStartTime, _source.GetValue( _dStartTime ) );
else // for time interval
{
size_t index = _source.GetIndexByTime( _dStartTime, false );
if( ( index != -1 ) && ( index <_source.m_data.size() ) && ( _source.m_data[index].time != _dStartTime ) ) // left boundary of the interval
SetValue( _dStartTime, _source.GetValue( _dStartTime ) );
while( ( index < _source.m_data.size() ) && ( _source.m_data[index].time <= _dEndTime ) ) // interval
{
SetValue( _source.m_data[index].time, _source.m_data[index].value );
index++;
}
if( ( index <_source.m_data.size() ) && ( _source.m_data[index].time != _dEndTime ) ) // right boundary of the interval
SetValue( _dEndTime, _source.GetValue( _dEndTime ) );
}
}
void CTDArray::CopyFromTimePoint(CTDArray& _source, double _dTimeSrc, double _dTimeDest)
{
SetValue( _dTimeDest, _source.GetValue( _dTimeSrc ) );
}
void CTDArray::GetCacheArray( const std::vector<double>& _vTP, std::vector<double>& _vOut )
{
_vOut.resize( _vTP.size(), -1 );
size_t nInternalCnt = 0;
for(size_t i=0; i<_vTP.size(); ++i )
{
if( ( nInternalCnt < m_data.size() ) && ( m_data[nInternalCnt].time == _vTP[i] ) )
{
_vOut[i] = m_data[nInternalCnt].value;
nInternalCnt++;
}
}
RemoveTimePoints( _vTP.front(), _vTP.back() );
std::vector<STDValue>(m_data).swap(m_data);
}
bool CTDArray::SetCacheArray( const std::vector<double>& _vTP, const std::vector<double>& _vData )
{
if( _vTP.size() > _vData.size() )
return false;
if( !m_data.empty() )
//return false;
m_data.clear();
for(size_t i=0; i<_vTP.size(); ++i )
if( ( _vData[i] != -1 ) && ( _vTP[i] != -1 ) )
m_data.push_back( STDValue( _vTP[i], _vData[i] ) );
return !m_data.empty();
}
void CTDArray::GetDataForSave(const std::vector<double>& _vTP, std::vector<double>& _vOut)
{
_vOut.resize(_vTP.size());
size_t iCnt = GetIndexByTime(_vTP.front());
double dFirstValue = -2;
bool bAllAreEqual = true;
if (iCnt != -1)
for (size_t i = 0; i < _vTP.size(); ++i)
{
if ((iCnt < m_data.size()) && (m_data[iCnt].time == _vTP[i]))
{
_vOut[i] = m_data[iCnt].value;
if (dFirstValue == -2)
dFirstValue = m_data[iCnt].value;
else if (bAllAreEqual && (dFirstValue != m_data[iCnt].value))
bAllAreEqual = false;
iCnt++;
}
}
else
{
size_t iWr = 0;
for (double t : _vTP)
{
const size_t iRd = GetIndexByTime(t);
if (iRd < m_data.size() && m_data[iRd].time == _vTP[iWr])
_vOut[iWr] = m_data[iRd].value;
else
_vOut[iWr] = GetValue(t);
if (dFirstValue == -2.0)
dFirstValue = _vOut[iWr];
else if (bAllAreEqual && dFirstValue != _vOut[iWr])
bAllAreEqual = false;
++iWr;
}
}
if (bAllAreEqual && !_vOut.empty())
_vOut.resize(1, _vOut.front());
}
bool CTDArray::SetDataForLoad(const std::vector<double>& _vTP, const std::vector<double>& _vData)
{
std::vector<double> vData = _vData;
if (_vTP.size() != vData.size())
{
if (vData.size() == 1)
{
vData.resize(_vTP.size(), vData.front());
}
else
{
return false;
}
}
size_t nEmptyCnt = 0;
for (size_t i = 0; i < _vTP.size(); ++i)
if ((vData[i] != -1) && (_vTP[i] != -1))
m_data.push_back(STDValue(_vTP[i], vData[i]));
else
nEmptyCnt++;
return vData.size() != nEmptyCnt;
}
void CTDArray::Clear()
{
m_data.clear();
}
bool CTDArray::IsEmpty() const
{
return m_data.empty();
}
size_t CTDArray::GetDataLength() const
{
return m_data.size();
}
CTDArray& CTDArray::operator=(CTDArray& _source)
{
if(this == &_source)
return *this;
Clear();
m_data = _source.m_data;
m_nLastTimePos = _source.m_nLastTimePos;
return *this;
}
void CTDArray::CompressData( double _dStartTime, double _dEndTime, double _dATol, double _dRTol )
{
// get indexes of time boundaries
size_t iStart = GetIndexByTime( _dStartTime, false );
size_t iEnd = GetIndexByTime( _dEndTime, false );
if( iEnd == m_data.size() )
iEnd--;
if( iEnd - iStart < 3 ) // nothing to compress
return;
size_t i = iStart+1;
while( i<iEnd-1 )
{
//double dInterpVal = GetInterpolation( i-1, i+1, m_data[i].time );
double dInterpVal = Interpolate( m_data[i-1].time, m_data[i+1].time, m_data[i-1].value, m_data[i+1].value, m_data[i].time );
if(std::fabs( m_data[i].value - dInterpVal ) <= std::fabs( m_data[i].value ) * _dRTol + _dATol ) // value can be interpolated. remove
{
m_data.erase( m_data.begin() + i );
iEnd--;
}
else
i++;
}
}
size_t CTDArray::GetIndexByTime(double _dTime, bool _bIsStrict /*= true */)
{
// check if empty
if( m_data.empty() )
{
if( _bIsStrict )
return -1;
else
return 0;
}
// check last used point
if( ( m_nLastTimePos < m_data.size() ) && ( m_data.at( m_nLastTimePos ).time == _dTime ) )
return m_nLastTimePos;
// check next of last used point
if( ( ( m_nLastTimePos+1 ) < m_data.size() ) && ( m_data.at( m_nLastTimePos+1 ).time == _dTime ))
return ++m_nLastTimePos;
// check previous of last used point
if( ( m_nLastTimePos > 0 ) && ( ( m_nLastTimePos-1 ) < m_data.size() ) && ( m_data.at( m_nLastTimePos-1 ).time == _dTime ))
return --m_nLastTimePos;
// check boundaries
if( m_data.front().time > _dTime )
{
if( _bIsStrict )
return -1;
else
return 0;
}
if( m_data.back().time < _dTime )
{
if( _bIsStrict )
return -1;
else
return m_data.size();
}
// binary search
size_t nFirst = 0;
size_t nLast = m_data.size();
size_t nMid = (size_t)(nFirst + nLast) >> 1;
while( nFirst < nLast )
{
if ( _dTime <= m_data[nMid].time )
nLast = nMid;
else
nFirst = nMid + 1;
nMid = (size_t)(nFirst + nLast) >> 1;
}
if( ( m_data[nLast].time == _dTime ) || ( !_bIsStrict ) )
{
m_nLastTimePos = nLast;
return m_nLastTimePos;
}
else
return -1;
}
void CTDArray::SetData(size_t _nIndex, double _dTime, double _dValue)
{
if( _dTime == -1 ) // value changing, no inserting
{
m_data[_nIndex].value = _dValue;
}
else if( _dValue == -1 ) // time changing, no inserting
{
m_data[_nIndex].time = _dTime;
}
else // adding of new point, inserting
{
m_data.insert( m_data.begin() + _nIndex, STDValue( _dTime, _dValue ) );
}
//if( _dTime == -1 ) // value changing, no inserting
//{
// if( m_data.size() < 3 ) // just set new value
// {
// m_data[_nIndex].value = _dValue;
// }
// else if( _nIndex == 0 ) // changing at the beginning
// {
// m_data[_nIndex].value = _dValue;
// // check if the next value can be interpolated
// double dInterpVal = GetInterpolation( _nIndex, _nIndex+2, m_data[_nIndex+1].time );
// double dRealVal = m_data[_nIndex+1].value;
// if( std::fabs( dRealVal - dInterpVal ) <= std::fabs( dRealVal ) * m_dRTol + m_dATol ) // next value can be removed
// m_data.erase( m_data.begin()+_nIndex+1 );
// }
// else if( _nIndex == m_data.size()-1 ) // changing at the end
// {
// m_data[_nIndex].value = _dValue;
// // check if the previous value can be interpolated
// double dInterpVal = GetInterpolation( _nIndex-2, _nIndex, m_data[_nIndex-1].time );
// double dRealVal = m_data[_nIndex-1].value;
// if( std::fabs( dRealVal - dInterpVal ) <= std::fabs( dRealVal ) * m_dRTol + m_dATol ) // previous value can be removed
// m_data.erase( m_data.begin()+_nIndex-1 );
// }
// else // changing inside
// {
// // check if the value can be interpolated
// double dInterpVal = GetInterpolation( _nIndex-1, _nIndex+1, m_data[_nIndex].time );
// if( std::fabs( _dValue - dInterpVal ) > std::fabs( _dValue ) * m_dRTol + m_dATol ) // value can't be interpolated. set
// m_data[_nIndex].value = _dValue;
// }
//}
//else if( _dValue == -1 ) // time changing, no inserting
//{
// if( m_data.size() < 3 ) // just set new time
// {
// m_data[_nIndex].time = _dTime;
// }
// else if( _nIndex == 0 ) // changing at the beginning
// {
// m_data[_nIndex].time = _dTime;
// // check if the next value can be interpolated
// double dInterpVal = GetInterpolation( _nIndex, _nIndex+2, m_data[_nIndex+1].time );
// double dRealVal = m_data[_nIndex+1].value;
// if( std::fabs( dRealVal - dInterpVal ) <= std::fabs( dRealVal ) * m_dRTol + m_dATol ) // next value can be removed
// m_data.erase( m_data.begin()+_nIndex+1 );
// }
// else if( _nIndex == m_data.size()-1 ) // changing at the end
// {
// m_data[_nIndex].time = _dTime;
// // check if the previous value can be interpolated
// double dInterpVal = GetInterpolation( _nIndex-2, _nIndex, m_data[_nIndex-1].time );
// double dRealVal = m_data[_nIndex-1].value;
// if( std::fabs( dRealVal - dInterpVal ) <= std::fabs( dRealVal ) * m_dRTol + m_dATol ) // previous value can be removed
// m_data.erase( m_data.begin()+_nIndex-1 );
// }
// else // changing inside
// {
// // check if the value can be interpolated
// double dInterpVal = GetInterpolation( _nIndex-1, _nIndex+1, _dTime );
// double dRealVal = m_data[_nIndex].value;
// if( std::fabs( dRealVal - dInterpVal ) > std::fabs( dRealVal ) * m_dRTol + m_dATol ) // value can't be interpolated. set
// m_data[_nIndex].time = _dTime;
// }
//}
//else // adding of new point, inserting
//{
// if( m_data.size() < 2 ) // just set new value
// {
// m_data.insert( m_data.begin() + _nIndex, sTDValue( _dTime, _dValue ) );
// }
// else if( _nIndex == 0 ) // adding to the beginning
// {
// double dInterpVal = GetInterpolation( _dValue, m_data[_nIndex+1].value, _dTime, m_data[_nIndex+1].time, m_data[_nIndex].time );
// double dRealVal = m_data[_nIndex].value;
// if( std::fabs( dRealVal - dInterpVal ) <= std::fabs( dRealVal ) * m_dRTol + m_dATol ) // next value can be removed
// {
// m_data[_nIndex].time = _dTime;
// m_data[_nIndex].value = _dValue;
// }
// else // insert new
// {
// m_data.insert( m_data.begin() + _nIndex, sTDValue( _dTime, _dValue ) );
// }
// }
// else if( _nIndex == m_data.size() ) // adding to the end
// {
// double dInterpVal = GetInterpolation( m_data[_nIndex-2].value, _dValue, m_data[_nIndex-2].time, _dTime, m_data[_nIndex-1].time );
// double dRealVal = m_data[_nIndex-1].value;
// if( std::fabs( dRealVal - dInterpVal ) <= std::fabs( dRealVal ) * m_dRTol + m_dATol ) // next value can be removed
// {
// m_data[_nIndex-1].time = _dTime;
// m_data[_nIndex-1].value = _dValue;
// }
// else // insert new
// {
// m_data.insert( m_data.begin() + _nIndex, sTDValue( _dTime, _dValue ) );
// }
// }
// else // inserting
// {
// // check if the value can be interpolated
// double dInterpVal = GetInterpolation( _nIndex-1, _nIndex, _dTime );
// if( std::fabs( _dValue - dInterpVal ) > std::fabs( _dValue ) * m_dRTol + m_dATol ) // value can't be interpolated. insert
// {
// m_data.insert( m_data.begin() + _nIndex, sTDValue( _dTime, _dValue ) );
// }
// }
//}
}
//double CTDArray::GetInterpolation(unsigned _nIndex1, unsigned _nIndex2, double _dTime) const
//{
// return ( m_data[_nIndex2].value - m_data[_nIndex1].value ) / ( m_data[_nIndex2].time - m_data[_nIndex1].time ) * ( _dTime - m_data[_nIndex1].time ) + m_data[_nIndex1].value;
//}
//
//double CTDArray::GetInterpolation(double _dLVal, double _dRVal, double _dLTime, double _dRTime, double _dTime) const
//{
// return ( _dRVal - _dLVal ) / ( _dRTime - _dLTime ) * ( _dTime - _dLTime ) + _dLVal;
//}
void CTDArray::ExtrapolateToPoint(double _dT1, double _dT2, double _dTExtra)
{
double dV1 = GetValue( _dT1 );
double dV2 = GetValue( _dT2 );
//double dVExtra = ( dV2 - dV1 ) / ( _dT2 - _dT1 ) * ( _dTExtra - _dT1 ) + dV1;
double dVExtra = Interpolate( _dT1, _dT2, dV1, dV2, _dTExtra );
SetValue( _dTExtra, dVExtra );
}
void CTDArray::ExtrapolateToPoint(double _dT0, double _dT1, double _dT2, double _dTExtra)
{
double dV0 = GetValue( _dT0 );
double dV1 = GetValue( _dT1 );
double dV2 = GetValue( _dT2 );
double dVExtra = Extrapolate( dV0, dV1, dV2, _dT0, _dT1, _dT2, _dTExtra );
SetValue( _dTExtra, dVExtra );
}
|
