blob: 528e2fa4c1411e2ee0ed993721023e2cccdc8046 (
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
|
/*
Tests the generated perfect has function.
The -v option prints diagnostics as to whether a word is in
the set or not. Without -v the program is useful for timing.
*/
#include <stdio.h>
#define MAX_LEN 80
#ifdef __STDC__
int in_word_set (char *, unsigned int);
int
main (int argc, char *argv[])
#else
int
main (argc, argv)
int argc;
char *argv[];
#endif
{
int verbose = argc > 1 ? 1 : 0;
char buf[MAX_LEN];
while (gets (buf))
if (in_word_set (buf, strlen (buf)) && verbose)
printf ("in word set %s\n", buf);
else if (verbose)
printf ("NOT in word set %s\n", buf);
return 0;
}
|
