J
int *J; /* will be overlaid on class */
J = (int *)talloc((len[0] + 2) * sizeof (int));
J[i] = i <= pref ? i :
J[q->x + pref] = q->y + pref;
if (J[i] == 0) {
while (j < J[i]) {
J[i] = 0;
J[i] = 0;
J[i] = 0;
J[0] = 0;
J[m + 1] = len[1] + 1;
while (i0 <= m && J[i0] == J[i0 - 1] + 1)
j0 = J[i0 - 1] + 1;
while (i1 < m && J[i1 + 1] == 0)
j1 = J[i1 + 1] - 1;
J[i1] = j1;
while (i0 >= 1 && J[i0] == J[i0 + 1] - 1 && J[i0] != 0)
j0 = J[i0 + 1] - 1;
while (i1 > 1 && J[i1 - 1] == 0)
j1 = J[i1 - 1] + 1;
J[i1] = j1;
J()
J(x)