8 num pbqp_add(num x, num y)
10 if (x == INF_COSTS || y == INF_COSTS) return INF_COSTS;
15 vector *vector_alloc(pbqp *pbqp, unsigned length)
18 vector *vec = obstack_alloc(&pbqp->obstack, sizeof(*vec) + sizeof(*vec->entries) * length);
22 memset(vec->entries, 0, sizeof(*vec->entries) * length);
27 vector *vector_copy(pbqp *pbqp, vector *v)
29 unsigned len = v->len;
30 vector *copy = obstack_copy(&pbqp->obstack, v, sizeof(*copy) + sizeof(*copy->entries) * len);
36 void vector_add(vector *sum, vector *summand)
43 assert(sum->len == summand->len);
47 for (i = 0; i < len; ++i) {
48 sum->entries[i].data = pbqp_add(sum->entries[i].data,
49 summand->entries[i].data);
53 void vector_set(vector *vec, unsigned index, num value)
55 assert(index < vec->len);
56 vec->entries[index].data = value;
60 void vector_set_description(vector *vec, unsigned index, char *name)
62 assert(index < vec->len);
63 vec->entries[index].name = name;
67 void vector_add_value(vector *vec, num value)
76 for (index = 0; index < len; ++index) {
77 vec->entries[index].data = pbqp_add(vec->entries[index].data, value);
81 void vector_add_matrix_col(vector *vec, pbqp_matrix *mat, unsigned col_index)
88 assert(vec->len == mat->rows);
89 assert(col_index < mat->cols);
93 for (index = 0; index < len; ++index) {
94 vec->entries[index].data = pbqp_add(vec->entries[index].data, mat->entries[index * mat->cols + col_index]);
98 void vector_add_matrix_row(vector *vec, pbqp_matrix *mat, unsigned row_index)
105 assert(vec->len == mat->cols);
106 assert(row_index < mat->rows);
110 for (index = 0; index < len; ++index) {
111 vec->entries[index].data = pbqp_add(vec->entries[index].data,
112 mat->entries[row_index * mat->cols + index]);
116 num vector_get_min(vector *vec)
127 for (index = 0; index < len; ++index) {
128 num elem = vec->entries[index].data;
138 unsigned vector_get_min_index(vector *vec)
142 unsigned min_index = 0;
150 for (index = 0; index < len; ++index) {
151 num elem = vec->entries[index].data;