* @brief PBQP vector.
* @date 02.10.2008
* @author Sebastian Buchwald
- * @version $Id$
*/
#include "config.h"
num pbqp_add(num x, num y)
{
+ num res;
+
if (x == INF_COSTS || y == INF_COSTS) return INF_COSTS;
- num res = x + y;
+ res = x + y;
#if !KAPS_USE_UNSIGNED
/* No positive overflow. */
vector_t *vector_alloc(pbqp_t *pbqp, unsigned length)
{
- assert(length > 0);
vector_t *vec = (vector_t*)obstack_alloc(&pbqp->obstack, sizeof(*vec) + sizeof(*vec->entries) * length);
- assert(vec);
+ assert(length > 0);
vec->len = length;
memset(vec->entries, 0, sizeof(*vec->entries) * length);
int i;
int len;
- assert(sum);
- assert(summand);
assert(sum->len == summand->len);
len = sum->len;
unsigned index;
unsigned len;
- assert(vec);
-
len = vec->len;
for (index = 0; index < len; ++index) {
unsigned index;
unsigned len;
- assert(vec);
- assert(mat);
assert(vec->len == mat->rows);
assert(col_index < mat->cols);
unsigned index;
unsigned len;
- assert(vec);
- assert(mat);
assert(vec->len == mat->cols);
assert(row_index < mat->rows);
unsigned len;
num min = INF_COSTS;
- assert(vec);
-
len = vec->len;
assert(len > 0);
unsigned min_index = 0;
num min = INF_COSTS;
- assert(vec);
-
len = vec->len;
assert(len > 0);