{
copy[i + 1] = 's';
packed_to_token(PARMS[pi], parameters[pi]);
- for (int i = 0; i < strlen(parameters[pi]); ++i)
+ for (int j = 0; j < strlen(parameters[pi]); ++j)
{
- parameters[pi][i] = tolower(parameters[pi][i]);
+ parameters[pi][j] = tolower(parameters[pi][j]);
}
}
{
copy[i + 1] = 's';
packed_to_token(PARMS[pi], parameters[pi]);
- for (int i = 0; i < strlen(parameters[pi]); ++i)
+ for (int j = 0; j < strlen(parameters[pi]); ++j)
{
- parameters[pi][i] = tolower(parameters[pi][i]);
+ parameters[pi][j] = tolower(parameters[pi][j]);
}
parameters[pi][0] = toupper(parameters[pi][0]);
}
(junk > 0);
if (GETTXT(true,true,true) <= 0)
return true;
- RSPEAK(53);
+ RSPEAK(TWO_WORDS);
}
}
RSPEAK(z);
return false;
}
- RSPEAK(185);
+ RSPEAK(PLEASE_ANSWER);
}
}
* (Thus "STEPS", which is a motion verb as well as an object, may be located
* as an object.) And it also means the KTAB value is taken modulo 1000. */
{
- long i, lexeme;
+ long lexeme;
- for (i=1; i<=TABSIZ; i++) {
+ for (long i=1; i<=TABSIZ; i++) {
if (KTAB[i] == -1) {
lexeme= -1;
if (init < 0)
return(lexeme);
BUG(5);
}
- if (init >= 0 && KTAB[i]/1000 != init)
+ if (init >= 0 && KTAB[i]/1000 != init)
continue;
if (ATAB[i] == id) {
lexeme=KTAB[i];
* there (or if dwarves not active yet), -1 if all dwarves are dead. Ignore
* the pirate (6th dwarf). */
{
- long at, i;
+ long at;
at =0;
if (game.dflag < 2)
return(at);
at = -1;
- for (i=1; i<=NDWARVES-1; i++) {
+ for (long i=1; i<=NDWARVES-1; i++) {
if (game.dloc[i] == where)
return i;
if (game.dloc[i] != 0)
bool MAPLIN(FILE *fp)
{
- long i, val;
bool eof;
/* Read a line of input, from the specified input source.
if (!eof) {
strncpy(rawbuf, cp, sizeof(rawbuf)-1);
linenoiseHistoryAdd(rawbuf);
- strncat(rawbuf, "\n", sizeof(rawbuf)-1);
+ strncat(rawbuf, "\n", sizeof(rawbuf) - strlen(rawbuf) - 1);
linenoiseFree(cp);
}
}
* and is not changed thereafter unless the routines on this page choose
* to do so. */
LNLENG=0;
- for (i=1; i<=(long)sizeof(INLINE) && INLINE[i]!=0; i++) {
- val=INLINE[i];
+ for (long i=1; i<=(long)sizeof(INLINE) && INLINE[i]!=0; i++) {
+ long val=INLINE[i];
INLINE[i]=ascii_to_advent[val];
if (INLINE[i] != 0)
LNLENG=i;