|
|
BSD 4.3reno
/*
* Copyright (c) 1983 Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms are permitted
* provided that: (1) source distributions retain this entire copyright
* notice and comment, and (2) distributions including binaries display
* the following acknowledgement: ``This product includes software
* developed by the University of California, Berkeley and its contributors''
* in the documentation or other materials provided with the distribution
* and in all advertising materials mentioning features or use of this
* software. 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 ``AS IS'' AND WITHOUT ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*/
#ifndef lint
static char sccsid[] = "@(#)getguess.c 5.4 (Berkeley) 6/1/90";
#endif /* not lint */
# include "hangman.h"
/*
* getguess:
* Get another guess
*/
getguess()
{
register int i;
register int ch;
register bool correct;
leaveok(stdscr, FALSE);
for (;;) {
move(PROMPTY, PROMPTX + sizeof "Guess: ");
refresh();
ch = readch();
if (isalpha(ch)) {
if (isupper(ch))
ch = tolower(ch);
if (Guessed[ch - 'a'])
mvprintw(MESGY, MESGX, "Already guessed '%c'", ch);
else
break;
}
else if (ch == CTRL('D'))
die();
else
mvprintw(MESGY, MESGX, "Not a valid guess: '%s'",
unctrl(ch));
}
leaveok(stdscr, TRUE);
move(MESGY, MESGX);
clrtoeol();
Guessed[ch - 'a'] = TRUE;
correct = FALSE;
for (i = 0; Word[i] != '\0'; i++)
if (Word[i] == ch) {
Known[i] = ch;
correct = TRUE;
}
if (!correct)
Errors++;
}
/*
* readch;
* Read a character from the input
*/
readch()
{
register int cnt, r;
auto char ch;
cnt = 0;
for (;;) {
if (read(0, &ch, sizeof ch) <= 0)
{
if (++cnt > 100)
die();
}
else if (ch == CTRL('L')) {
wrefresh(curscr);
mvcur(0, 0, curscr->_cury, curscr->_curx);
}
else
return ch;
}
}
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.