/* Description of the database format
*
*
- * The data file contains several sections. each begins with a line containing
+ * The data file contains several sections. Each begins with a line containing
* a number identifying the section, and ends with a line containing "-1".
*
* Section 1: Long form descriptions. Each line contains a location number,
/* The various messages (sections 1, 2, 5, 6, etc.) may include certain
* special character sequences to denote that the program must provide
- * parameters to insert into a message when the message is printed. these
+ * parameters to insert into a message when the message is printed. These
* sequences are:
* %S = The letter 'S' or nothing (if a given value is exactly 1)
* %W = A word (up to 10 characters)
static void quick_io(void);
void initialise(void) {
- printf("Initialising...\n");
+ if (oldstyle)
+ printf("Initialising...\n");
if(!quick_init()){raw_init(); report(); quick_save();}
finish_init();
}
CLSSES=0;
TRNVLS=0;
-/* Start new data section. sect is the section number. */
+/* Start new data section. Sect is the section number. */
L1002: SECT=GETNUM(OPENED);
OLDLOC= -1;
if(LNLENG < LNPOSN)BUG(1);
L1006: KK=KK+1;
if(KK >= LINSIZ)BUG(2);
- LINES[KK]=GETTXT(false,false,false,KK);
+ LINES[KK]=GETTXT(false,false,false);
if(LINES[KK] != -1) goto L1006;
LINES[LINUSE]=KK;
if(LOC == OLDLOC) goto L1005;
goto L1005;
/* The stuff for section 3 is encoded here. Each "from-location" gets a
- * contiguous section of the "TRAVEL" array. each entry in travel is
+ * contiguous section of the "TRAVEL" array. Each entry in travel is
* NEWLOC*1000 + KEYWORD (from section 4, motion verbs), and is negated if
* this is the last entry for this location. KEY(N) is the index in travel
* of the first option at location N. */
/* Here we read in the vocabulary. KTAB(N) is the word number, ATAB(N) is
* the corresponding word. The -1 at the end of section 4 is left in KTAB
- * as an end-marker. The words are given a minimal hash to make deciphering
- * the core-image harder. (We don't use gettxt's hash since that would force
- * us to hash each input line to make comparisons work, and that in turn
- * would make it harder to detect particular input words.) */
+ * as an end-marker. */
L1040: J=10000;
for (TABNDX=1; TABNDX<=TABSIZ; TABNDX++) {
KTAB[TABNDX]=GETNUM(OPENED);
if(KTAB[TABNDX] == -1) goto L1002;
J=J+7;
- ATAB[TABNDX]=GETTXT(true,true,true,0)+J*J;
+ ATAB[TABNDX]=GETTXT(true,true,true);
} /* end loop */
BUG(4);
HINTLC[I]=0;
} /* end loop */
-/* Define some handy mnemonics. these correspond to object numbers. */
+/* Define some handy mnemonics. These correspond to object numbers. */
AXE=VOCWRD(12405,1);
BATTER=VOCWRD(201202005,1);