Lines Matching defs:distances
336 let mut distances = vec![0; (a_len + 2) * (b_len + 2)];
338 distances[0] = max_distance;
341 distances[flat_index(i + 1, 0, width)] = max_distance;
342 distances[flat_index(i + 1, 1, width)] = i;
346 distances[flat_index(0, j + 1, width)] = max_distance;
347 distances[flat_index(1, j + 1, width)] = j;
361 let insertion_cost = distances[flat_index(i, j + 1, width)] + 1;
362 let deletion_cost = distances[flat_index(i + 1, j, width)] + 1;
363 let transposition_cost = distances[flat_index(k, db, width)] +
366 let mut substitution_cost = distances[flat_index(i, j, width)] + 1;
372 distances[flat_index(i + 1, j + 1, width)] = min(substitution_cost,
379 distances[flat_index(a_len + 1, b_len + 1, width)]