blob: 42937aaa5ca42fc55bd5bcf6d4356010773ff350 (
plain)
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
70
71
72
73
74
|
/*
* Copyright 1990 Sun Microsystems, Inc. All rights reserved.
* Use is subject to license terms.
*/
/* Copyright (c) 1984, 1986, 1987, 1988, 1989 AT&T */
/* All Rights Reserved */
/*
* Copyright (c) 1980 Regents of the University of California.
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
*/
#pragma ident "%Z%%M% %I% %E% SMI"
/* ts.c: minor string processing subroutines */
int
match(char *s1, char *s2)
{
while (*s1 == *s2)
if (*s1++ == '\0')
return(1);
else
s2++;
return(0);
}
int
prefix(char *small, char *big)
{
int c;
while ((c= *small++) == *big++)
if (c==0) return(1);
return(c==0);
}
int
letter(int ch)
{
if (ch >= 'a' && ch <= 'z')
return(1);
if (ch >= 'A' && ch <= 'Z')
return(1);
return(0);
}
int
numb(char *str)
{
/* convert to integer */
int k;
for (k=0; *str >= '0' && *str <= '9'; str++)
k = k*10 + *str - '0';
return(k);
}
int
digit(int x)
{
return(x>= '0' && x<= '9');
}
int
max(int a, int b)
{
return( a>b ? a : b);
}
void
tcopy(char *s, char *t)
{
while (*s++ = *t++);
}
|
