-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathStatManager.cpp
More file actions
135 lines (107 loc) · 3.04 KB
/
Copy pathStatManager.cpp
File metadata and controls
135 lines (107 loc) · 3.04 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
#include "StatManager.hpp"
#include <math.h>
StatManager::StatManager(int numPins) {
this->numPins = numPins;
values = new int*[numPins];
counts = new int[numPins];
for (int i = 0; i < numPins; ++i) {
values[i] = nullptr;
counts[i] = 0;
}
}
StatManager::~StatManager() {
for (int i = 0; i < numPins; ++i) {
delete[] values[i];
}
delete[] values;
delete[] counts;
}
void StatManager::addValues(int* pinValues) {
for (int i = 0; i < numPins; ++i) {
int* newValues = new int[counts[i] + 1];
for (int j = 0; j < counts[i]; ++j) {
newValues[j] = values[i][j];
}
newValues[counts[i]] = pinValues[i];
delete[] values[i];
values[i] = newValues;
counts[i]++;
}
}
float* StatManager::getAverages() {
float* averages = new float[numPins];
for (int i = 0; i < numPins; ++i) {
float sum = 0;
for (int j = 0; j < counts[i]; ++j) {
sum += values[i][j];
}
averages[i] = (counts[i] > 0) ? sum / counts[i] : 0;
}
return averages;
}
float StatManager::getMedians(int* sortedValues, int size) {
int middle = size / 2;
if (size % 2 == 0) {
int middleMinusOne = middle - 1;
return (sortedValues[middleMinusOne] + sortedValues[middle]) / 2.0f;
} else {
return sortedValues[middle];
}
}
float* StatManager::getMedians() {
float* medians = new float[numPins];
for (int i = 0; i < numPins; ++i) {
int* sortedValues = new int[counts[i]];
for (int j = 0; j < counts[i]; ++j) {
sortedValues[j] = values[i][j];
}
// Tri manuel
for (int j = 0; j < counts[i] - 1; ++j) {
for (int k = 0; k < counts[i] - j - 1; ++k) {
if (sortedValues[k] > sortedValues[k + 1]) {
int temp = sortedValues[k];
sortedValues[k] = sortedValues[k + 1];
sortedValues[k + 1] = temp;
}
}
}
medians[i] = getMedians(sortedValues, counts[i]);
delete[] sortedValues;
}
return medians;
}
float* StatManager::getStandardDeviations() {
float* deviations = new float[numPins];
float* averages = getAverages();
for (int i = 0; i < numPins; ++i) {
deviations[i] = 0;
if (counts[i] > 1) {
float mean = averages[i];
float squaredDiffSum = 0;
for (int j = 0; j < counts[i]; ++j) {
float diff = values[i][j] - mean;
squaredDiffSum += diff * diff;
}
deviations[i] = sqrt(squaredDiffSum / (counts[i] - 1));
}
}
delete[] averages;
return deviations;
}
float* StatManager::getVariances() {
float* variances = new float[numPins];
float* averages = getAverages();
for (int i = 0; i < numPins; ++i) {
variances[i] = 0;
if (counts[i] > 1) {
float squaredDiffSum = 0;
for (int j = 0; j < counts[i]; ++j) {
float diff = values[i][j] - averages[i];
squaredDiffSum += diff * diff;
}
variances[i] = squaredDiffSum / (counts[i] - 1);
}
}
delete[] averages;
return variances;
}