Lines Matching defs:reverse
494 /// For reverse vectors, note that we need to be able to address
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
1109 /// forward and reverse directions until furthest reaching forward and
1110 /// reverse paths starting at opposing corners 'overlap'."
1167 // Similarly for the reverse paths, for diagonal delta + 1 (note
1174 // point value the algorithm expects for k == 0 in the reverse case.
1213 // Now build reverse paths.
1231 // extending reverse paths."
1296 /// paper. It can walk the edit graph either foward (when reverse is
1297 /// false) or backward starting from the end (when reverse is true).
1327 d_path_vec& v, bool reverse)
1337 if (reverse)
1339 // reaching reverse 0-path (i.e, when we are at d == 0 and k == 0).
1351 if (reverse)
1384 /// paper. It can walk the edit graph either foward (when reverse is
1385 /// false) or backward starting from the end (when reverse is true).
1410 d_path_vec& v, bool reverse)
1414 v, reverse);
1420 bool reverse = false);