Lines Matching full:reaching

791 /// Find the end of the furthest reaching d-path on diagonal k, for
810 /// end of the furthest reaching D-path.
830 /// reaching (D-1)-path on diagonal k.
835 /// @return true if the end of the furthest reaching path that was
853   // Let's pick the end point of the furthest reaching  in end_of_fr_d_path_in_k()
859     // reaching (D-1)-path is v[k+1].  That is a diagonal that  in end_of_fr_d_path_in_k()
885   // from the end of the furthest reaching (D-1)-path.  in end_of_fr_d_path_in_k()
929 /// Find the end of the furthest reaching reverse d-path on diagonal k
949 /// end of the furthest reaching reverse D-path.  Actually, we want to
950 /// find the end of the furthest reaching reverse D-path on diagonal (k
971 /// furthest reaching (D-1)-path on diagonal k - delta.
976 /// @return true iff the end of the furthest reaching path that was
998   // Let's pick the end point of the furthest reaching (D-1)-path and  in end_of_frr_d_path_in_k_plus_delta()
1000   // point of the furthest reaching (D-1)-path is either on  in end_of_frr_d_path_in_k_plus_delta()
1109 /// forward and reverse directions until furthest reaching forward and
1158   // furthest reaching point on diagonal k == 0; For that, we need the  in compute_middle_snake()
1161   // That way, to get the furthest reaching point on diagonal 0 (k ==  in compute_middle_snake()
1319 /// reaching d-path and (d-1)-path.
1339     // reaching reverse 0-path (i.e, when we are at d == 0 and k == 0).  in ses_len()
1343     // reaching forward 0-path (i.e, when we are at d == 0 and k == 0).  in ses_len()
1403 /// reaching d-path and (d-1)-path.