Lines Matching refs:b_len
70 let b_len = b.into_iter().count();
74 if a_len == 0 && b_len == 0 {
76 } else if a_len == 0 || b_len == 0 {
78 } else if a_len == 1 && b_len == 1 {
82 let search_range = (max(a_len, b_len) / 2) - 1;
84 let mut b_consumed = Vec::with_capacity(b_len);
85 for _ in 0..b_len {
102 let max_bound = min(b_len - 1, i + search_range);
128 (matches / b_len as f64) +
204 let b_len = b.into_iter().count();
206 if a.into_iter().next().is_none() { return b_len; }
208 let mut cache: Vec<usize> = (1..b_len+1).collect();
269 let b_len = b.chars().count();
271 else if a_len == 0 { return b_len; }
272 else if b_len == 0 { return a_len; }
274 let mut prev_two_distances: Vec<usize> = Vec::with_capacity(b_len + 1);
275 let mut prev_distances: Vec<usize> = Vec::with_capacity(b_len + 1);
276 let mut curr_distances: Vec<usize> = Vec::with_capacity(b_len + 1);
281 for i in 0..(b_len + 1) {
309 curr_distances[b_len]
330 let b_len = b_elems.len();
332 if a_len == 0 { return b_len; }
333 if b_len == 0 { return a_len; }
336 let mut distances = vec![0; (a_len + 2) * (b_len + 2)];
337 let max_distance = a_len + b_len;
345 for j in 0..(b_len + 1) {
355 for j in 1..(b_len + 1) {
379 distances[flat_index(a_len + 1, b_len + 1, width)]