Lines Matching refs:b_index
88 for (size_t b_index = 0; b_index < b_size; b_index++) {
89 char code = b[b_index];
90 // cost(b[:b_index], a[:0]) == b_index * MOVE_COST
91 size_t distance = result = b_index * MOVE_COST;
95 // cost(b[:b_index+1], a[:index+1]) = min(
97 // cost(b[:b_index], a[:index])
98 // + substitution_cost(b[b_index], a[index]),
100 // cost(b[:b_index], a[:index+1]) + MOVE_COST,
102 // cost(b[:b_index+1], a[index]) + MOVE_COST
105 // 1) Previous distance in this row is cost(b[:b_index], a[:index])
107 // 2) cost(b[:b_index], a[:index+1]) from previous row
109 // 3) existing result is cost(b[:b_index+1], a[index])
114 // cost(b[:b_index+1], a[:index+1])