13 #include "../processing/combiners/tracepluscombiner.h"
14 #include "../processing/combiners/traceminuscombiner.h"
16 #include "../pappsoexception.h"
17 #include "../exception/exceptionoutofrange.h"
18 #include "../exception/exceptionnotpossible.h"
19 #include "../processing/filters/filterresample.h"
20 #include "../processing/filters/filterpass.h"
30 std::vector<DataPoint>::iterator
32 std::vector<DataPoint>::iterator end,
35 return std::find_if(begin, end, [value](
const DataPoint &to_compare) {
36 if(to_compare.
x < value)
44 std::vector<DataPoint>::const_iterator
46 std::vector<DataPoint>::const_iterator end,
49 return std::find_if(begin, end, [value](
const DataPoint &to_compare) {
50 if(to_compare.
x < value)
58 std::vector<DataPoint>::iterator
60 std::vector<DataPoint>::iterator end,
63 return std::find_if(begin, end, [value](
const DataPoint &to_compare) {
64 if(to_compare.
x > value)
72 std::vector<DataPoint>::const_iterator
74 std::vector<DataPoint>::const_iterator end,
77 return std::find_if(begin, end, [value](
const DataPoint &to_compare) {
78 if(to_compare.
x > value)
86 std::vector<DataPoint>::iterator
88 std::vector<DataPoint>::iterator end,
89 const double &y_value)
91 return std::find_if(begin, end, [y_value](
const DataPoint &to_compare) {
92 if(to_compare.
y != y_value)
100 std::vector<DataPoint>::const_iterator
102 std::vector<DataPoint>::const_iterator end,
103 const double &y_value)
105 return std::find_if(begin, end, [y_value](
const DataPoint &to_compare) {
106 if(to_compare.
y != y_value)
115 std::vector<DataPoint>::const_iterator
117 std::vector<DataPoint>::const_iterator end)
119 return std::min_element(
126 std::vector<DataPoint>::iterator
128 std::vector<DataPoint>::iterator end)
130 return std::min_element(
137 std::vector<DataPoint>::const_iterator
139 std::vector<DataPoint>::const_iterator end)
141 return std::max_element(
148 std::vector<DataPoint>::iterator
150 std::vector<DataPoint>::iterator end)
152 return std::max_element(
162 std::vector<DataPoint>::const_iterator
164 std::vector<DataPoint>::const_iterator begin)
166 if(begin == trace.end())
172 while((it != trace.end()) && (it->y <= result->y))
180 std::vector<DataPoint>::const_iterator
182 std::vector<DataPoint>::const_iterator begin)
184 if(begin == trace.begin())
192 while((it != trace.begin()) && (it->y <= result->y))
203 std::vector<DataPoint>::const_iterator end,
206 return std::accumulate(
207 begin, end, init, [](
double a,
const DataPoint &b) {
return a + b.
y; });
212 std::vector<DataPoint>::const_iterator end)
217 QObject::tr(
"unable to compute mean on a trace of size 0"));
218 return (
sumYTrace(begin, end, 0) / nb_element);
223 std::vector<DataPoint>::const_iterator end)
228 QObject::tr(
"unable to compute median on a trace of size 0"));
230 std::vector<DataPoint> data(begin, end);
233 data.begin() + data.size() / 2,
236 return data[data.size() / 2].y;
241 std::vector<DataPoint>::const_iterator end)
246 auto previous = begin;
247 auto next = begin + 1;
251 area += ((next->x - previous->x) * (previous->y + next->y)) / (
double)2;
261 std::vector<DataPoint>::const_iterator end,
264 Trace local_maxima_trace;
266 Trace single_peak_trace;
270 for(
auto iter = begin; iter != end; ++iter)
272 DataPoint iterated_data_point(iter->x, iter->y);
277 if(iterated_data_point.
y < y_floor)
281 if(single_peak_trace.size())
285 local_maxima_trace.push_back(single_peak_trace.
maxYDataPoint());
291 single_peak_trace.clear();
293 previous_data_point = iterated_data_point;
301 previous_data_point = iterated_data_point;
313 if(iterated_data_point.
y == previous_data_point.
y)
319 else if(iterated_data_point.
y > previous_data_point.
y)
328 single_peak_trace.push_back(iterated_data_point);
333 previous_data_point = iterated_data_point;
344 single_peak_trace.push_back(iterated_data_point);
349 previous_data_point = iterated_data_point;
361 if(single_peak_trace.size())
364 local_maxima_trace.push_back(single_peak_trace.
maxYDataPoint());
371 return local_maxima_trace;
381 const std::vector<pappso_double> &yVector)
388 const std::vector<std::pair<pappso_double, pappso_double>> &dataPoints)
390 reserve(dataPoints.size());
392 for(
auto &dataPoint : dataPoints)
415 : std::vector<
DataPoint>(std::move(dataPoints))
428 for(
auto &&item : map_trace)
429 push_back(
DataPoint(item.first, item.second));
454 const std::vector<pappso_double> &yVector)
457 if(xVector.size() != yVector.size())
459 "trace.cpp -- ERROR xVector and yVector must have the same size.");
462 erase(begin(), end());
464 for(std::size_t iter = 0; iter < xVector.size(); ++iter)
466 push_back(
DataPoint(xVector.at(iter), yVector.at(iter)));
475 for(
auto &item : *
this)
477 std::cout << item.x <<
"-" << item.y;
490 erase(begin(), end());
492 for(
auto &&item : map)
494 push_back(
DataPoint(item.first, item.second));
515 assign(other.begin(), other.end());
524 vector<DataPoint>::operator=(std::move(other));
532 return std::make_shared<Trace>(*
this);
539 return std::make_shared<const Trace>(*
this);
543 std::vector<pappso_double>
546 std::vector<pappso_double> values;
548 for(
auto &&dataPoint : *
this)
550 values.push_back(dataPoint.x);
557 std::vector<pappso_double>
560 std::vector<pappso_double> values;
562 for(
auto &&dataPoint : *
this)
564 values.push_back(dataPoint.y);
571 std::map<pappso_double, pappso_double>
574 std::map<pappso_double, pappso_double> map;
576 std::pair<std::map<pappso_double, pappso_double>::iterator,
bool> ret;
578 for(
auto &&dataPoint : *
this)
581 std::pair<pappso_double, pappso_double>(dataPoint.x, dataPoint.y));
583 if(ret.second ==
false)
585 qDebug() << __FILE__ <<
"@" << __LINE__ << __FUNCTION__ <<
"()"
586 <<
"It is odd that the Trace contains multiple same keys.";
589 ret.first->second += dataPoint.y;
618 std::vector<DataPoint>::iterator
622 std::find_if(begin(), end(), [value](
const DataPoint &dataPoint) {
623 return (dataPoint.
x == value);
630 std::vector<DataPoint>::const_iterator
634 std::find_if(begin(), end(), [value](
const DataPoint &dataPoint) {
635 return (dataPoint.
x == value);
645 std::vector<DataPoint>::const_iterator iterator =
648 if(iterator != end())
649 return std::distance(begin(), iterator);
651 return std::numeric_limits<std::size_t>::max();
658 auto iterator = std::find_if(
659 begin(), end(), [value, precision_p](
const DataPoint &data_point) {
664 if(data_point.
x >= (value - delta) && data_point.
x <= (value + delta))
671 return (data_point.
x == value);
675 if(iterator != end())
691 auto dataPoint = std::min_element(
696 if(dataPoint == end())
699 QObject::tr(
"unable to get min peak intensity on spectrum size %1")
710 auto dataPoint = std::max_element(
715 if(dataPoint == end())
718 QObject::tr(
"unable to get max peak intensity on spectrum size %1")
753 return std::accumulate(begin(),
757 return (sum + dataPoint.
y);
774 std::vector<DataPoint>::const_iterator begin_it =
781 if(begin_it->y > max_y)
823 for(
auto &&dataPoint : *
this)
825 text.append(QString(
"%1 %2\n")
826 .arg(dataPoint.x, 0,
'f', 10)
827 .arg(dataPoint.y, 0,
'f', 10));