|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1983 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * Redistribution and use in source and binary forms are permitted ! 6: * provided that: (1) source distributions retain this entire copyright ! 7: * notice and comment, and (2) distributions including binaries display ! 8: * the following acknowledgement: ``This product includes software ! 9: * developed by the University of California, Berkeley and its contributors'' ! 10: * in the documentation or other materials provided with the distribution ! 11: * and in all advertising materials mentioning features or use of this ! 12: * software. Neither the name of the University nor the names of its ! 13: * contributors may be used to endorse or promote products derived ! 14: * from this software without specific prior written permission. ! 15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 16: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 17: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 18: */ ! 19: ! 20: #ifndef lint ! 21: static char sccsid[] = "@(#)endgame.c 5.3 (Berkeley) 6/1/90"; ! 22: #endif /* not lint */ ! 23: ! 24: # include "hangman.h" ! 25: ! 26: /* ! 27: * endgame: ! 28: * Do what's necessary at the end of the game ! 29: */ ! 30: endgame() ! 31: { ! 32: register char ch; ! 33: ! 34: prman(); ! 35: if (Errors >= MAXERRS) ! 36: Errors = MAXERRS + 2; ! 37: prword(); ! 38: prdata(); ! 39: move(MESGY, MESGX); ! 40: if (Errors > MAXERRS) ! 41: printw("Sorry, the word was \"%s\"\n", Word); ! 42: else ! 43: printw("You got it!\n"); ! 44: ! 45: for (;;) { ! 46: mvaddstr(MESGY + 1, MESGX, "Another word? "); ! 47: leaveok(stdscr, FALSE); ! 48: refresh(); ! 49: if ((ch = readch()) == 'n') ! 50: die(); ! 51: else if (ch == 'y') ! 52: break; ! 53: mvaddstr(MESGY + 2, MESGX, "Please type 'y' or 'n'"); ! 54: } ! 55: ! 56: leaveok(stdscr, TRUE); ! 57: move(MESGY, MESGX); ! 58: addstr("\n\n\n"); ! 59: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.