38 |
|
gcl->erg2 *= (1./3.) * myeye.rng*myeye.rng; |
39 |
|
} |
40 |
|
if (gc != NULL) |
41 |
< |
copystruct(&gcl->gc, gc); |
41 |
> |
gcl->gc = *gc; |
42 |
|
gcl->gmin[0] = gcl->gmin[1] = FHUGE; |
43 |
|
gcl->gmax[0] = gcl->gmax[1] = -FHUGE; |
44 |
|
} |
106 |
|
d*(c*d-b*e) + f*b*b); |
107 |
|
while (n-- > 0) { |
108 |
|
if (gc->w>>1 == gi[i] && |
109 |
< |
(gc->w&1) ^ root[n] < gp[gc->w>>1]) { |
109 |
> |
(gc->w&1) ^ (root[n] < gp[gc->w>>1])) { |
110 |
|
if (gc->w&1) |
111 |
|
gcl->gmin[i] = -FHUGE; |
112 |
|
else |
132 |
|
n = quadratic(root, a, b*yex+d, yex*(yex*c+e)+f); |
133 |
|
while (n-- > 0) { |
134 |
|
if (gc->w>>1 == gi[i] && |
135 |
< |
(gc->w&1) ^ root[n] < gp[gc->w>>1]) |
135 |
> |
(gc->w&1) ^ (root[n] < gp[gc->w>>1])) |
136 |
|
continue; |
137 |
|
if (root[n] < gcl->gmin[i]) |
138 |
|
gcl->gmin[i] = root[n]; |
277 |
|
int status; |
278 |
|
/* already closed? */ |
279 |
|
if (!nprocs) |
280 |
< |
return; |
280 |
> |
return(0); |
281 |
|
/* flush beam queue */ |
282 |
|
done_packets(flush_queue()); |
283 |
|
/* sync holodeck */ |