Searched refs:TWO_RIGHT (Results 1 – 9 of 9) sorted by relevance
54 way = (y0 > *brpts) ? TWO_RIGHT : TWO_LEFT; in selectBranch()85 way = (y0 > 0.) ? TWO_LEFT : TWO_RIGHT; in selectBranch()124 way = (w0 < wreal) ? TWO_LEFT : TWO_RIGHT; in selectBranch()138 way = (wl < - COUENNE_INFINITY) ? TWO_RIGHT : TWO_LEFT; in selectBranch()
93 way = (info -> solution_ [var -> Index ()] > *brpts) ? TWO_RIGHT : TWO_LEFT; in selectBranch()105 …ind = xi; *brpts = obj -> midInterval (((x0 < 0.) ? 2 : 0.5) * x0, xl, xu, info); way = TWO_RIGHT;} in selectBranch()111 …ind = yi; *brpts = obj -> midInterval (((y0 < 0.) ? 2 : 0.5) * y0, yl, yu, info); way = TWO_RIGHT;} in selectBranch()158 way = (pt > *brpts) ? TWO_RIGHT : TWO_LEFT; in selectBranch()
104 way = (x0 > 0) ? TWO_RIGHT : TWO_LEFT; // priority to same side as x0 in selectBranch()164 way = TWO_RIGHT; in selectBranch()197 way = (x0 < *brpts) ? TWO_LEFT : TWO_RIGHT; in selectBranch()235 way = (x0 > 0.) ? TWO_RIGHT : TWO_LEFT; in selectBranch()295 way = (x0 > 0.) ? TWO_RIGHT : TWO_LEFT; in selectBranch()
115 way = (u < -0.) ? TWO_RIGHT : TWO_LEFT; // explore finite interval first in negPowSelectBranch()167 way = (x0 > *brpts) ? TWO_RIGHT : TWO_LEFT; in negPowSelectBranch()178 way = TWO_RIGHT; in negPowSelectBranch()
112 way = TWO_RIGHT; in selectBranch()
124 way = TWO_RIGHT; in selectBranch()
40 enum {TWO_LEFT, TWO_RIGHT, TWO_RAND, enumerator
223 whichWay = (point < 0.45) ? TWO_LEFT : (point > 0.55) ? TWO_RIGHT : TWO_RAND; in computeBranchingPoint()
206 whichWay = (point < 0.45) ? TWO_LEFT : (point > 0.55) ? TWO_RIGHT : TWO_RAND; in createBranch()