7 num pbqp_add(num x, num y)
9 if (x == INF_COSTS || y == INF_COSTS) return INF_COSTS;
13 /* No positive overflow. */
14 assert(x < 0 || y < 0 || res >= x);
15 assert(x < 0 || y < 0 || res >= y);
17 /* No negative overflow. */
18 assert(x > 0 || y > 0 || res <= x);
19 assert(x > 0 || y > 0 || res <= y);
21 /* Result is not infinity.*/
22 assert(res < INF_COSTS);
27 vector *vector_alloc(pbqp *pbqp, unsigned length)
30 vector *vec = obstack_alloc(&pbqp->obstack, sizeof(*vec) + sizeof(*vec->entries) * length);
34 memset(vec->entries, 0, sizeof(*vec->entries) * length);
39 vector *vector_copy(pbqp *pbqp, vector *v)
41 unsigned len = v->len;
42 vector *copy = obstack_copy(&pbqp->obstack, v, sizeof(*copy) + sizeof(*copy->entries) * len);
48 void vector_add(vector *sum, vector *summand)
55 assert(sum->len == summand->len);
59 for (i = 0; i < len; ++i) {
60 sum->entries[i].data = pbqp_add(sum->entries[i].data,
61 summand->entries[i].data);
65 void vector_set(vector *vec, unsigned index, num value)
67 assert(index < vec->len);
68 vec->entries[index].data = value;
71 #if KAPS_ENABLE_VECTOR_NAMES
72 void vector_set_description(vector *vec, unsigned index, const char *name)
74 assert(index < vec->len);
75 vec->entries[index].name = name;
79 void vector_add_value(vector *vec, num value)
88 for (index = 0; index < len; ++index) {
89 vec->entries[index].data = pbqp_add(vec->entries[index].data, value);
93 void vector_add_matrix_col(vector *vec, pbqp_matrix *mat, unsigned col_index)
100 assert(vec->len == mat->rows);
101 assert(col_index < mat->cols);
105 for (index = 0; index < len; ++index) {
106 vec->entries[index].data = pbqp_add(vec->entries[index].data, mat->entries[index * mat->cols + col_index]);
110 void vector_add_matrix_row(vector *vec, pbqp_matrix *mat, unsigned row_index)
117 assert(vec->len == mat->cols);
118 assert(row_index < mat->rows);
122 for (index = 0; index < len; ++index) {
123 vec->entries[index].data = pbqp_add(vec->entries[index].data,
124 mat->entries[row_index * mat->cols + index]);
128 num vector_get_min(vector *vec)
139 for (index = 0; index < len; ++index) {
140 num elem = vec->entries[index].data;
150 unsigned vector_get_min_index(vector *vec)
154 unsigned min_index = 0;
162 for (index = 0; index < len; ++index) {
163 num elem = vec->entries[index].data;