| Line 419... |
Line 419... |
| 419 |
CORNER *a = cube->corners[c1];
|
419 |
CORNER *a = cube->corners[c1];
|
| 420 |
CORNER *b = cube->corners[c2];
|
420 |
CORNER *b = cube->corners[c2];
|
| 421 |
CORNER *c = cube->corners[c3];
|
421 |
CORNER *c = cube->corners[c3];
|
| 422 |
CORNER *d = cube->corners[c4];
|
422 |
CORNER *d = cube->corners[c4];
|
| 423 |
int index = 0, apos, bpos, cpos, dpos, e1, e2, e3, e4, e5, e6;
|
423 |
int index = 0, apos, bpos, cpos, dpos, e1, e2, e3, e4, e5, e6;
|
| 424 |
if (apos = (a->value > 0.0)) index += 8;
|
424 |
if ((apos = (a->value > 0.0))) index += 8;
|
| 425 |
if (bpos = (b->value > 0.0)) index += 4;
|
425 |
if ((bpos = (b->value > 0.0))) index += 4;
|
| 426 |
if (cpos = (c->value > 0.0)) index += 2;
|
426 |
if ((cpos = (c->value > 0.0))) index += 2;
|
| 427 |
if (dpos = (d->value > 0.0)) index += 1;
|
427 |
if ((dpos = (d->value > 0.0))) index += 1;
|
| 428 |
/* index is now 4-bit number representing one of the 16 possible cases */
|
428 |
/* index is now 4-bit number representing one of the 16 possible cases */
|
| 429 |
if (apos != bpos) e1 = vertid(a, b);
|
429 |
if (apos != bpos) e1 = vertid(a, b);
|
| 430 |
if (apos != cpos) e2 = vertid(a, c);
|
430 |
if (apos != cpos) e2 = vertid(a, c);
|
| 431 |
if (apos != dpos) e3 = vertid(a, d);
|
431 |
if (apos != dpos) e3 = vertid(a, d);
|
| 432 |
if (bpos != cpos) e4 = vertid(b, c);
|
432 |
if (bpos != cpos) e4 = vertid(b, c);
|