8 num pbqp_add(num x, num y)
10 if (x == INF_COSTS || y == INF_COSTS) return INF_COSTS;
16 assert(res < INF_COSTS);
21 vector *vector_alloc(pbqp *pbqp, unsigned length)
24 vector *vec = obstack_alloc(&pbqp->obstack, sizeof(*vec) + sizeof(*vec->entries) * length);
28 memset(vec->entries, 0, sizeof(*vec->entries) * length);
33 vector *vector_copy(pbqp *pbqp, vector *v)
35 unsigned len = v->len;
36 vector *copy = obstack_copy(&pbqp->obstack, v, sizeof(*copy) + sizeof(*copy->entries) * len);
42 void vector_add(vector *sum, vector *summand)
49 assert(sum->len == summand->len);
53 for (i = 0; i < len; ++i) {
54 sum->entries[i].data = pbqp_add(sum->entries[i].data,
55 summand->entries[i].data);
59 void vector_set(vector *vec, unsigned index, num value)
61 assert(index < vec->len);
62 vec->entries[index].data = value;
66 void vector_set_description(vector *vec, unsigned index, char *name)
68 assert(index < vec->len);
69 vec->entries[index].name = name;
73 void vector_add_value(vector *vec, num value)
82 for (index = 0; index < len; ++index) {
83 vec->entries[index].data = pbqp_add(vec->entries[index].data, value);
87 void vector_add_matrix_col(vector *vec, pbqp_matrix *mat, unsigned col_index)
94 assert(vec->len == mat->rows);
95 assert(col_index < mat->cols);
99 for (index = 0; index < len; ++index) {
100 vec->entries[index].data = pbqp_add(vec->entries[index].data, mat->entries[index * mat->cols + col_index]);
104 void vector_add_matrix_row(vector *vec, pbqp_matrix *mat, unsigned row_index)
111 assert(vec->len == mat->cols);
112 assert(row_index < mat->rows);
116 for (index = 0; index < len; ++index) {
117 vec->entries[index].data = pbqp_add(vec->entries[index].data,
118 mat->entries[row_index * mat->cols + index]);
122 num vector_get_min(vector *vec)
133 for (index = 0; index < len; ++index) {
134 num elem = vec->entries[index].data;
144 unsigned vector_get_min_index(vector *vec)
148 unsigned min_index = 0;
156 for (index = 0; index < len; ++index) {
157 num elem = vec->entries[index].data;