10 #ifndef KOHO_UTILITIES_H 11 #define KOHO_UTILITIES_H 28 unsigned long max_index = 0;
29 X max_value = x[max_index];
31 for (
unsigned long i=1; i<n; ++i) {
32 if (max_value < x[i]) {
34 max_value = x[max_index];
43 template <
class X,
class S>
49 std::vector<std::pair<X, S>> pxs(x.size());
50 auto x_itr = x.begin();
51 auto s_itr = s.begin();
54 p.second = *(s_itr++);
59 sort(pxs.begin()+start, pxs.end()-(pxs.size()-end),
60 [](
const std::pair<X, S> &a,
const std::pair<X, S> &b) ->
bool {
return a.first < b.first; });
62 sort(pxs.begin()+start, pxs.end()-(pxs.size()-end),
63 [](
const std::pair<X, S> &a,
const std::pair<X, S> &b) ->
bool {
return a.first > b.first; });
71 *(s_itr++) = p.second;
Definition: decision_forest.cpp:20
unsigned long maxIndex(X *x, unsigned long n)
Definition: utilities.h:25
void sort2VectorsByFirstVector(std::vector< X > &x, std::vector< S > &s, long start, long end, bool increase=true)
Definition: utilities.h:44