blob: 294512de46250177ff8fc535a1add09dc6a01c0f (
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
|
// $Id: test.cpp 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>
#include <string.h>
static const int MAX_LEN = 80;
char *in_word_set (const char *str, int len);
int
main (int argc, char *argv[])
{
int verbose = argc > 1 && strcmp (argv[1], "-v") == 0 ? 1 : 0;
char buf[MAX_LEN];
while (fgets (buf, sizeof buf, stdin) != 0)
{
int len = strlen (buf) - 1;
buf[len] = '\0';
if (in_word_set (buf, len) && verbose)
printf ("in word set %s\n", buf);
else if (verbose)
printf ("NOT in word set %s\n", buf);
}
return 0;
}
|