90 |
|
gc[1].i[1] = i / hp->grid[hdwg0[gc[1].w]]; |
91 |
|
gc[1].i[0] = i - gc[1].i[1]*hp->grid[hdwg0[gc[1].w]]; |
92 |
|
if (reverse) { |
93 |
< |
copystruct(g2, gc+1); |
94 |
< |
copystruct(gc+1, gc); |
95 |
< |
copystruct(gc, g2); |
93 |
> |
*g2 = *(gc+1); |
94 |
> |
*(gc+1) = *gc; |
95 |
> |
*gc = *g2; |
96 |
|
} |
97 |
|
return(1); /* we're done */ |
98 |
|
} |
108 |
|
register int i, j; |
109 |
|
/* check ordering and limits */ |
110 |
|
if (reverse = gc[0].w > gc[1].w) { |
111 |
< |
copystruct(g2, gc+1); |
112 |
< |
copystruct(g2+1, gc); |
111 |
> |
*g2 = *(gc+1); |
112 |
> |
*(g2+1) = *gc; |
113 |
|
gc = g2; |
114 |
|
} else if (gc[0].w == gc[1].w) |
115 |
|
return(0); |