highs-sys 1.14.2

Rust binding for the HiGHS linear programming solver. See http://highs.dev.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247

#include <algorithm>
#include <vector>

#include "HCheckConfig.h"
#include "catch.hpp"
#include "lp_data/HConst.h"
#include "util/HighsRandom.h"
#include "util/HighsSort.h"

using std::vector;

const bool dev_run = false;

// No commas in test case name.
void getRandomValues(const HighsInt num_values, vector<double>& values,
                     vector<HighsInt>& indices) {
  // Set up a vector of random number and their corresponding indices
  HighsRandom random;
  for (HighsInt ix = 0; ix < num_values; ix++) {
    values[1 + ix] = random.fraction();
    indices[1 + ix] = ix;
  }
}

void doFullSort(const HighsInt num_values, vector<double>& values,
                vector<HighsInt>& indices) {
  // Sort the vector of random number and their corresponding indices
  maxheapsort(values.data(), indices.data(), num_values);
}

void doAddSort(HighsInt& num_values_sorted,
               const HighsInt& max_num_values_sorted,
               vector<double>& best_double_values,
               vector<HighsInt>& best_indices, const HighsInt num_values,
               const vector<double>& values, const vector<HighsInt>& indices) {
  num_values_sorted = 0;
  for (HighsInt ix = 1; ix <= num_values; ix++) {
    addToDecreasingHeap(num_values_sorted, max_num_values_sorted,
                        best_double_values, best_indices, values[ix],
                        indices[ix]);
  }
  sortDecreasingHeap(num_values_sorted, best_double_values, best_indices);
}

void reportValuesIndices(const HighsInt num_values,
                         const vector<double>& values,
                         const vector<HighsInt>& indices) {
  if (!dev_run) return;
  printf("\n  Ix      Value Index\n");
  for (HighsInt ix = 1; ix <= num_values; ix++) {
    printf("%4" HIGHSINT_FORMAT " %10.8f  %4" HIGHSINT_FORMAT "\n", ix,
           values[ix], indices[ix]);
  }
}

void checkIncreasingSort(const HighsInt num_sorted,
                         const vector<double>& values,
                         const vector<HighsInt>& indices,
                         const vector<double>& original_values) {
  // Check that the random numbers are ascending and that the indices
  // point from the original values to their new positions
  bool error0 = false;
  bool error1 = false;
  double previous = -kHighsInf;
  for (HighsInt ix = 0; ix < num_sorted; ix++) {
    if (values[1 + ix] < previous) {
      printf("Values[%2" HIGHSINT_FORMAT "] = %f5.4 < %f5.4 = previous\n",
             1 + ix, values[1 + ix], previous);
      error0 = true;
    }
    previous = values[1 + ix];
    if (values[1 + ix] != original_values[1 + indices[1 + ix]]) {
      printf("Values[%2" HIGHSINT_FORMAT
             "] = %f5.4 != %f5.4 = original_values[indices[%2" HIGHSINT_FORMAT
             "]]\n",
             1 + ix, values[1 + ix], original_values[indices[1 + ix]], 1 + ix);
      error1 = true;
    }
  }

  REQUIRE(error0 == false);
  REQUIRE(error1 == false);
}

void checkDecreasingSort(const HighsInt num_sorted,
                         const vector<double>& values,
                         const vector<HighsInt>& indices,
                         const vector<double>& original_values) {
  // Check that the random numbers are ascending and that the indices
  // point from the original values to their new positions
  bool error0 = false;
  bool error1 = false;
  double previous = kHighsInf;
  for (HighsInt ix = 0; ix < num_sorted; ix++) {
    if (values[1 + ix] > previous) {
      printf("Values[%2" HIGHSINT_FORMAT "] = %f5.4 < %f5.4 = previous\n",
             1 + ix, values[1 + ix], previous);
      error0 = true;
    }
    previous = values[1 + ix];
    if (values[1 + ix] != original_values[1 + indices[1 + ix]]) {
      printf("Values[%2" HIGHSINT_FORMAT
             "] = %f5.4 != %f5.4 = original_values[indices[%2" HIGHSINT_FORMAT
             "]]\n",
             1 + ix, values[1 + ix], original_values[indices[1 + ix]], 1 + ix);
      error1 = true;
    }
  }

  REQUIRE(error0 == false);
  REQUIRE(error1 == false);
}

