|
|
1.1 ! root 1: /* ! 2: * Copyright (c) 1980 Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * Redistribution and use in source and binary forms are permitted provided ! 6: * that: (1) source distributions retain this entire copyright notice and ! 7: * comment, and (2) distributions including binaries display the following ! 8: * acknowledgement: ``This product includes software developed by the ! 9: * University of California, Berkeley and its contributors'' in the ! 10: * documentation or other materials provided with the distribution and in ! 11: * all advertising materials mentioning features or use of this software. ! 12: * Neither the name of the University nor the names of its contributors may ! 13: * be used to endorse or promote products derived from this software without ! 14: * specific prior written permission. ! 15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED ! 16: * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF ! 17: * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 18: */ ! 19: ! 20: #ifndef lint ! 21: static char sccsid[] = "@(#)getcodi.c 5.4 (Berkeley) 6/1/90"; ! 22: #endif /* not lint */ ! 23: ! 24: # include "getpar.h" ! 25: ! 26: /* ! 27: ** get course and distance ! 28: ** ! 29: ** The user is asked for a course and distance. This is used by ! 30: ** move, impulse, and some of the computer functions. ! 31: ** ! 32: ** The return value is zero for success, one for an invalid input ! 33: ** (meaning to drop the request). ! 34: */ ! 35: ! 36: getcodi(co, di) ! 37: int *co; ! 38: double *di; ! 39: { ! 40: ! 41: *co = getintpar("Course"); ! 42: ! 43: /* course must be in the interval [0, 360] */ ! 44: if (*co < 0 || *co > 360) ! 45: return (1); ! 46: *di = getfltpar("Distance"); ! 47: ! 48: /* distance must be in the interval [0, 15] */ ! 49: if (*di <= 0.0 || *di > 15.0) ! 50: return (1); ! 51: ! 52: /* good return */ ! 53: return (0); ! 54: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.