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
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
|
/* $NetBSD: mkindex.c,v 1.11 2009/08/12 05:29:40 dholland Exp $ */
/*-
* Copyright (c) 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Barry Brachman.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifndef lint
static char copyright[] = "@(#) Copyright (c) 1993\n\
The Regents of the University of California. All rights reserved.\n";
#if 0
static char sccsid[] = "@(#)mkindex.c 8.1 (Berkeley) 6/11/93";
#else
static char rcsid[] =
"$NetBSD: mkindex.c,v 1.11 2009/08/12 05:29:40 dholland Exp $";
#endif
#endif /* not lint */
#include <stdio.h>
#include <stdlib.h>
#include "bog.h"
static char *nextword(FILE *, char *, int *, int *);
int
main(void)
{
int clen, rlen, prev, i;
long off, start;
char buf[MAXWORDLEN + 1];
prev = '\0';
off = start = 0L;
while (nextword(stdin, buf, &clen, &rlen) != NULL) {
if (*buf != prev) {
/*
* Boggle expects a full index even if the dictionary
* had no words beginning with some letters.
* So we write out entries for every letter from prev
* to *buf.
*/
if (prev != '\0')
printf("%c %6ld %6ld\n", prev, start, off - 1);
for (i = (prev ? prev + 1 : 'a'); i < *buf; i++)
printf("%c %6ld %6ld\n", i, off, off - 1);
prev = *buf;
start = off;
}
off += clen + 1;
}
printf("%c %6ld %6ld\n", prev, start, off - 1);
for (i = prev + 1; i <= 'z'; i++)
printf("%c %6ld %6ld\n", i, off, off - 1);
fflush(stdout);
if (ferror(stdout)) {
perror("error writing standard output");
exit(1);
}
exit(0);
}
/*
* Return the next word in the compressed dictionary in 'buffer' or
* NULL on end-of-file
* Also set clen to the length of the compressed word (for mkindex) and
* rlen to the strlen() of the real word
*/
static char *
nextword(FILE *fp, char *buffer, int *clen, int *rlen)
{
int ch, pcount;
char *p, *q;
static char buf[MAXWORDLEN + 1];
static int first = 1;
static int lastch = 0;
if (first) {
if ((pcount = getc(fp)) == EOF)
return (NULL);
first = 0;
}
else if ((pcount = lastch) == EOF)
return (NULL);
p = buf + (*clen = pcount);
while ((ch = getc(fp)) != EOF && ch >= 'a')
*p++ = ch;
lastch = ch;
*p = '\0';
*rlen = (int) (p - buf);
*clen = *rlen - *clen;
p = buf;
q = buffer;
while ((*q++ = *p) != '\0') {
if (*p++ == 'q')
*q++ = 'u';
}
return (buffer);
}
|
