Lines Matching refs:j
74 for (size_t j = 0; j < b_lines.size() + 1; ++j) { in PrintDiff() local
75 if (i == 0 || j == 0) { in PrintDiff()
82 if (j) { in PrintDiff()
86 table[i][j].longest_common_subsequence_length = 0; in PrintDiff()
87 table[i][j].propagation_directions = directions; in PrintDiff()
88 } else if (a_lines[i-1] == b_lines[j-1]) { in PrintDiff()
89 table[i][j].longest_common_subsequence_length = in PrintDiff()
90 table[i-1][j-1].longest_common_subsequence_length + 1; in PrintDiff()
91 table[i][j].propagation_directions = UP_LEFT; in PrintDiff()
93 size_t length_up = table[i-1][j].longest_common_subsequence_length; in PrintDiff()
94 size_t length_left = table[i][j-1].longest_common_subsequence_length; in PrintDiff()
108 table[i][j].longest_common_subsequence_length = length; in PrintDiff()
109 table[i][j].propagation_directions = directions; in PrintDiff()
115 size_t j = b_lines.size(); in PrintDiff() local
118 while (table[i][j].propagation_directions) { in PrintDiff()
119 if (table[i][j].propagation_directions & UP_LEFT) { in PrintDiff()
122 j--; in PrintDiff()
123 } else if (table[i][j].propagation_directions & UP) { in PrintDiff()
127 output.push_back("+" + b_lines[j-1]); in PrintDiff()
128 j--; in PrintDiff()