Lines Matching full:backward

86  * linear space: walk forward and backward, find a meeting point in the middle,
94  * c: relative index in the state array for the backward scan, indicating the
117  *      |  forward->                 <-backward
122  * Only one forward column and one backward column are kept in mem, each need at
136  * traversal) where a forward position is on or past a backward traced position
149  *     3   o-o-o-o-*-o   *: forward and backward meet here
159  *     1   o-b    b: backward d=1 first reaches here (sliding up the snake)
167  *     4             o   *: forward and backward meet here
386 		/* If both sides have the same length, forward and backward  in diff_divide_myers_forward()
403 			 * passed (forward walked onto or past backward), then  in diff_divide_myers_forward()
410 			 * forward/backward traversal only.  in diff_divide_myers_forward()
435 			 * downwards to A.  The backward traversal already  in diff_divide_myers_forward()
442 			 * backward traversal has already passed, and A is what  in diff_divide_myers_forward()
673 		 * So in the backward path, we can only match up diagonals when  in diff_divide_myers_backward()
690 		 * backward value is also on a valid diagonal in kd_forward[],  in diff_divide_myers_backward()
695 			 * passed (backward walked onto or past forward), then  in diff_divide_myers_backward()
702 			 * forward/backward traversal only.  in diff_divide_myers_backward()
724 			 * The backward traversal reached M from the bottom and  in diff_divide_myers_backward()
731 			 * the backward traversal hit the diagonal that the  in diff_divide_myers_backward()
807 	 * for the backward traversal. */  in diff_algo_myers_divide()
911 			 * advanced the most, and the backward path advanced the  in diff_algo_myers_divide()
1094 	 * for the backward traversal. */  in diff_algo_myers()