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
|
// SPDX-License-Identifier: Apache-2.0
//
// Copyright 2008-2016 Conrad Sanderson (http://conradsanderson.id.au)
// Copyright 2008-2016 National ICT Australia (NICTA)
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// ------------------------------------------------------------------------
//! \addtogroup running_stat
//! @{
template<typename eT>
inline
arma_counter<eT>::~arma_counter()
{
arma_extra_debug_sigprint_this(this);
}
template<typename eT>
inline
arma_counter<eT>::arma_counter()
: d_count( eT(0))
, i_count(uword(0))
{
arma_extra_debug_sigprint_this(this);
}
template<typename eT>
inline
const arma_counter<eT>&
arma_counter<eT>::operator++()
{
if(i_count < ARMA_MAX_UWORD)
{
i_count++;
}
else
{
d_count += eT(ARMA_MAX_UWORD);
i_count = 1;
}
return *this;
}
template<typename eT>
inline
void
arma_counter<eT>::operator++(int)
{
operator++();
}
template<typename eT>
inline
void
arma_counter<eT>::reset()
{
d_count = eT(0);
i_count = uword(0);
}
template<typename eT>
inline
eT
arma_counter<eT>::value() const
{
return d_count + eT(i_count);
}
template<typename eT>
inline
eT
arma_counter<eT>::value_plus_1() const
{
if(i_count < ARMA_MAX_UWORD)
{
return d_count + eT(i_count + 1);
}
else
{
return d_count + eT(ARMA_MAX_UWORD) + eT(1);
}
}
template<typename eT>
inline
eT
arma_counter<eT>::value_minus_1() const
{
if(i_count > 0)
{
return d_count + eT(i_count - 1);
}
else
{
return d_count - eT(1);
}
}
//
template<typename eT>
inline
running_stat<eT>::~running_stat()
{
arma_extra_debug_sigprint_this(this);
}
template<typename eT>
inline
running_stat<eT>::running_stat()
: r_mean ( eT(0))
, r_var (typename running_stat<eT>::T(0))
, min_val ( eT(0))
, max_val ( eT(0))
, min_val_norm(typename running_stat<eT>::T(0))
, max_val_norm(typename running_stat<eT>::T(0))
{
arma_extra_debug_sigprint_this(this);
}
//! update statistics to reflect new sample
template<typename eT>
inline
void
running_stat<eT>::operator() (const typename running_stat<eT>::T sample)
{
arma_extra_debug_sigprint();
if( arma_isfinite(sample) == false )
{
arma_debug_warn_level(3, "running_stat: sample ignored as it is non-finite" );
return;
}
running_stat_aux::update_stats(*this, sample);
}
//! update statistics to reflect new sample (version for complex numbers)
template<typename eT>
inline
void
running_stat<eT>::operator() (const std::complex< typename running_stat<eT>::T >& sample)
{
arma_extra_debug_sigprint();
if( arma_isfinite(sample) == false )
{
arma_debug_warn_level(3, "running_stat: sample ignored as it is non-finite" );
return;
}
running_stat_aux::update_stats(*this, sample);
}
//! set all statistics to zero
template<typename eT>
inline
void
running_stat<eT>::reset()
{
arma_extra_debug_sigprint();
// typedef typename running_stat<eT>::T T;
counter.reset();
r_mean = eT(0);
r_var = T(0);
min_val = eT(0);
max_val = eT(0);
min_val_norm = T(0);
max_val_norm = T(0);
}
//! mean or average value
template<typename eT>
inline
eT
running_stat<eT>::mean() const
{
arma_extra_debug_sigprint();
return r_mean;
}
//! variance
template<typename eT>
inline
typename running_stat<eT>::T
running_stat<eT>::var(const uword norm_type) const
{
arma_extra_debug_sigprint();
const T N = counter.value();
if(N > T(1))
{
if(norm_type == 0)
{
return r_var;
}
else
{
const T N_minus_1 = counter.value_minus_1();
return (N_minus_1/N) * r_var;
}
}
else
{
return T(0);
}
}
//! standard deviation
template<typename eT>
inline
typename running_stat<eT>::T
running_stat<eT>::stddev(const uword norm_type) const
{
arma_extra_debug_sigprint();
return std::sqrt( (*this).var(norm_type) );
}
//! minimum value
template<typename eT>
inline
eT
running_stat<eT>::min() const
{
arma_extra_debug_sigprint();
return min_val;
}
//! maximum value
template<typename eT>
inline
eT
running_stat<eT>::max() const
{
arma_extra_debug_sigprint();
return max_val;
}
template<typename eT>
inline
eT
running_stat<eT>::range() const
{
arma_extra_debug_sigprint();
return (max_val - min_val);
}
//! number of samples so far
template<typename eT>
inline
typename get_pod_type<eT>::result
running_stat<eT>::count() const
{
arma_extra_debug_sigprint();
return counter.value();
}
//! update statistics to reflect new sample (version for non-complex numbers, non-complex sample)
template<typename eT>
inline
void
running_stat_aux::update_stats(running_stat<eT>& x, const eT sample, const typename arma_not_cx<eT>::result* junk)
{
arma_extra_debug_sigprint();
arma_ignore(junk);
typedef typename running_stat<eT>::T T;
const T N = x.counter.value();
if(N > T(0))
{
if(sample < x.min_val)
{
x.min_val = sample;
}
if(sample > x.max_val)
{
x.max_val = sample;
}
const T N_plus_1 = x.counter.value_plus_1();
const T N_minus_1 = x.counter.value_minus_1();
// note: variance has to be updated before the mean
const eT tmp = sample - x.r_mean;
x.r_var = N_minus_1/N * x.r_var + (tmp*tmp)/N_plus_1;
x.r_mean = x.r_mean + (sample - x.r_mean)/N_plus_1;
//x.r_mean = (N/N_plus_1)*x.r_mean + sample/N_plus_1;
//x.r_mean = (x.r_mean + sample/N) * N/N_plus_1;
}
else
{
x.r_mean = sample;
x.min_val = sample;
x.max_val = sample;
// r_var is initialised to zero
// in the constructor and reset()
}
x.counter++;
}
//! update statistics to reflect new sample (version for non-complex numbers, complex sample)
template<typename eT>
inline
void
running_stat_aux::update_stats(running_stat<eT>& x, const std::complex<eT>& sample, const typename arma_not_cx<eT>::result* junk)
{
arma_extra_debug_sigprint();
arma_ignore(junk);
running_stat_aux::update_stats(x, std::real(sample));
}
//! update statistics to reflect new sample (version for complex numbers, non-complex sample)
template<typename eT>
inline
void
running_stat_aux::update_stats(running_stat<eT>& x, const typename eT::value_type sample, const typename arma_cx_only<eT>::result* junk)
{
arma_extra_debug_sigprint();
arma_ignore(junk);
typedef typename eT::value_type T;
running_stat_aux::update_stats(x, std::complex<T>(sample));
}
//! alter statistics to reflect new sample (version for complex numbers, complex sample)
template<typename eT>
inline
void
running_stat_aux::update_stats(running_stat<eT>& x, const eT& sample, const typename arma_cx_only<eT>::result* junk)
{
arma_extra_debug_sigprint();
arma_ignore(junk);
typedef typename eT::value_type T;
const T sample_norm = std::norm(sample);
const T N = x.counter.value();
if(N > T(0))
{
if(sample_norm < x.min_val_norm)
{
x.min_val_norm = sample_norm;
x.min_val = sample;
}
if(sample_norm > x.max_val_norm)
{
x.max_val_norm = sample_norm;
x.max_val = sample;
}
const T N_plus_1 = x.counter.value_plus_1();
const T N_minus_1 = x.counter.value_minus_1();
x.r_var = N_minus_1/N * x.r_var + std::norm(sample - x.r_mean)/N_plus_1;
x.r_mean = x.r_mean + (sample - x.r_mean)/N_plus_1;
//x.r_mean = (N/N_plus_1)*x.r_mean + sample/N_plus_1;
//x.r_mean = (x.r_mean + sample/N) * N/N_plus_1;
}
else
{
x.r_mean = sample;
x.min_val = sample;
x.max_val = sample;
x.min_val_norm = sample_norm;
x.max_val_norm = sample_norm;
// r_var is initialised to zero
// in the constructor and reset()
}
x.counter++;
}
//! @}
|