TEST_CASE("HiGHS_sort", "[highs_data]") {
  HighsInt num_values = 10;
  vector<HighsInt> indices;
  vector<HighsInt> int_values;
  vector<double> double_values;
  vector<double> original_double_values;
  indices.resize(1 + num_values);
  int_values.resize(num_values);
  double_values.resize(1 + num_values);
  original_double_values.resize(1 + num_values);

  getRandomValues(num_values, double_values, indices);
  reportValuesIndices(num_values, double_values, indices);
  original_double_values = double_values;
  doFullSort(num_values, double_values, indices);
  reportValuesIndices(num_values, double_values, indices);
  checkIncreasingSort(num_values, double_values, indices,
                      original_double_values);

  // Use the indices of the previous sort as a vector of integers to sort
  for (HighsInt ix = 0; ix < num_values; ix++) {
    double_values[ix] = double_values[ix + 1];
    int_values[ix] = indices[1 + ix];
  }
  double_values.resize(num_values);
  int_values.resize(num_values);
  std::make_heap(int_values.begin(), int_values.end());
  std::sort_heap(int_values.begin(), int_values.end());
  //  maxheapsort(int_values.data(), num_values);

  bool ok;
  // Check that the values in the vector of doubles are ascending - can do
  // strict test
  ok = increasingSetOk(double_values, 0, 1, true);
  REQUIRE(ok == true);

  // Check that the values in the vector of integers are ascending - maybe can't
  // do strict test
  ok = increasingSetOk(int_values, 0, num_values, false);
  REQUIRE(ok == true);

  num_values = 14;
  vector<HighsInt> set;
  vector<double> lb;
  vector<double> ub;
  set.resize(num_values);
  lb.resize(num_values);
  ub.resize(num_values);

  set[0] = 6;
  lb[0] = 60;
  ub[0] = 60;
  set[1] = 7;
  lb[1] = 6;
  ub[1] = 6;
  set[2] = 8;
  lb[2] = 60;
  ub[2] = 60;
  set[3] = 13;
  lb[3] = 600;
  ub[3] = 1200;
  set[4] = 4;
  lb[4] = 70;
  ub[4] = 70;
  set[5] = 5;
  lb[5] = 16;
  ub[5] = 16;
  set[6] = 2;
  lb[6] = 70;
  ub[6] = 70;
  set[7] = 3;
  lb[7] = 7;
  ub[7] = 7;
  set[8] = 11;
  lb[8] = 200;
  ub[8] = 1400;
  set[9] = 0;
  lb[9] = 75;
  ub[9] = 75;
  set[10] = 1;
  lb[10] = 12;
  ub[10] = 12;
  set[11] = 14;
  lb[11] = 0;
  ub[11] = 1400;
  set[12] = 9;
  lb[12] = 6;
  ub[12] = 6;
  set[13] = 15;
  lb[13] = 600;
  ub[13] = 1200;

  vector<HighsInt> sorted_set = set;
  vector<double> sorted_lb;
  vector<double> sorted_ub;
  sorted_lb.resize(num_values);
  sorted_ub.resize(num_values);

  sortSetData(num_values, sorted_set, lb.data(), ub.data(), NULL,
              sorted_lb.data(), sorted_ub.data(), NULL);

  HighsInt prev_ix = -kHighsIInf;
  for (HighsInt k0 = 0; k0 < num_values; k0++) {
    HighsInt ix = sorted_set[k0];
    REQUIRE(ix >= prev_ix);
    HighsInt k1 = -kHighsIInf;
    for (HighsInt k_1 = 0; k_1 < num_values; k_1++) {
      if (set[k_1] == ix) {
        k1 = k_1;
        break;
      }
    }
    REQUIRE(k1 > -kHighsIInf);
    REQUIRE(sorted_lb[k0] == lb[k1]);
    REQUIRE(sorted_ub[k0] == ub[k1]);
  }

  num_values = 10;
  HighsInt max_num_values_sorted = 5;
  vector<HighsInt> best_indices;
  vector<double> best_double_values;
  indices.assign(1 + num_values, 0);
  double_values.assign(1 + num_values, 0);
  best_indices.assign(1 + max_num_values_sorted, 0);
  best_double_values.assign(1 + max_num_values_sorted, 0);
  HighsInt num_values_sorted;
  getRandomValues(num_values, double_values, indices);
  reportValuesIndices(num_values, double_values, indices);
  doAddSort(num_values_sorted, max_num_values_sorted, best_double_values,
            best_indices, num_values, double_values, indices);
  reportValuesIndices(num_values_sorted, best_double_values, best_indices);
  checkDecreasingSort(num_values_sorted, best_double_values, best_indices,
                      double_values);
}