Lines Matching refs:j
89 for (int j = 0; j < diffTable[i].length; j++) { in printDiffTable()
90 tmpString = tmpString + " " + diffTable[i][j] + " "; in printDiffTable()
122 int i, j; in createDiffTable() local
130 for (modSeqObject = modSeq.start(), j = 1; in createDiffTable()
132 modSeqObject = modSeq.next(), j++) { in createDiffTable()
135 diffTable[i][j] = diffTable[i-1][j-1]+1; in createDiffTable()
137 if (diffTable[i-1][j] >= diffTable[i][j-1]) { in createDiffTable()
138 diffTable[i][j] = diffTable[i-1][j]; in createDiffTable()
140 diffTable[i][j] = diffTable[i][j-1]; in createDiffTable()
169 int i, int j, Vector diffVector) { in generateResult() argument
172 if (i == 0 && j == 0) { in generateResult()
175 } else if (j == 0) { in generateResult()
178 new Difference(Difference.DELETE, cnt, j); in generateResult()
184 for (int cnt = 0; cnt < j; cnt++) { in generateResult()
194 if ((diffTable[i-1][j-1] == diffTable[i][j] -1) && in generateResult()
195 (diffTable[i-1][j-1] == diffTable[i-1][j]) && in generateResult()
196 (diffTable[i-1][j-1] == diffTable[i][j-1])) { in generateResult()
199 generateResult(diffTable, i-1, j-1, diffVector); in generateResult()
201 if (diffTable[i-1][j] > diffTable[i][j-1]) { in generateResult()
205 generateResult(diffTable, i-1, j, diffVector); in generateResult()
208 new Difference(Difference.DELETE, i-1, j); in generateResult()
210 } else if (diffTable[i-1][j] < diffTable[i][j-1]) { in generateResult()
214 generateResult(diffTable, i, j-1, diffVector); in generateResult()
217 new Difference(Difference.ADD, i, j-1); in generateResult()
222 generateResult(diffTable, i-1, j-1, diffVector); in generateResult()
225 new Difference(Difference.CHANGE, i-1, j-1); in generateResult()