Initial revision

git-svn-id: file:///srv/svn/joey/bsdgames-trunk@5086 a4a2c43b-8ac3-0310-8836-e0e880c912e2
This commit is contained in:
joey
1999-09-08 23:56:51 +00:00
commit 03272d67da
623 changed files with 243457 additions and 0 deletions

View File

@@ -0,0 +1,21 @@
# $NetBSD: Makefile,v 1.8 1998/04/13 14:14:39 lukem Exp $
# @(#)Makefile 8.1 (Berkeley) 6/11/93
PROG= mkdict
HOST_CPPFLAGS+=-I${.CURDIR}/../boggle
NOMAN= noman
# XXX for "make depend"
CPPFLAGS+=-I${.CURDIR}/../boggle
# only needed during build
proginstall::
# Override these rules for cross-compilation
.c.o:
${HOST_COMPILE.c} ${.IMPSRC}
${PROG}: ${OBJS}
${HOST_LINK.c} -o ${.TARGET} ${OBJS}
.include <bsd.prog.mk>

18
boggle/mkdict/Makefrag Normal file
View File

@@ -0,0 +1,18 @@
# Makefrag - makefile fragment for boggle/mkdict
boggle_mkdict_CLEANFILES := dictionary
# boggle_mkdict_DICTSRC is the dictionary that will be used to construct the
# word list used by boggle.
boggle_mkdict_DICTSRC := hangman/words
boggle_mkdict_DIRS := $(BOGGLE_DIR)
boggle_mkdict_INCS := -Iboggle/boggle
boggle/mkdict/dictionary: boggle/mkdict/mkdict $(boggle_mkdict_DICTSRC)
$< <$(boggle_mkdict_DICTSRC) >$@
boggle_mkdict_all: boggle/mkdict/dictionary
boggle_mkdict_install: boggle_mkdict_all
$(INSTALL_DATA) boggle/mkdict/dictionary $(INSTALL_PREFIX)$(BOGGLE_DIR)/dictionary

130
boggle/mkdict/mkdict.c Normal file
View File

@@ -0,0 +1,130 @@
/* $NetBSD: mkdict.c,v 1.3 1997/10/11 02:12:21 lukem 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. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. 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.
*/
#include <sys/cdefs.h>
#ifndef lint
__COPYRIGHT("@(#) Copyright (c) 1993\n\
The Regents of the University of California. All rights reserved.\n");
#endif /* not lint */
#ifndef lint
#if 0
static char sccsid[] = "@(#)mkdict.c 8.1 (Berkeley) 6/11/93";
#else
__RCSID("$NetBSD: mkdict.c,v 1.3 1997/10/11 02:12:21 lukem Exp $");
#endif
#endif /* not lint */
/*
* Filter out words that:
* 1) Are not completely made up of lower case letters
* 2) Contain a 'q' not immediately followed by a 'u'
* 3) Are less that 3 characters long
* 4) Are greater than MAXWORDLEN characters long
*/
#include <ctype.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <err.h>
#include "bog.h"
int main __P((int, char *[]));
int
main(argc, argv)
int argc;
char *argv[];
{
char *p, *q;
int ch, common, nwords;
int current, len, prev, qcount;
char buf[2][MAXWORDLEN + 1];
prev = 0;
current = 1;
buf[prev][0] = '\0';
for (nwords = 1;
fgets(buf[current], MAXWORDLEN + 1, stdin) != NULL; ++nwords) {
if ((p = strchr(buf[current], '\n')) == NULL) {
warnx("word too long: %s", buf[current]);
while ((ch = getc(stdin)) != EOF && ch != '\n')
;
if (ch == EOF)
break;
continue;
}
len = 0;
for (p = buf[current]; *p != '\n'; p++) {
if (!islower(*p))
break;
if (*p == 'q') {
q = p + 1;
if (*q != 'u')
break;
else {
while ((*q = *(q + 1)))
q++;
}
len++;
}
len++;
}
if (*p != '\n' || len < 3 || len > MAXWORDLEN)
continue;
if (argc == 2 && nwords % atoi(argv[1]))
continue;
*p = '\0';
p = buf[current];
q = buf[prev];
qcount = 0;
while ((ch = *p++) == *q++ && ch != '\0')
if (ch == 'q')
qcount++;
common = p - buf[current] - 1;
printf("%c%s", common + qcount, p - 1);
prev = !prev;
current = !current;
}
warnx("%d words", nwords);
exit(0);
}