Lines Matching defs:v_next
66 and a new row, v_next, which avoids an (len_t + 1) * (len_s + 1)
73 edit_distance_t *v_next = new edit_distance_t[len_s + 1];
94 v_next[0] = (i + 1) * BASE_COST;
108 edit_distance_t deletion = v_next[j] + BASE_COST;
118 v_next[j + 1] = cheapest;
125 v_one_ago[j] = v_next[j];
131 printf ("final v_next = ");
133 printf ("%i ", v_next[j]);
137 edit_distance_t result = v_next[len_s];
140 delete[] v_next;