Lines Matching refs:j
48 int i, j; in levenshtein() local
50 for (j = 0; j <= len2; j++) in levenshtein()
51 row1[j] = j * a; in levenshtein()
56 for (j = 0; j < len2; j++) { in levenshtein()
58 row2[j + 1] = row1[j] + s * (string1[i] != string2[j]); in levenshtein()
60 if (i > 0 && j > 0 && string1[i - 1] == string2[j] && in levenshtein()
61 string1[i] == string2[j - 1] && in levenshtein()
62 row2[j + 1] > row0[j - 1] + w) in levenshtein()
63 row2[j + 1] = row0[j - 1] + w; in levenshtein()
65 if (row2[j + 1] > row1[j + 1] + d) in levenshtein()
66 row2[j + 1] = row1[j + 1] + d; in levenshtein()
68 if (row2[j + 1] > row2[j] + a) in levenshtein()
69 row2[j + 1] = row2[j] + a; in levenshtein()