Remove remaining irrelevant comments from eqpalg (glitch_detection, roller, STA)
This commit is contained in:
parent
224c2c45c4
commit
e3207fa593
@ -153,7 +153,6 @@ bool GlitchDetection::get_prr() {
|
|||||||
<< ",rulename:" << this->rule_name_
|
<< ",rulename:" << this->rule_name_
|
||||||
<< ",get_prr():" << prr_result
|
<< ",get_prr():" << prr_result
|
||||||
<< ",data_index_:" << data_index_ << std::endl;
|
<< ",data_index_:" << data_index_ << std::endl;
|
||||||
// exp_mpdule_ptr_->print_value();
|
|
||||||
}
|
}
|
||||||
return prr_result;
|
return prr_result;
|
||||||
}
|
}
|
||||||
|
|||||||
@ -9,7 +9,6 @@
|
|||||||
#include <utility>
|
#include <utility>
|
||||||
#include <vector>
|
#include <vector>
|
||||||
#include "mix_cc/ihyper_db.h"
|
#include "mix_cc/ihyper_db.h"
|
||||||
// 炉辊组算法无需额外的算法初始化步骤
|
|
||||||
int Roller::init() {
|
int Roller::init() {
|
||||||
int res = 0;
|
int res = 0;
|
||||||
try {
|
try {
|
||||||
|
|||||||
@ -436,8 +436,8 @@ bool STA::reset_data(double range, double init_value) {
|
|||||||
is_need_ = true;
|
is_need_ = true;
|
||||||
is_init_ = true;
|
is_init_ = true;
|
||||||
is_task_ = true;
|
is_task_ = true;
|
||||||
this->range_ = range; ///<间距
|
this->range_ = range;
|
||||||
this->init_value_ = init_value; ///< a0,an = a0 + n*range_
|
this->init_value_ = init_value;
|
||||||
this->dist_data_.clear();
|
this->dist_data_.clear();
|
||||||
this->sample_1d_data_.clear();
|
this->sample_1d_data_.clear();
|
||||||
logger_->Info() << "STA::reset_data,range:" << range
|
logger_->Info() << "STA::reset_data,range:" << range
|
||||||
@ -457,22 +457,22 @@ int STA::task_update_ci_dist() {
|
|||||||
double dump_size = this->running_stat_.current_n();
|
double dump_size = this->running_stat_.current_n();
|
||||||
if (dump_size > 3) {
|
if (dump_size > 3) {
|
||||||
this->scale_ = (double)this->k_dest_dump_size / dump_size;
|
this->scale_ = (double)this->k_dest_dump_size / dump_size;
|
||||||
vector<double> data_value; ///<解压缩后的数据
|
vector<double> data_value;
|
||||||
for (auto item : this->sample_1d_data_) {
|
for (auto item : this->sample_1d_data_) {
|
||||||
int count_now = std::ceil(
|
int count_now = std::ceil(
|
||||||
scale_ * item.Count); //根据该条记录的频次 得到解压到数据个数
|
scale_ * item.Count);
|
||||||
for (int i = 0; i < count_now; i++) {
|
for (int i = 0; i < count_now; i++) {
|
||||||
data_value.push_back(RandMinMax(item.X1 - range_, item.X1 + range_));
|
data_value.push_back(RandMinMax(item.X1 - range_, item.X1 + range_));
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
std::sort(data_value.begin(), data_value.end()); ///< 从小到大排序
|
std::sort(data_value.begin(), data_value.end());
|
||||||
logger_->Debug() << "解压缩数据量:" << data_value.size() << ",data[0]"
|
logger_->Debug() << "解压缩数据量:" << data_value.size() << ",data[0]"
|
||||||
<< data_value[0] << ",data[-1]" << *data_value.rbegin()
|
<< data_value[0] << ",data[-1]" << *data_value.rbegin()
|
||||||
<< endl;
|
<< endl;
|
||||||
this->dist_1d_.auto_test(this->running_stat_, data_value);
|
this->dist_1d_.auto_test(this->running_stat_, data_value);
|
||||||
if (this->dist_1d_.valid()) {
|
if (this->dist_1d_.valid()) {
|
||||||
dist_range_ci_ = this->dist_1d_.get_range();
|
dist_range_ci_ = this->dist_1d_.get_range();
|
||||||
res += this->update_t_sample_mag(); ///< 更新 T_SAMPLE_MAG
|
res += this->update_t_sample_mag();
|
||||||
} else {
|
} else {
|
||||||
logger_->Debug() << "区间不合法!" << endl;
|
logger_->Debug() << "区间不合法!" << endl;
|
||||||
res = -1;
|
res = -1;
|
||||||
|
|||||||
Loading…
Reference in New Issue
Block a user