#include "latin.h"
+static void assert_f(p)
+{
+ assert(p);
+}
+
/* --------------------------------------------------------
* Solver.
*/
int i, o = solver->o;
assert(n <= o);
- assert(cube(x,y,n));
+ assert_f(cube(x,y,n));
/*
* Rule out all other numbers in this square.
for (j = 0; j < o; j++)
col[j] = num[j] = j;
shuffle(col, j, sizeof(*col), rs);
+ shuffle(num, j, sizeof(*num), rs);
/* We need the num permutation in both forward and inverse forms. */
for (j = 0; j < o; j++)
numinv[num[j]] = j;
lcp = snew(lcparams);
lcp->elt = ELT(sq, c, r);
lcp->count = 1;
- assert(add234(dict, lcp) == lcp);
+ assert_f(add234(dict, lcp) == lcp);
} else {
lcp->count++;
}