1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
|
static int casecmp(s1, s2)
/* case-insensitive compare 2 strings */
/* return 0 if equal */
/* 1 if s1 > s2 */
/* -1 if s1 > s2 */
char s1[];
char s2[];
{
int i, val, done;
char c1, c2;
i = 0;
done = 0;
while (done == 0) {
c1 = tolower(s1[i]);
c2 = tolower(s2[i]);
if (c1 > c2) {
val = 1;
done = 1;
} else {
if (c1 < c2) {
val = -1;
done = 1;
} else {
if (c1 == '\0') {
val = 0;
done = 1;
} else {
i = i + 1;
};
};
};
};
return(val);
}
static int stringcmp(s1, s2)
/* case sensitive compare 2 strings */
/* return 0 if equal */
/* 1 if s1 > s2 */
/* -1 if s1 > s2 */
char s1[];
char s2[];
{
int i, val, done;
i = 0;
done = 0;
while (done == 0) {
if (s1[i] > s2[i]) {
val = 1;
done = 1;
} else {
if (s1[i] < s2[i]) {
val = -1;
done = 1;
} else {
if (s1[i] == '\0') {
val = 0;
done = 1;
} else {
i = i + 1;
};
};
};
};
return(val);
}
|
