Lines Matching full:names
16 ALLOC_GROW(cmds->names, cmds->cnt + 1, cmds->alloc);
17 cmds->names[cmds->cnt++] = ent;
25 free(cmds->names[i]);
26 free(cmds->names);
46 if (strcmp(cmds->names[i]->name, cmds->names[i-1]->name))
47 cmds->names[j++] = cmds->names[i];
59 cmp = strcmp(cmds->names[ci]->name, excludes->names[ei]->name);
61 cmds->names[cj++] = cmds->names[ci++];
69 cmds->names[cj++] = cmds->names[ci++];
100 printf("%-*s", size, cmds->names[n]->name);
166 qsort(main_cmds->names, main_cmds->cnt,
167 sizeof(*main_cmds->names), cmdname_compare);
186 qsort(other_cmds->names, other_cmds->cnt,
187 sizeof(*other_cmds->names), cmdname_compare);
199 if (longest < main_cmds->names[i]->len)
200 longest = main_cmds->names[i]->len;
202 if (longest < other_cmds->names[i]->len)
203 longest = other_cmds->names[i]->len;
230 if (!strcmp(s, c->names[i]->name))
262 ALLOC_GROW(cmds->names, cmds->cnt + old->cnt, cmds->alloc);
265 cmds->names[cmds->cnt++] = old->names[i];
266 free(old->names);
268 old->names = NULL;
286 qsort(main_cmds.names, main_cmds.cnt,
287 sizeof(main_cmds.names), cmdname_compare);
293 main_cmds.names[i]->len =
294 levenshtein(cmd, main_cmds.names[i]->name, 0, 2, 1, 4);
296 qsort(main_cmds.names, main_cmds.cnt,
297 sizeof(*main_cmds.names), levenshtein_compare);
299 best_similarity = main_cmds.names[0]->len;
301 while (n < main_cmds.cnt && best_similarity == main_cmds.names[n]->len)
306 const char *assumed = main_cmds.names[0]->name;
308 main_cmds.names[0] = NULL;
329 fprintf(stderr, "\t%s\n", main_cmds.names[i]->name);
