| @@ -70,6 +70,26 public: | |||||
| 70 | double at(int index) const { return *m_Its.at(index); } |
|
70 | double at(int index) const { return *m_Its.at(index); } | |
| 71 | double first() const { return *m_Its.front(); } |
|
71 | double first() const { return *m_Its.front(); } | |
| 72 |
|
72 | |||
|
|
73 | /// @return the min value among all components | |||
|
|
74 | double min() const | |||
|
|
75 | { | |||
|
|
76 | auto end = m_Its.cend(); | |||
|
|
77 | auto it = std::min_element(m_Its.cbegin(), end, [](const auto &it1, const auto &it2) { | |||
|
|
78 | return SortUtils::minCompareWithNaN(*it1, *it2); | |||
|
|
79 | }); | |||
|
|
80 | return it != end ? **it : std::numeric_limits<double>::quiet_NaN(); | |||
|
|
81 | } | |||
|
|
82 | ||||
|
|
83 | /// @return the max value among all components | |||
|
|
84 | double max() const | |||
|
|
85 | { | |||
|
|
86 | auto end = m_Its.cend(); | |||
|
|
87 | auto it = std::max_element(m_Its.cbegin(), end, [](const auto &it1, const auto &it2) { | |||
|
|
88 | return SortUtils::maxCompareWithNaN(*it1, *it2); | |||
|
|
89 | }); | |||
|
|
90 | return it != end ? **it : std::numeric_limits<double>::quiet_NaN(); | |||
|
|
91 | } | |||
|
|
92 | ||||
| 73 | void next() |
|
93 | void next() | |
| 74 | { |
|
94 | { | |
| 75 | for (auto &it : m_Its) { |
|
95 | for (auto &it : m_Its) { | |
General Comments 0
You need to be logged in to leave comments.
Login now