Lines Matching refs:k_plus_delta
992 int k_plus_delta = k + delta;
999 // move from there to reach the current k_plus_delta-line. That end
1001 // v[k_plus_delta-1] or on v[k_plus_delta+1]; the word "furthest"
1004 if (k_plus_delta == -d + delta
1005 || ((k_plus_delta != d + delta)
1006 && (v[k_plus_delta + 1] <= v[k_plus_delta - 1])))
1009 x = v[k_plus_delta + 1];
1010 y = x - (k_plus_delta + 1);
1017 // So the furthest end point is on the k_plus_delta - 1
1019 // k_plus_delta current diagonal. So to join the current
1020 // diagonal from the k_plus_delta - 1 one, we need to move up.
1023 x = v[k_plus_delta - 1];
1024 begin.set(x, x - (k_plus_delta - 1));
1026 y = x - (k_plus_delta - 1) - 1;
1031 // Now, follow the snake. Note that we stay on the k_plus_delta
1051 v[k_plus_delta] = x;
1232 int k_plus_delta = k + delta;
1234 && (k_plus_delta >= -d) && (k_plus_delta <= d))
1237 forward_end.x(forward_d_paths[k_plus_delta]);
1238 forward_end.y(forward_end.x() - k_plus_delta);