475{
476
477
478 int i, j, a = 0, b;
479 int nvars = w->len;
480 for (i = 0; i < nvars; i++)
481 {
482 a = e[i] - f[i];
483 if (a) break;
484 if (w->array[i] != 0) return false;
485 }
486
487 for (j = i + 1; j < nvars; j++)
488 {
489 b = e[j] - f[j];
490 if (a * w->array[j] != b * w->array[i]) return false;
491 }
492 return true;
493}