Lines Matching refs:matches
295 size_t matches;
297 matches = 0;
299 while ((retstr = (*genfunc) (text, (int)matches)) != NULL) {
301 if (matches + 3 >= match_list_len) {
303 while (matches + 3 >= match_list_len)
314 match_list[++matches] = retstr;
324 for (; which <= matches; which++) {
341 match_list[matches + 1] = (char *) NULL;
360 * 'matches' is list of strings, 'num' is number of strings in 'matches',
361 * 'width' is maximum length of string in 'matches'.
363 * matches[0] is not one of the match strings, but it is counted in
364 * num, so the strings are matches[1] *through* matches[num-1].
367 fn_display_match_list (EditLine *el, char **matches, size_t num, size_t width)
372 /* Ignore matches[0]. Avoid 1-based array logic below. */
373 matches++;
388 qsort(matches, num, sizeof(char *), _fn_qsort_string_compare);
399 col == 0 ? "" : " ", (int)width, matches[thisguy]);
427 char **matches;
471 matches = (*attempted_completion_function) (ct_encode_string(temp, &el->el_scratch),
474 matches = 0;
476 (over != NULL && !*over && !matches))
477 matches = completion_matches(ct_encode_string(temp, &el->el_scratch), complet_func);
482 if (matches) {
489 * possible matches if there is possible completion.
491 if (matches[0][0] != '\0') {
494 ct_decode_string(matches[0], &el->el_scratch));
500 if (matches[2] == NULL && strcmp(matches[0], matches[1]) == 0) {
507 ct_decode_string((*app_func)(matches[0]),
513 * matches.
516 for(i = 1, maxlen = 0; matches[i]; i++) {
517 match_len = strlen(matches[i]);
521 /* matches[1] through matches[i-1] are available */
544 * strings be matches[1..num-1] for compat.
546 * the prefix in matches[0], so we need to
549 fn_display_match_list(el, matches,
553 } else if (matches[0][0]) {
568 for (i = 0; matches[i]; i++)
569 free(matches[i]);
570 free(matches);
571 matches = NULL;