blob: 35d9015bba7abb48852c04caed124c62ae11dd5f (
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
|
/*
// @(#)test.c 1.1 10/18/96
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
int
main (argc, argv)
int argc;
char *argv[];
{
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;
}
|
