# HG changeset patch # User Richard M. Stallman # Date 1008715759 0 # Node ID e08cd63afb2e5513d02804598b6ca2bf219583bd # Parent 7d43b2a3529d2bd23a122992fc5b976f39dec470 (scmp): Function moved to dired.c. diff -r 7d43b2a3529d -r e08cd63afb2e src/minibuf.c --- a/src/minibuf.c Tue Dec 18 22:29:35 2001 +0000 +++ b/src/minibuf.c Tue Dec 18 22:49:19 2001 +0000 @@ -1289,42 +1289,6 @@ XSETFASTINT (end, bestmatchsize); /* all completions agree */ return Fsubstring (bestmatch, zero, end); } - -/* Compare exactly LEN chars of strings at S1 and S2, - ignoring case if appropriate. - Return -1 if strings match, - else number of chars that match at the beginning. */ - -int -scmp (s1, s2, len) - register unsigned char *s1, *s2; - int len; -{ - register int l = len; - - if (completion_ignore_case) - { - while (l && DOWNCASE (*s1++) == DOWNCASE (*s2++)) - l--; - } - else - { - while (l && *s1++ == *s2++) - l--; - } - if (l == 0) - return -1; - else - { - int match = len - l; - - /* Now *--S1 is the unmatching byte. If it is in the middle of - multi-byte form, we must say that the multi-byte character - there doesn't match. */ - while (match && *--s1 >= 0xA0) match--; - return match; - } -} DEFUN ("all-completions", Fall_completions, Sall_completions, 2, 4, 0, doc: /* Search for partial matches to STRING in ALIST.