Lines Matching refs:decision

282 The idea is as follows. The binary search algorithm has two main decision
283 points: the decision to follow the right branch; and, the decision to follow
284 the left branch. We will set a breakpoint at each of these decision points, and
287 function. Each time one of these decision breakpoints is hit, the script will
288 compare the actual decision with the decision the front of the path variable
289 says should be made (the first character of the path). If the actual decision
292 being hit. But if the decision differs from what the path says it should be,
294 user sitting at the first point where a wrong decision is being made.
324 decision to go right:
357 our decision (recall that we are at the breakpoint for the decision to go
358 right). If the path agrees with our decision, then we strip the first character
361 Since the decision matched the path, we want to resume execution. To do this we
367 If the decision to go right does not agree with the path, then we do not resume
377 containing our two decision points. Looking at the code below, we see that we
465 going right would be the correct decision. Let's ask Python what it thinks the