Doc fix.
This commit is contained in:
parent
ae251d0a58
commit
05c8377e35
2 changed files with 7 additions and 7 deletions
|
@ -196,8 +196,8 @@ show_opts(int val)
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* OBSOLETE: Ships used to be printed differently depending on
|
* OBSOLETE: Ships used to be printed differently depending on
|
||||||
* option SHIPNAMES. Clients had to know whether SHIPNAMES was
|
* option SHIPNAMES. Clients had to know whether SHIPNAMES was on
|
||||||
* one to parse this. To ease the transition, pretend the option
|
* to parse this. To ease the transition, pretend the option
|
||||||
* still exists.
|
* still exists.
|
||||||
*/
|
*/
|
||||||
if (val) {
|
if (val) {
|
||||||
|
|
|
@ -39,8 +39,8 @@
|
||||||
* Return M_NOTFOUND if there are no matches, M_NOTUNIQUE if there are
|
* Return M_NOTFOUND if there are no matches, M_NOTUNIQUE if there are
|
||||||
* several.
|
* several.
|
||||||
* Each array element has a pointer to its name stored at offset OFFS.
|
* Each array element has a pointer to its name stored at offset OFFS.
|
||||||
* Search stops when this name is a null pointer or empty. NEEDLE is
|
* Search stops when this name is a null pointer or empty.
|
||||||
* compared to element names with mineq(NEEDLE, NAME).
|
* NEEDLE is compared to element names with mineq(NEEDLE, NAME).
|
||||||
* ELT_SIZE gives the size of an array element.
|
* ELT_SIZE gives the size of an array element.
|
||||||
*/
|
*/
|
||||||
int
|
int
|
||||||
|
@ -50,7 +50,7 @@ stmtch(char *needle, void *haystack, ptrdiff_t offs, size_t elt_size)
|
||||||
int i, res;
|
int i, res;
|
||||||
|
|
||||||
res = M_NOTFOUND;
|
res = M_NOTFOUND;
|
||||||
for (i = 0; ELT_NAME(i) && ELT_NAME(i)[0] != 0; ++i) {
|
for (i = 0; ELT_NAME(i) && ELT_NAME(i)[0] != 0; i++) {
|
||||||
switch (mineq(needle, ELT_NAME(i))) {
|
switch (mineq(needle, ELT_NAME(i))) {
|
||||||
case ME_MISMATCH:
|
case ME_MISMATCH:
|
||||||
break;
|
break;
|
||||||
|
@ -72,7 +72,7 @@ stmtch(char *needle, void *haystack, ptrdiff_t offs, size_t elt_size)
|
||||||
* Return ME_EXACT if they are the same, or A is a prefix of B
|
* Return ME_EXACT if they are the same, or A is a prefix of B
|
||||||
* followed by a space in B.
|
* followed by a space in B.
|
||||||
* Return ME_PARTIAL if A is a prefix of B not followed by a space.
|
* Return ME_PARTIAL if A is a prefix of B not followed by a space.
|
||||||
* Else return ME_NOMATCH.
|
* Else return ME_MISMATCH.
|
||||||
*/
|
*/
|
||||||
int
|
int
|
||||||
mineq(char *a, char *b)
|
mineq(char *a, char *b)
|
||||||
|
@ -80,7 +80,7 @@ mineq(char *a, char *b)
|
||||||
int i;
|
int i;
|
||||||
|
|
||||||
/* find common prefix: */
|
/* find common prefix: */
|
||||||
for (i = 0; a[i] != 0 && a[i] == b[i]; ++i) ;
|
for (i = 0; a[i] != 0 && a[i] == b[i]; i++) ;
|
||||||
|
|
||||||
if (a[i] != 0) return ME_MISMATCH;
|
if (a[i] != 0) return ME_MISMATCH;
|
||||||
if (b[i] == 0 || b[i] == ' ') return ME_EXACT;
|
if (b[i] == 0 || b[i] == ' ') return ME_EXACT;
|
||||||
|
|
Loading…
Add table
Add a link
Reference in a new issue