diff -Nru wordplay-7.22/AUTHORS wordplay-8.0/AUTHORS --- wordplay-7.22/AUTHORS 1970-01-01 00:00:00.000000000 +0000 +++ wordplay-8.0/AUTHORS 2019-05-05 04:17:05.000000000 +0000 @@ -0,0 +1,6 @@ +Evans A Criswell criswell@cs.uah.edu +Logan Rosen logan@ubuntu.com +David William Richmond Jones dwrj87@gmail.com +Innocent De Marchi tangram.peces@gmail.com +Moshe Piekarski wordplay@melachim.net +Clayton Smith argilo@gmail.com diff -Nru wordplay-7.22/CHANGELOG wordplay-8.0/CHANGELOG --- wordplay-7.22/CHANGELOG 1970-01-01 00:00:00.000000000 +0000 +++ wordplay-8.0/CHANGELOG 2019-05-05 04:17:05.000000000 +0000 @@ -0,0 +1,142 @@ +commit 075c866e86a2d37a80b08276cf3fa86263d83739 +Author: Moshe Piekarski +Date: Tue Apr 23 14:01:01 2019 -0500 + + increase cap on candidate word list size + +commit c344cc6cd313e3e3a1ad6150b43c4fe8a45b57e7 +Author: Clayton Smith +Date: Thu Jan 10 13:36:44 2019 -0600 + + Corrected an error about a close of a file discriptor + +commit a6348fc812a63f3579f3ebfd179e64bb98472c1a +Author: Moshe Piekarski +Date: Tue Apr 16 14:09:43 2019 -0500 + + Option for showing input string in list of anagrams. + + Added a flag without which wordplay removes the input string from the list of possible anagrams. + +commit d2c5deeb57e8c2a202e997baa9c6bcbadd7fc148 +Author: Innocent De Marchi +Date: Sun Dec 24 13:08:10 2017 -0600 + + Prevent non-alphabetic characters from getting processed + +commit 1b58220e35a054a4865fb971371e9f4196ce68c6 +Author: David William Richmond Jones +Date: Thu Nov 3 17:44:02 2016 -0500 + + Remove hardcoded compiler + + Remove the hardcoded compiler from makefile + so other compilers can be used and cflags can be passed. + +commit 0d362f2a26021599d65904b9465e566a09ea92b0 +Author: Logan Rosen +Date: Thu Nov 3 17:20:17 2016 -0500 + + Include stdlib.h + + There are implicit function declarations in wordplay.c. + These "might hide issues the compiler could otherwise + warn about or cause bad code," so they should probably + be patched. + +Evans A Criswell + +03-20-96 Fixed a small memory allocation problem. In a couple of places, + the amount allocated to hold character strings was not taking the + space to store the null into account. This bug has only affected + a couple of people. +09-11-95 In the anagramr7 function, I check the product of the maximum + "levels deep" remaining and the length of the longest candidate + word. If this product is less than the length of the string + passed in, a "dead end" condition exists. This makes the program + run significantly faster for longer strings if the maximum + depth option is used. +08-21-94 Added "wordfile from stdin" option using "-f -" + Fixed "4" bug. Digits in a string disqualify the string. + Vowel-check override option added. + Starting word ("w" option) checked to see if it's an anagram + of the initial string. +08-16-94 Used integer masks representing which letters appear in each + word, allowing extraction checking to be checked quickly for + failure in the anagramr7 routine. Result: the program has + been 4 to 5 times faster. +08-14-94 Made the program much more memory efficient. Instead of calling + malloc for each word in the candidate word list and in the key + list, a contiguous block of memory was allocated to hold the + words. The block is realloc'ed if it needs to be increased as + the words are read in. After the words are packed into the + block, the pointers are allocated and are pointed to the + appropriate places (beginnings of words) in the block, so the + rest of the program works with no modification. Two gigantic + arrays that weren't being used were eliminated. The word length + index arrays are now made to be the size of the longest word + instead of MAX_WORDS. In fact, MAX_WORDS is now obsolete. +07-14-94 Added "silent" option. +06-03-94 Added "#include " so it would work on BSD/386 . Thanks + to mcintyre@io.com (James Michael Stewart) for reporting the bug. +05-26-94 Fixed command-line parsing bug. +05-25-94 Eliminated redundant permutations. Added option to specify a + word to appear in anagrams. Added maximum depth option (number + of words, maximum, to appear in an anagram). +05-24-94 Added option so user could specify whether to allow anagrams + with adjacent duplicate words like "A A" or "DOG DOG". +05-16-94 Made a second copy of the word list and sorted each word's + letters alphabetically and sorted this list of keys alphabetically. + Modified the recursive algorithm to use the new index. (Ver 6.00) +05-16-94 Another little bug fix. Someone found that, on their machine, + if there are no candidate words loaded for the string being + anagrammed, it causes an error when malloc gets passed a zero + value for the amount to allocate. +05-13-94 Tiny bug fix. Just a small bug that never actually caused a + crash, but very well could have if it had wanted to. :-) +04-25-94 Speed increase. If exts indicates extraction was impossible, + continue (try next word) instead of executing rest of loop body. +04-21-91 Ron Gregory found a simple bug that has been in all the C + versions (4.00 through 5.20). In the one-word anagram + section, a less than should have been a less than or equal to. + A simple fencepost error. The recursive anagram procedure had + a similar problem. A severe error was fixed in the version + 5.20 read routine which caused the program not to read the + wordfile correctly if the entries were lowercase. +04-17-94 Since this program, since it was ported to C, is command-line + based, and only anagrams one string, it is not necessary to + store the wordlist internally. Unnecessary words are weeded + out as the list is being read, using the "extract" routine. + I can't believe I didn't think of using that routine for that + purpose sooner. That means pass1 and pass2 are obsolete. +04-14-94 Changed the "extract" function to use pointers instead of + array notation. Under some compilers, this may nearly double + the execution speed of the recursive anagram procedure. On + other compilers, it may make no difference at all. +04-11-94 Added the minimum and maximum candidate word length options + that were available in version 3.00 when the program was + interactive. This helps to narrow down the word list and + eliminate a lot of short words when anagramming long strings. +11-30-93 Fixed a bug that Versions 5.00 and 5.01 had. If there were + no words in the candidate word list with the same length as + the string passed to anagramr, the string passed to anagramr + would not be anagrammed, causing many possible anagrams to + be missed. +11-08-93 Eliminated anagrams consisting of the same word occurring + multiple times in a row, such "IS IS ...", since interesting + anagrams rarely contain such repetitions. (Version 5.01) +11-08-93 Debug print statements commented and output cleaned up. + Version 5.00 completed. It is currently not known which is + always faster: the old iterative 2 and 3 word anagram options + or the recursive algorithm. All the options from version 4.00 + are still in the program. +11-07-93 Recursive algorithm working! +11-03-93 Added code to index the candidate word list by number of vowels + per word. (Beginning of 5.00 Alpha) Never used in Version 5.00, + but the code is there for future use. +05-25-93 Three word anagramming capability ported and added. +04-30-93 The big port from FORTRAN 77 to ANSI C. No longer interactive. + Instead, arguments are taken from the command line. + (Everything working except three-word anagrams and all command + line options not yet implemented) + diff -Nru wordplay-7.22/debian/changelog wordplay-8.0/debian/changelog --- wordplay-7.22/debian/changelog 2019-05-23 15:08:08.000000000 +0000 +++ wordplay-8.0/debian/changelog 2019-07-09 07:24:08.000000000 +0000 @@ -1,6 +1,21 @@ +wordplay (8.0-1) unstable; urgency=medium + + * New upstream. + * New upstream release. + * Remove patches applied upstream. + * Add option to use system default wordlist. + * Bump to debhelper 12. + * Add suggests wordlist. + * Update manpage. + * Bump Standards-Version to 4.3.0 + * Add attribution to old patches. + * Fix upstream attribution errors + + -- Moshe Piekarski Tue, 09 Jul 2019 03:24:08 -0400 + wordplay (7.22-21) unstable; urgency=medium - * New maintainer (Closes: #922894). + * New maintainer. (Closes: #922894). * Update license (Closes: #929338). -- Moshe Piekarski Thu, 23 May 2019 11:08:08 -0400 diff -Nru wordplay-7.22/debian/compat wordplay-8.0/debian/compat --- wordplay-7.22/debian/compat 2016-11-03 23:03:11.000000000 +0000 +++ wordplay-8.0/debian/compat 1970-01-01 00:00:00.000000000 +0000 @@ -1 +0,0 @@ -10 diff -Nru wordplay-7.22/debian/control wordplay-8.0/debian/control --- wordplay-7.22/debian/control 2019-05-23 15:08:08.000000000 +0000 +++ wordplay-8.0/debian/control 2019-05-20 17:34:15.000000000 +0000 @@ -1,14 +1,15 @@ Source: wordplay Section: games Priority: optional -Build-Depends: debhelper (>=10) -Homepage: http://hsvmovies.com/static_subpages/personal_orig/wordplay/index.html +Build-Depends: debhelper (>=12), debhelper-compat (= 12) +Homepage: https://github.com/mendelmunkis/wordplay Maintainer: Moshe Piekarski -Standards-Version: 4.1.3 +Standards-Version: 4.3.0 Package: wordplay Architecture: any Depends: ${misc:Depends}, ${shlibs:Depends} +Suggests: wordlist Description: anagram generator Wordplay generates anagrams of words. For example, "Debian" = "Bendai" (with an Italian Dictionary) or diff -Nru wordplay-7.22/debian/copyright wordplay-8.0/debian/copyright --- wordplay-7.22/debian/copyright 2019-05-23 15:01:34.000000000 +0000 +++ wordplay-8.0/debian/copyright 2019-05-06 01:37:33.000000000 +0000 @@ -1,12 +1,15 @@ Format: https://www.debian.org/doc/packaging-manuals/copyright-format/1.0/ Upstream-Name: wordplay -Upstream-Contact: Evans A Criswell -Source: http://hsvmovies.com/static_subpages/personal_orig/wordplay/index.html +Upstream-Contact: Moshe Piekarski +Source: https://github.com/mendelmunkis/wordplay Files: * -Copyright: Evans A Criswell -License: GPL-2+ +Copyright: 1993-1996 Evans A Criswell + copyright 2016 Logan Rosen, David William Richmond Jones + copyright 2017 Innocent De Marchi + copyright 2019 Moshe Piekarski, Clayton Smith +License: GPL-3+ Files: debian/* Copyright: 1996-2000 Joey Hess @@ -15,13 +18,14 @@ 2016 Giovani Augusto Ferreira 2016 David William Richmond Jones 2017 Innocent De Marchi -License: GPL-2+ + 2019 Moshe Piekarski +License: GPL-3+ -License: GPL-2+ +License: GPL-3+ This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either - version 2 of the License, or (at your option) any later + version 3 of the License, or (at your option) any later version. . This program is distributed in the hope that it will be @@ -36,5 +40,5 @@ Boston, MA 02110-1301 USA . On Debian systems, the full text of the GNU General Public - License version 2 can be found in the file - `/usr/share/common-licenses/GPL-2'. + License version 3 can be found in the file + `/usr/share/common-licenses/GPL-3'. diff -Nru wordplay-7.22/debian/patches/copyright wordplay-8.0/debian/patches/copyright --- wordplay-7.22/debian/patches/copyright 1970-01-01 00:00:00.000000000 +0000 +++ wordplay-8.0/debian/patches/copyright 2019-06-03 14:18:10.000000000 +0000 @@ -0,0 +1,15 @@ +Description: fix upstream attribution errors +Author: Moshe Piekarski +--- a/wordplay.c ++++ b/wordplay.c +@@ -1,8 +1,8 @@ + /* +-parts released to public domain by Evans Criswell ++copyright 1996 Evans Criswell + copyright 2016 Logan Rosen, David William Richmond Jones + copyright 2017 Innocent De Marchi +-copyright 2019 Moshe Piekarski ++copyright 2019 Moshe Piekarski, Clayton Smith + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by diff -Nru wordplay-7.22/debian/patches/extra_words.patch wordplay-8.0/debian/patches/extra_words.patch --- wordplay-7.22/debian/patches/extra_words.patch 2017-12-24 17:13:09.000000000 +0000 +++ wordplay-8.0/debian/patches/extra_words.patch 2019-05-30 06:26:48.000000000 +0000 @@ -1,5 +1,5 @@ Description: Added one word to upstream words file. -Author: Unknow +Author: Joey Hess Forwarded: no --- a/words721.txt diff -Nru wordplay-7.22/debian/patches/fix-superfluous-letters.patch wordplay-8.0/debian/patches/fix-superfluous-letters.patch --- wordplay-7.22/debian/patches/fix-superfluous-letters.patch 2017-12-24 17:13:09.000000000 +0000 +++ wordplay-8.0/debian/patches/fix-superfluous-letters.patch 1970-01-01 00:00:00.000000000 +0000 @@ -1,98 +0,0 @@ -Description: Avoid adding new lyrics to the program. - It also limits the result to words of equal length. -Author: Innocent De Marchi -Forwarded: no - ---- a/wordplay.c -+++ b/wordplay.c -@@ -177,8 +177,11 @@ - - int *lindx1; - int *lindx2; --int findx1[26]; --int findx2[26]; -+int findx1[30]; -+int findx2[30]; -+int findx12 = 30; -+ -+char pristineinitword[MAX_WORD_LENGTH]; - - int main (int argc, char *argv[]) - { -@@ -381,8 +384,13 @@ - } - - /* Remove non-alphabetic characters from initword */ -- -+ strcpy (pristineinitword, initword); - strcpy (tempword, alphabetic (initword)); -+ if(strlen(initword) != strlen(alphabetic (initword))) -+ { -+ printf("Only letters and no accents!\n"); -+ exit (-1); -+ } - strcpy (initword, tempword); - - ilength = (int) strlen (initword); -@@ -537,7 +545,11 @@ - j = 1; - for (i = 0; i < w2size; i++) - if (j < ncount) -- if (words2mem[i] == '\0') words2[j++] = words2mem + i + 1; -+ if ( (words2mem[i] == '\0') && -+ ( (strlen(words2mem + i + 1)) == strlen(alphabetic(words2mem + i + 1)) ) ) -+ { -+ words2[j++] = words2mem + i + 1; -+ } - - - if (silent == 0) printf ("\n%d words loaded (%d byte block). " -@@ -777,7 +789,7 @@ - printf ("Beginning creation of first letter indexes.\n"); - */ - -- for (i = 0; i < 26; i++) -+ for (i = 0; i < findx12; i++) - { - findx1[i] = -1; - findx2[i] = -2; -@@ -978,6 +990,8 @@ - extsuccess = 0; - - icurlet = (int) s[0] - (int) 'A'; -+ int printedwords; -+ printedwords = 0; - for (i = max (*minkey, findx1[icurlet]); i <= findx2[icurlet]; i++) - { - -@@ -1011,12 +1025,26 @@ - - if (*exts == '\0') - { -- rec_anag_count++; - strcpy (accum[*level], words2ptrs[i]); -- if (silent == 0) printf ("%6d. ", rec_anag_count); -- for (j = 0; j < *level; j++) printf ("%s ", accum[j]); -- printf ("%s\n", words2ptrs[i]); -+ if( strlen(words2ptrs[i]) == strlen(alphabetic (pristineinitword)) ) -+ { -+ int findword,m; -+ findword = 0; -+ m = 0; -+ // if (strcmp(pristineinitword, words2ptrs[i]) == 0) findword = 1; -+ for (m = 0; m < i; m++) -+ { -+ if ((strcmp(words2ptrs[i], words2ptrs[m]) == 0) ) -+ findword = 1; -+ } -+ if (findword == 0 ) -+ { -+ rec_anag_count++; -+ printf ("%6d. ", rec_anag_count); -+ printf ("%s\n", words2ptrs[i]); -+ } - extsuccess = 1; -+ } - continue; - } - diff -Nru wordplay-7.22/debian/patches/hardcoded_compiler.patch wordplay-8.0/debian/patches/hardcoded_compiler.patch --- wordplay-7.22/debian/patches/hardcoded_compiler.patch 2017-12-24 17:12:26.000000000 +0000 +++ wordplay-8.0/debian/patches/hardcoded_compiler.patch 1970-01-01 00:00:00.000000000 +0000 @@ -1,20 +0,0 @@ -Description: Remove hardcoded compiler - Remove the hardcoded compiler from makefile - so other compilers can be used and cflags can be passed. - Added hardering flags I. De Marchi -Author: David William Richmond Jones -Forwarded: no -Last-Update: 2017-12-24 - ---- a/makefile -+++ b/makefile -@@ -1,8 +1,4 @@ - --# If you don't have gcc, try cc instead, if it is an ANSI compiler. -- --CC=gcc -- - wordplay : wordplay.c -- $(CC) -O -o wordplay wordplay.c -+ $(CC) $(CFLAGS) $(LDFLAGS) $(CPPFLAGS) -O -o wordplay wordplay.c - diff -Nru wordplay-7.22/debian/patches/include_stdlib.patch wordplay-8.0/debian/patches/include_stdlib.patch --- wordplay-7.22/debian/patches/include_stdlib.patch 2016-11-03 23:03:11.000000000 +0000 +++ wordplay-8.0/debian/patches/include_stdlib.patch 1970-01-01 00:00:00.000000000 +0000 @@ -1,19 +0,0 @@ -Description: Include stdlib.h - There are implicit function declarations in wordplay.c. - These "might hide issues the compiler could otherwise - warn about or cause bad code," so they should probably - be patched. -Author: Logan Rosen -Bug-Debian: https://bugs.debian.org/821064 -Forwarded: no -Last-Update: 2016-11-03 ---- a/wordplay.c -+++ b/wordplay.c -@@ -138,6 +138,7 @@ - #include - #include - #include -+#include - - #define max(A, B) ((A) > (B) ? (A) : (B)) - #define min(A, B) ((A) < (B) ? (A) : (B)) diff -Nru wordplay-7.22/debian/patches/series wordplay-8.0/debian/patches/series --- wordplay-7.22/debian/patches/series 2017-12-24 17:13:09.000000000 +0000 +++ wordplay-8.0/debian/patches/series 2019-06-03 14:11:52.000000000 +0000 @@ -1,5 +1,4 @@ -include_stdlib.patch extra_words.patch wordlist_location.patch -hardcoded_compiler.patch -fix-superfluous-letters.patch +use-system-wordlist.patch +copyright diff -Nru wordplay-7.22/debian/patches/use-system-wordlist.patch wordplay-8.0/debian/patches/use-system-wordlist.patch --- wordplay-7.22/debian/patches/use-system-wordlist.patch 1970-01-01 00:00:00.000000000 +0000 +++ wordplay-8.0/debian/patches/use-system-wordlist.patch 2019-05-30 06:26:20.000000000 +0000 @@ -0,0 +1,21 @@ +Description: Option to use system wordlist. + Author: Moshe Piekarski +--- a/wordplay.c ++++ b/wordplay.c +@@ -140,6 +140,7 @@ + fprintf (stderr, "mX = candidate words must have m characters maximum\n"); + fprintf (stderr, "dX = limit anagrams to d words\n\n"); + fprintf (stderr, "w word = word to start anagrams\n"); ++ fprintf (stderr, "F use system wordlist\n"); + fprintf (stderr, "f file = word file to use (\"-f -\" for stdin)\n\n"); + fprintf (stderr, "Suggestion: Run \"wordplay trymenow\" " + " to get started.\n"); +@@ -203,6 +204,8 @@ + break; + case 'v' : vowelcheck = 0; + break; ++ case 'F' : strcpy (word_file_name, "/usr/share/dict/words"); ++ break; + case 'w' : firstwordspec = 1; + specfirstword = 1; + break; diff -Nru wordplay-7.22/debian/patches/wordlist_location.patch wordplay-8.0/debian/patches/wordlist_location.patch --- wordplay-7.22/debian/patches/wordlist_location.patch 2017-12-24 17:13:09.000000000 +0000 +++ wordplay-8.0/debian/patches/wordlist_location.patch 2019-05-30 06:27:30.000000000 +0000 @@ -1,15 +1,16 @@ + Description: Changed words721.txt file location. -Author: Unknow +Author: zhaoway Forwarded: no --- a/wordplay.c +++ b/wordplay.c -@@ -143,7 +143,7 @@ +@@ -25,7 +25,7 @@ #define max(A, B) ((A) > (B) ? (A) : (B)) #define min(A, B) ((A) < (B) ? (A) : (B)) -#define DEFAULT_WORD_FILE "words721.txt" +#define DEFAULT_WORD_FILE "/usr/share/games/wordplay/words721.txt" - #define WORDBLOCKSIZE 4096 + #define WORDBLOCKSIZE 16384 #define MAX_WORD_LENGTH 128 #define SAFETY_ZONE MAX_WORD_LENGTH + 1 diff -Nru wordplay-7.22/debian/rules wordplay-8.0/debian/rules --- wordplay-7.22/debian/rules 2017-12-24 17:08:23.000000000 +0000 +++ wordplay-8.0/debian/rules 2019-05-06 16:57:14.000000000 +0000 @@ -1,7 +1,9 @@ #!/usr/bin/make -f -# Uncomment this to turn on verbose mode. -#export DH_VERBOSE=1 -#export DH_OPTIONS=-v + +ifneq (,$(filter terse,$(DEB_BUILD_OPTIONS))) + export DH_VERBOSE=1 + export DH_OPTIONS=-v +endif CPPFLAGS:=$(shell dpkg-buildflags --get CPPFLAGS) CFLAGS:=$(shell dpkg-buildflags --get CFLAGS) @@ -11,4 +13,3 @@ %: dh $@ - diff -Nru wordplay-7.22/debian/watch wordplay-8.0/debian/watch --- wordplay-7.22/debian/watch 2017-12-24 17:13:09.000000000 +0000 +++ wordplay-8.0/debian/watch 2019-05-06 01:40:27.000000000 +0000 @@ -1,2 +1,3 @@ -version=3 -http://hsvmovies.com/static_subpages/personal_orig/wordplay/wordplay(.+)\.tar\.Z +version=4 +opts=filenamemangle=s/.+\/v?(\d\S+)\.tar\.gz/wordplay-$1\.tar\.gz/ \ + https://github.com/mendelmunkis/wordplay/releases .*/v?(\d\S+)\.tar\.gz \ No newline at end of file diff -Nru wordplay-7.22/debian/wordplay.1 wordplay-8.0/debian/wordplay.1 --- wordplay-7.22/debian/wordplay.1 2016-11-03 22:58:25.000000000 +0000 +++ wordplay-8.0/debian/wordplay.1 2019-05-05 19:55:14.000000000 +0000 @@ -1,8 +1,8 @@ -.TH FOO 1 "DECEMBER 1996" "" "Commands" +.TH WORDPLAY 6 "DECEMBER 1996" "" "Commands" .SH NAME wordplay \- anagram finder .SH SYNOPSIS -.B wordplay string [\-slxavnmd] [\-w word] [\-f wordfile] +.B wordplay string [\-silFxavnmd] [\-w word] [\-f wordfile] .SH DESCRIPTION .B wordplay is an anagram finder. What is an anagram? Well, let's turn to @@ -40,11 +40,16 @@ to generate a wordlist which can be piped or redirected. This option does not suppress error messages that are printed to stderr. Finding zero anagrams is not an error. +.IP -i +Allow input string to appear in the list of anagrams. If this option +is omitted the input will not be counted as an anagram. .IP -l Print list of candidate words before anagramming. This is the list of words that can be spelled with the letters from the specified string, with no letters being used more often that they appear in the input string. +.IP -F +Uses /usr/share/dict/words as wordlist instead of words721.txt. .IP -x Do not perform anagramming. Use with l if you just want the candidate word list without anagrams. diff -Nru wordplay-7.22/LICENSE wordplay-8.0/LICENSE --- wordplay-7.22/LICENSE 1970-01-01 00:00:00.000000000 +0000 +++ wordplay-8.0/LICENSE 2019-05-05 04:17:05.000000000 +0000 @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff -Nru wordplay-7.22/makefile wordplay-8.0/makefile --- wordplay-7.22/makefile 1995-09-12 15:22:32.000000000 +0000 +++ wordplay-8.0/makefile 2019-05-05 04:17:05.000000000 +0000 @@ -1,8 +1,4 @@ -# If you don't have gcc, try cc instead, if it is an ANSI compiler. - -CC=gcc - wordplay : wordplay.c - $(CC) -O -o wordplay wordplay.c + $(CC) $(CFLAGS) $(LDFLAGS) $(CPPFLAGS) -O -o wordplay wordplay.c diff -Nru wordplay-7.22/readme wordplay-8.0/readme --- wordplay-7.22/readme 1996-03-20 15:37:44.000000000 +0000 +++ wordplay-8.0/readme 2019-05-05 04:17:05.000000000 +0000 @@ -1,24 +1,9 @@ ------------------------------------------------------------------------------ -Wordplay Version 7.22 Evans A Criswell 03-20-96 +Wordplay Version 8 05-05-19 ------------------------------------------------------------------------------ -This program was written for fun and is free. Distribute it as you please, -but please distribute the entire package, with the original words721.txt and -the readme file. If you modify the code, please mention my name in it as the -original author. Please send me a copy of improvements you make, because I -may include them in a future version. - -I may be contacted by email at criswell@cs.uah.edu - -Evans A Criswell -Research Associate -Computer Science Department -University of Alabama in Huntsville -Huntsville, AL 35899 - ------------------------------------------------------------------------------- Wordplay is an anagram finder. What is an anagram? Well, let's turn to Merriam-Webster's Collegiate Dictionary, Tenth Edition: @@ -46,28 +31,10 @@ Compiling the program: -The only version of Wordplay that requires compilation is the UNIX version. -The PC versions contain a pre-compiled executable since most people do not -have 32-bit C compilers on their PC's. The source is provided in all the -packages. I recommend the Gnu C compiler for DOS for compiling it. There -is a file in the DOS package that tells where to get the package, as well as -how to set environment variables for the GO32 extender. - -Under UNIX, the program should be compiled with an ANSI C compiler. Never -fear; it's easy. If you have the GNU C compiler, use it as follows: - - gcc -O -o wordplay wordplay.c - -If you do not have "gcc", or for whatever reason, wish to use your machine's -native compiler, use "cc" in place of "gcc", as follows: - - cc -O -o wordplay wordplay.c +Wordplay can be compiled by running. + make wordplay This assumes your native "cc" is an ANSI compiler. If not, it WILL NOT WORK. -If your compiler does not support the optimization option "-O", leave it out. - -Feel free to use optimization options that your particular compiler offers. -They do make a significant difference with some compilers. ----------------------------------------------------------------------------- Usage: @@ -75,7 +42,7 @@ To use the program, simply invoke the program with a combination of options that make sense together. Here is the format: - wordplay string [-slxavnXmXdX] [-w word] [-f wordfile] + wordplay string [-silxavnXmXdX] [-w word] [-f wordfile] where the capital X's represent integers. Please see the examples below the option descriptions. The square brackets are not part of the command @@ -105,6 +72,9 @@ This option does not suppress error messages that are printed to stderr. Finding zero anagrams is not an error. + i: Allow input string to appear in the list of anagrams. If this option is + omitted the input will not be counted as an anagram. + l: Print list of candidate words before anagramming. This is the list of words that can be spelled with the letters from the specified string, with no letters being used more often that they appear in the input @@ -256,7 +226,7 @@ single words also, "ATOMIC NUMBER" will appear twice in the output, once as a one-word anagram and once as a two-word anagram. This is not a flaw in the program. The words721.txt word list does not contain "double words", -but other dictionaries, like web2/web2a, do contain such things. +but other dictionaries do contain such things. The "words721.txt" wordfile: diff -Nru wordplay-7.22/wordplay.c wordplay-8.0/wordplay.c --- wordplay-7.22/wordplay.c 1996-03-20 15:34:00.000000000 +0000 +++ wordplay-8.0/wordplay.c 2019-05-05 04:17:05.000000000 +0000 @@ -1,149 +1,32 @@ /* +parts released to public domain by Evans Criswell +copyright 2016 Logan Rosen, David William Richmond Jones +copyright 2017 Innocent De Marchi +copyright 2019 Moshe Piekarski + +This program is free software: you can redistribute it and/or modify +it under the terms of the GNU General Public License as published by +the Free Software Foundation, either version 3 of the License, or +(at your option) any later version. + +This program is distributed in the hope that it will be useful, +but WITHOUT ANY WARRANTY; without even the implied warranty of +MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +GNU General Public License for more details. -Wordplay Version 7.22 03-20-96 - -Written by Evans A Criswell at the University of Alabama in Huntsville - -03-20-96 Fixed a small memory allocation problem. In a couple of places, - the amount allocated to hold character strings was not taking the - space to store the null into account. This bug has only affected - a couple of people. -09-11-95 In the anagramr7 function, I check the product of the maximum - "levels deep" remaining and the length of the longest candidate - word. If this product is less than the length of the string - passed in, a "dead end" condition exists. This makes the program - run significantly faster for longer strings if the maximum - depth option is used. -08-21-94 Added "wordfile from stdin" option using "-f -" - Fixed "4" bug. Digits in a string disqualify the string. - Vowel-check override option added. - Starting word ("w" option) checked to see if it's an anagram - of the initial string. -08-16-94 Used integer masks representing which letters appear in each - word, allowing extraction checking to be checked quickly for - failure in the anagramr7 routine. Result: the program has - been 4 to 5 times faster. -08-14-94 Made the program much more memory efficient. Instead of calling - malloc for each word in the candidate word list and in the key - list, a contiguous block of memory was allocated to hold the - words. The block is realloc'ed if it needs to be increased as - the words are read in. After the words are packed into the - block, the pointers are allocated and are pointed to the - appropriate places (beginnings of words) in the block, so the - rest of the program works with no modification. Two gigantic - arrays that weren't being used were eliminated. The word length - index arrays are now made to be the size of the longest word - instead of MAX_WORDS. In fact, MAX_WORDS is now obsolete. -07-14-94 Added "silent" option. -06-03-94 Added "#include " so it would work on BSD/386 . Thanks - to mcintyre@io.com (James Michael Stewart) for reporting the bug. -05-26-94 Fixed command-line parsing bug. -05-25-94 Eliminated redundant permutations. Added option to specify a - word to appear in anagrams. Added maximum depth option (number - of words, maximum, to appear in an anagram). -05-24-94 Added option so user could specify whether to allow anagrams - with adjacent duplicate words like "A A" or "DOG DOG". -05-16-94 Made a second copy of the word list and sorted each word's - letters alphabetically and sorted this list of keys alphabetically. - Modified the recursive algorithm to use the new index. (Ver 6.00) -05-16-94 Another little bug fix. Someone found that, on their machine, - if there are no candidate words loaded for the string being - anagrammed, it causes an error when malloc gets passed a zero - value for the amount to allocate. -05-13-94 Tiny bug fix. Just a small bug that never actually caused a - crash, but very well could have if it had wanted to. :-) -04-25-94 Speed increase. If exts indicates extraction was impossible, - continue (try next word) instead of executing rest of loop body. -04-21-91 Ron Gregory found a simple bug that has been in all the C - versions (4.00 through 5.20). In the one-word anagram - section, a less than should have been a less than or equal to. - A simple fencepost error. The recursive anagram procedure had - a similar problem. A severe error was fixed in the version - 5.20 read routine which caused the program not to read the - wordfile correctly if the entries were lowercase. -04-17-94 Since this program, since it was ported to C, is command-line - based, and only anagrams one string, it is not necessary to - store the wordlist internally. Unnecessary words are weeded - out as the list is being read, using the "extract" routine. - I can't believe I didn't think of using that routine for that - purpose sooner. That means pass1 and pass2 are obsolete. -04-14-94 Changed the "extract" function to use pointers instead of - array notation. Under some compilers, this may nearly double - the execution speed of the recursive anagram procedure. On - other compilers, it may make no difference at all. -04-11-94 Added the minimum and maximum candidate word length options - that were available in version 3.00 when the program was - interactive. This helps to narrow down the word list and - eliminate a lot of short words when anagramming long strings. -11-30-93 Fixed a bug that Versions 5.00 and 5.01 had. If there were - no words in the candidate word list with the same length as - the string passed to anagramr, the string passed to anagramr - would not be anagrammed, causing many possible anagrams to - be missed. -11-08-93 Eliminated anagrams consisting of the same word occurring - multiple times in a row, such "IS IS ...", since interesting - anagrams rarely contain such repetitions. (Version 5.01) -11-08-93 Debug print statements commented and output cleaned up. - Version 5.00 completed. It is currently not known which is - always faster: the old iterative 2 and 3 word anagram options - or the recursive algorithm. All the options from version 4.00 - are still in the program. -11-07-93 Recursive algorithm working! -11-03-93 Added code to index the candidate word list by number of vowels - per word. (Beginning of 5.00 Alpha) Never used in Version 5.00, - but the code is there for future use. -05-25-93 Three word anagramming capability ported and added. -04-30-93 The big port from FORTRAN 77 to ANSI C. No longer interactive. - Instead, arguments are taken from the command line. - (Everything working except three-word anagrams and all command - line options not yet implemented) - -Version 4.00 is the first version to be implemented in C. All previous -versions were written in FORTRAN 77. - -Note: There was no version 5.12. It was called 5.20 instead. - -Version 7.22 03-20-96 Bug fix. -Version 7.21 09-11-95 Speed increase. -Version 7.20 08-21-94 Wordfile from stdin capability, bug fixes. -Version 7.11 08-16-94 Speed increase. -Version 7.10 08-14-94 Program uses much less memory. -Version 7.02 07-14-94 Silent option. -Version 7.01 06-03-94 Portability problem fixed. ctypes.h needed . -Version 7.00 05-26-94 Redundant permutations eliminated. Several refinements. -Version 6.00 05-17-94 Huge speed increase. -Version 5.24 05-16-94 Bug fix. -Version 5.23 05-13-94 Tiny bug fix. -Version 5.22 04-25-94 Speed increase. -Version 5.21 04-21-94 Bug fixes. -Version 5.20 04-17-94 Faster program initialization. Far less memory used. -Version 5.11 04-14-94 Slight speed increase with some compilers -Version 5.10 04-11-94 Minimum, maximum candidate word length again - available. (First time available in the C versions). -Version 5.02 11-30-93 Bug fix. -Version 5.01 11-08-93 Optimization to eliminate multiple occurrences - of a particular word in a row. -Version 5.00 11-08-93 Recursive algorithm added -Version 4.00 04-30-93 Ported to C. Became non-interactive and more - suitable for UNIX environment -Version 3.00 12-16-91 Indexing improvements. Huge speed increase -Version 2.10 04-16-91 Options and help added -Version 2.00 04-12-91 Three word anagrams added -Version 1.11 04-11-91 Bug fixes and cleanups -Version 1.10 04-03-91 Pass 2 word filter added. Huge speed increase. -Version 1.00 03-29-91 One and two word anagrams - +You should have received a copy of the GNU General Public License +along with this program. If not, see . */ - #include #include #include +#include #define max(A, B) ((A) > (B) ? (A) : (B)) #define min(A, B) ((A) < (B) ? (A) : (B)) #define DEFAULT_WORD_FILE "words721.txt" -#define WORDBLOCKSIZE 4096 +#define WORDBLOCKSIZE 16384 #define MAX_WORD_LENGTH 128 #define SAFETY_ZONE MAX_WORD_LENGTH + 1 #define MAX_ANAGRAM_WORDS 32 @@ -172,13 +55,17 @@ int specfirstword; int maxdepthspec; int silent; +int input; int max_depth; int vowelcheck; int *lindx1; int *lindx2; -int findx1[26]; -int findx2[26]; +int findx1[30]; +int findx2[30]; +int findx12 = 30; + +char pristineinitword[MAX_WORD_LENGTH]; int main (int argc, char *argv[]) { @@ -238,14 +125,13 @@ if (argc < 2) { fprintf (stderr, - "Wordplay Version 7.22 03-20-96, 1991 by Evans A Criswell\n"); - fprintf (stderr, - "University of Alabama in Huntsville criswell@cs.uah.edu\n\n"); + "Wordplay Version 8 05-05-19 originally by Evans A Criswell\n"); fprintf (stderr, "Usage: "); fprintf (stderr, "wordplay string_to_anagram [-slxavnXmXdX] [-w word] " "[-f word_file]\n\n"); fprintf (stderr, "Capital X represents an integer.\n\n"); fprintf (stderr, "s = silent operation (no header or line numbers)\n"); + fprintf (stderr, "i = include input phrase in anagram list\n"); fprintf (stderr, "l = print candidate word list\n"); fprintf (stderr, "x = do not generate anagrams (useful with l option)\n"); fprintf (stderr, "a = multiple occurrences of a word in an anagram OK\n"); @@ -268,6 +154,7 @@ firstwordspec = 0; specfirstword = 0; /* this is the permanent one */ silent = 0; + input = 0; vowelcheck = 1; maxdepthspec = 0; @@ -312,6 +199,8 @@ break; case 's' : silent = 1; break; + case 'i' : input = 1; + break; case 'v' : vowelcheck = 0; break; case 'w' : firstwordspec = 1; @@ -381,8 +270,12 @@ } /* Remove non-alphabetic characters from initword */ - + strcpy (pristineinitword, initword); strcpy (tempword, alphabetic (initword)); + if(strlen(initword) != strlen(alphabetic (initword))) + { + if (silent == 0) printf("Warning: Characters that are not part of the english alphabet have been removed.\n"); + } strcpy (initword, tempword); ilength = (int) strlen (initword); @@ -461,9 +354,9 @@ } else { + fileinput = 1; if ((word_file_ptr = fopen (word_file_name, "r")) == NULL) { - fileinput = 1; fprintf (stderr, "Error opening word file.\n"); return (-1); } @@ -537,7 +430,11 @@ j = 1; for (i = 0; i < w2size; i++) if (j < ncount) - if (words2mem[i] == '\0') words2[j++] = words2mem + i + 1; + if ( (words2mem[i] == '\0') && + ( (strlen(words2mem + i + 1)) == strlen(alphabetic(words2mem + i + 1)) ) ) + { + words2[j++] = words2mem + i + 1; + } if (silent == 0) printf ("\n%d words loaded (%d byte block). " @@ -777,7 +674,7 @@ printf ("Beginning creation of first letter indexes.\n"); */ - for (i = 0; i < 26; i++) + for (i = 0; i < findx12; i++) { findx1[i] = -1; findx2[i] = -2; @@ -932,6 +829,7 @@ { int i, j, extsuccess, icurlet, newminkey, s_mask; char exts[MAX_WORD_LENGTH]; + char tempword[MAX_WORD_LENGTH+50]; /* Print arguments passed in for debugging purposes */ @@ -1011,11 +909,15 @@ if (*exts == '\0') { - rec_anag_count++; + memset(tempword, '\0', sizeof(tempword)); strcpy (accum[*level], words2ptrs[i]); + for (j = 0; j < *level; j++) {strcat (tempword, accum[j]); strcat(tempword, " ");} + strcat(tempword, words2ptrs[i]); + if ((input == 0) && !strcmp(tempword, pristineinitword)) + continue; + rec_anag_count++; if (silent == 0) printf ("%6d. ", rec_anag_count); - for (j = 0; j < *level; j++) printf ("%s ", accum[j]); - printf ("%s\n", words2ptrs[i]); + printf ("%s\n", tempword); extsuccess = 1; continue; }