1 /* $NetBSD: mkindex.c,v 1.7 1999/12/07 07:47:08 jsm Exp $ */ 2 3 /*- 4 * Copyright (c) 1993 5 * The Regents of the University of California. All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * Barry Brachman. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 */ 38 39 #include <sys/cdefs.h> 40 #ifndef lint 41 __COPYRIGHT("@(#) Copyright (c) 1993\n\ 42 The Regents of the University of California. All rights reserved.\n"); 43 #endif /* not lint */ 44 45 #ifndef lint 46 #if 0 47 static char sccsid[] = "@(#)mkindex.c 8.1 (Berkeley) 6/11/93"; 48 #else 49 __RCSID("$NetBSD: mkindex.c,v 1.7 1999/12/07 07:47:08 jsm Exp $"); 50 #endif 51 #endif /* not lint */ 52 53 #include <err.h> 54 #include <stdio.h> 55 #include <stdlib.h> 56 57 #include "bog.h" 58 59 int main __P((void)); 60 char *nextword __P((FILE *, char *, int *, int *)); 61 62 int 63 main(void) 64 { 65 int clen, rlen, prev, i; 66 long off, start; 67 char buf[MAXWORDLEN + 1]; 68 69 prev = '\0'; 70 off = start = 0L; 71 while (nextword(stdin, buf, &clen, &rlen) != NULL) { 72 if (*buf != prev) { 73 /* 74 * Boggle expects a full index even if the dictionary 75 * had no words beginning with some letters. 76 * So we write out entries for every letter from prev 77 * to *buf. 78 */ 79 if (prev != '\0') 80 printf("%c %6ld %6ld\n", prev, start, off - 1); 81 for (i = (prev ? prev + 1 : 'a'); i < *buf; i++) 82 printf("%c %6ld %6ld\n", i, off, off - 1); 83 prev = *buf; 84 start = off; 85 } 86 off += clen + 1; 87 } 88 printf("%c %6ld %6ld\n", prev, start, off - 1); 89 for (i = prev + 1; i <= 'z'; i++) 90 printf("%c %6ld %6ld\n", i, off, off - 1); 91 fflush(stdout); 92 if (ferror(stdout)) 93 err(1, "writing standard output"); 94 exit(0); 95 } 96 97 /* 98 * Return the next word in the compressed dictionary in 'buffer' or 99 * NULL on end-of-file 100 * Also set clen to the length of the compressed word (for mkindex) and 101 * rlen to the strlen() of the real word 102 */ 103 char * 104 nextword(fp, buffer, clen, rlen) 105 FILE *fp; 106 char *buffer; 107 int *clen, *rlen; 108 { 109 int ch, pcount; 110 char *p, *q; 111 static char buf[MAXWORDLEN + 1]; 112 static int first = 1; 113 static int lastch = 0; 114 115 if (first) { 116 if ((pcount = getc(fp)) == EOF) 117 return (NULL); 118 first = 0; 119 } 120 else if ((pcount = lastch) == EOF) 121 return (NULL); 122 123 p = buf + (*clen = pcount); 124 125 while ((ch = getc(fp)) != EOF && ch >= 'a') 126 *p++ = ch; 127 lastch = ch; 128 *p = '\0'; 129 130 *rlen = (int) (p - buf); 131 *clen = *rlen - *clen; 132 133 p = buf; 134 q = buffer; 135 while ((*q++ = *p) != '\0') { 136 if (*p++ == 'q') 137 *q++ = 'u'; 138 } 139 return (buffer); 140 } 141