8 num pbqp_add(num x, num y)
10 if (x == INF_COSTS || y == INF_COSTS) return INF_COSTS;
14 /* No positive overflow. */
15 assert(x < 0 || y < 0 || res >= x);
16 assert(x < 0 || y < 0 || res >= y);
18 /* No negative overflow. */
19 assert(x > 0 || y > 0 || res <= x);
20 assert(x > 0 || y > 0 || res <= y);
22 /* Result is not infinity.*/
23 assert(res < INF_COSTS);
28 vector *vector_alloc(pbqp *pbqp, unsigned length)
31 vector *vec = obstack_alloc(&pbqp->obstack, sizeof(*vec) + sizeof(*vec->entries) * length);
35 memset(vec->entries, 0, sizeof(*vec->entries) * length);
40 vector *vector_copy(pbqp *pbqp, vector *v)
42 unsigned len = v->len;
43 vector *copy = obstack_copy(&pbqp->obstack, v, sizeof(*copy) + sizeof(*copy->entries) * len);
49 void vector_add(vector *sum, vector *summand)
56 assert(sum->len == summand->len);
60 for (i = 0; i < len; ++i) {
61 sum->entries[i].data = pbqp_add(sum->entries[i].data,
62 summand->entries[i].data);
66 void vector_set(vector *vec, unsigned index, num value)
68 assert(index < vec->len);
69 vec->entries[index].data = value;
73 void vector_set_description(vector *vec, unsigned index, char *name)
75 assert(index < vec->len);
76 vec->entries[index].name = name;
80 void vector_add_value(vector *vec, num value)
89 for (index = 0; index < len; ++index) {
90 vec->entries[index].data = pbqp_add(vec->entries[index].data, value);
94 void vector_add_matrix_col(vector *vec, pbqp_matrix *mat, unsigned col_index)
101 assert(vec->len == mat->rows);
102 assert(col_index < mat->cols);
106 for (index = 0; index < len; ++index) {
107 vec->entries[index].data = pbqp_add(vec->entries[index].data, mat->entries[index * mat->cols + col_index]);
111 void vector_add_matrix_row(vector *vec, pbqp_matrix *mat, unsigned row_index)
118 assert(vec->len == mat->cols);
119 assert(row_index < mat->rows);
123 for (index = 0; index < len; ++index) {
124 vec->entries[index].data = pbqp_add(vec->entries[index].data,
125 mat->entries[row_index * mat->cols + index]);
129 num vector_get_min(vector *vec)
140 for (index = 0; index < len; ++index) {
141 num elem = vec->entries[index].data;
151 unsigned vector_get_min_index(vector *vec)
155 unsigned min_index = 0;
163 for (index = 0; index < len; ++index) {
164 num elem = vec->entries[index].data;