# | Line 106 | Line 106 | int tight; | |
---|---|---|
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 | |
# | Line 132 | Line 132 | int tight; | |
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]; |
– | Removed lines |
+ | Added lines |
< | Changed lines |
> | Changed lines |