Lines Matching defs:a_size
39 levenshtein_distance(const char *a, size_t a_size,
51 while (a_size && b_size && a[0] == b[0]) {
52 a++; a_size--;
55 while (a_size && b_size && a[a_size-1] == b[b_size-1]) {
56 a_size--;
59 if (a_size == 0 || b_size == 0) {
60 return (a_size + b_size) * MOVE_COST;
62 if (a_size > MAX_STRING_SIZE || b_size > MAX_STRING_SIZE) {
67 if (b_size < a_size) {
69 size_t t_size = a_size; a_size = b_size; b_size = t_size;
73 if ((b_size - a_size) * MOVE_COST > max_cost) {
81 for (size_t i = 0; i < a_size; i++) {
93 for (size_t index = 0; index < a_size; index++) {