Lines Matching refs:names
15 ALLOC_GROW(cmds->names, cmds->cnt + 1, cmds->alloc);
16 cmds->names[cmds->cnt++] = ent;
24 free(cmds->names[i]);
25 free(cmds->names);
45 if (strcmp(cmds->names[i]->name, cmds->names[i-1]->name))
46 cmds->names[j++] = cmds->names[i];
58 cmp = strcmp(cmds->names[ci]->name, excludes->names[ei]->name);
60 cmds->names[cj++] = cmds->names[ci++];
68 cmds->names[cj++] = cmds->names[ci++];
99 printf("%-*s", size, cmds->names[n]->name);
165 qsort(main_cmds->names, main_cmds->cnt,
166 sizeof(*main_cmds->names), cmdname_compare);
185 qsort(other_cmds->names, other_cmds->cnt,
186 sizeof(*other_cmds->names), cmdname_compare);
198 if (longest < main_cmds->names[i]->len)
199 longest = main_cmds->names[i]->len;
201 if (longest < other_cmds->names[i]->len)
202 longest = other_cmds->names[i]->len;
229 if (!strcmp(s, c->names[i]->name))
261 ALLOC_GROW(cmds->names, cmds->cnt + old->cnt, cmds->alloc);
264 cmds->names[cmds->cnt++] = old->names[i];
265 free(old->names);
267 old->names = NULL;
285 qsort(main_cmds.names, main_cmds.cnt,
286 sizeof(main_cmds.names), cmdname_compare);
292 main_cmds.names[i]->len =
293 levenshtein(cmd, main_cmds.names[i]->name, 0, 2, 1, 4);
295 qsort(main_cmds.names, main_cmds.cnt,
296 sizeof(*main_cmds.names), levenshtein_compare);
298 best_similarity = main_cmds.names[0]->len;
300 while (n < main_cmds.cnt && best_similarity == main_cmds.names[n]->len)
305 const char *assumed = main_cmds.names[0]->name;
307 main_cmds.names[0] = NULL;
328 fprintf(stderr, "\t%s\n", main_cmds.names[i]->name);