|
|
1.1 root 1: /*
2: * Simply write words from standard
3: * input (must be sorted) to standard
4: * output in compressed form. The
5: * functionality is different than the
6: * hashed version of spell. The assumption
7: * is that you can sort -m each of the
8: * dictionaries and always normally stored
9: * word lists as well.
10: */
11:
12: #include <stdio.h>
13:
14: char word[100];
15:
16: main(argc, argv)
17: char *argv[];
18: {
19: if (argc > 1)
20: usage();
21: init();
22: while (gets(word) != NULL)
23: putword(word, stdout);
24: fflush(stdout);
25: if (ferror(stdout)) {
26: fprintf(stderr, "spellin: I/O error on output\n");
27: exit(1);
28: }
29: exit(0);
30: }
31:
32: usage()
33: {
34: fprintf(stderr, "Usage: spellin\n");
35: exit(1);
36: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.