|
Victor
|
Methods to manages the global statistic data. More...
Public Member Functions | |
| globalStatistic () | |
| ~globalStatistic () | |
| void | FilterCutoffGenerator (vector< double > values, int count, int loopNr) |
| void | outputArray (ofstream &outF) |
| void | updateRankedRmsArray (int loopNr, vector< double > rms) |
| void | updateRMSArray (int loopNr, multiset< ranking_helper2 > rmsh) |
Methods to manages the global statistic data.
Used to work with the data for the global statistic in the prop_calibration program.
| globalStatistic | ( | ) |
Basic contructor
| ~globalStatistic | ( | ) |
Basic destructor
| void FilterCutoffGenerator | ( | vector< double > | values, |
| int | count, | ||
| int | loopNr | ||
| ) |
We check the first count values in the vector values for the minimum. This minimum is put into the proper array.
| pointer | to vector that contains the values(vector<double>) , elements in the vector(int),index for the filter cut off(int) |
| void outputArray | ( | ofstream & | outF | ) |
The arrays in this class are written to the file the filehandle refers to.
| reference | to the output file(ofstream &) |
| void updateRankedRmsArray | ( | int | loopNr, |
| vector< double > | rms | ||
| ) |
This function iterates over the rmsh array until BEST_COUNT is reached. In each loop the values of the RMS of the best BEST_COUNT solutions are stored. Also the array which contains the number of entries is updated If we have less than 6 surviving solutions, we take the worst solution and add it to the remaining arrays. Besides this, we update the statistic for the average number of surviving solutions.
| index | of the loop (int), pointer to vector that contains the rms values(vector<double>) |
| void updateRMSArray | ( | int | loopNr, |
| multiset< ranking_helper2 > | rmsh | ||
| ) |
This function iterates over the rmsh array until BEST_COUNT is reached. In each loop the values of the RMS of the best BEST_COUNT solutions are stored. Also the array which contains the number of entries is updated. If we don't have le.BEST_COUNT solutions left, we fill the rest of the arrays with the worst rms value.
| loop | index(int), a set of ranking helpers(multiset<ranking_helper2> ) |