102103104105106107108109110111112
mSearchLoop.setLastDecision(dec); dec.buildNext(); // then simulate down_branch mSearchLoop.getSMList().beforeDownLeftBranch(); environment.worldPush(); dec.apply(); mSearchLoop.getSMList().afterDownLeftBranch(); previous = dec; }
7273747576777879808182
} AbstractStrategy asg = IntStrategyFactory.lexico_LB(variables); s.set(asg); env.worldPush(); Decision decision = asg.getDecision(); for (int i = 0; i < n; i++) { decision.buildNext(); try { decision.apply();
90919293949596979899100
if (decision != null) { decision.setPrevious(tmp); } else { decision = tmp; } env.worldPush(); } env.worldPop(); for (int i = n - 1; i >= 0; i--) { env.worldPop(); decision.buildNext();
126127128129130131132133134135136
AbstractStrategy sts = ISF.sequencer(asgs); s.set(sts); env.worldPush(); Decision decision = sts.getDecision(); for (int i = 0; i < n; i++) { decision.buildNext(); try { decision.apply();
144145146147148149150151152153154