| 29 | } |
| 30 | |
| 31 | void doAddSort(HighsInt& num_values_sorted, |
| 32 | const HighsInt& max_num_values_sorted, |
| 33 | vector<double>& best_double_values, |
| 34 | vector<HighsInt>& best_indices, const HighsInt num_values, |
| 35 | const vector<double>& values, const vector<HighsInt>& indices) { |
| 36 | num_values_sorted = 0; |
| 37 | for (HighsInt ix = 1; ix <= num_values; ix++) { |
| 38 | addToDecreasingHeap(num_values_sorted, max_num_values_sorted, |
| 39 | best_double_values, best_indices, values[ix], |
| 40 | indices[ix]); |
| 41 | } |
| 42 | sortDecreasingHeap(num_values_sorted, best_double_values, best_indices); |
| 43 | } |
| 44 | |
| 45 | void reportValuesIndices(const HighsInt num_values, |
| 46 | const vector<double>& values, |
no test coverage detected