Home | History | Annotate | Line # | Download | only in monop
print.c revision 1.1
      1  1.1  cgd /*
      2  1.1  cgd  * Copyright (c) 1980 Regents of the University of California.
      3  1.1  cgd  * All rights reserved.
      4  1.1  cgd  *
      5  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      6  1.1  cgd  * modification, are permitted provided that the following conditions
      7  1.1  cgd  * are met:
      8  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
      9  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     10  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     11  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     12  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     13  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     14  1.1  cgd  *    must display the following acknowledgement:
     15  1.1  cgd  *	This product includes software developed by the University of
     16  1.1  cgd  *	California, Berkeley and its contributors.
     17  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     18  1.1  cgd  *    may be used to endorse or promote products derived from this software
     19  1.1  cgd  *    without specific prior written permission.
     20  1.1  cgd  *
     21  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  1.1  cgd  * SUCH DAMAGE.
     32  1.1  cgd  */
     33  1.1  cgd 
     34  1.1  cgd #ifndef lint
     35  1.1  cgd static char sccsid[] = "@(#)print.c	5.4 (Berkeley) 6/1/90";
     36  1.1  cgd #endif /* not lint */
     37  1.1  cgd 
     38  1.1  cgd # include	"monop.ext"
     39  1.1  cgd 
     40  1.1  cgd static char	buf[80],		/* output buffer		*/
     41  1.1  cgd 		*header	= "Name      Own      Price Mg # Rent";
     42  1.1  cgd 
     43  1.1  cgd /*
     44  1.1  cgd  *	This routine prints out the current board
     45  1.1  cgd  */
     46  1.1  cgd printboard() {
     47  1.1  cgd 
     48  1.1  cgd 	reg int	i;
     49  1.1  cgd 
     50  1.1  cgd 	printf("%s\t%s\n", header, header);
     51  1.1  cgd 	for (i = 0; i < N_SQRS/2; i++) {
     52  1.1  cgd 		printsq(i, FALSE);
     53  1.1  cgd 		putchar('\t');
     54  1.1  cgd 		printsq(i+N_SQRS/2, TRUE);
     55  1.1  cgd 	}
     56  1.1  cgd }
     57  1.1  cgd /*
     58  1.1  cgd  *	This routine lists where each player is.
     59  1.1  cgd  */
     60  1.1  cgd where() {
     61  1.1  cgd 
     62  1.1  cgd 	reg int	i;
     63  1.1  cgd 	char	*bsp;
     64  1.1  cgd 
     65  1.1  cgd 	printf("%s Player\n", header);
     66  1.1  cgd 	for (i = 0; i < num_play; i++) {
     67  1.1  cgd 		printsq(play[i].loc, FALSE);
     68  1.1  cgd 		printf(" %s (%d)", play[i].name, i+1);
     69  1.1  cgd 		if (cur_p == &play[i])
     70  1.1  cgd 			printf(" *");
     71  1.1  cgd 		putchar('\n');
     72  1.1  cgd 	}
     73  1.1  cgd }
     74  1.1  cgd /*
     75  1.1  cgd  *	This routine prints out an individual square
     76  1.1  cgd  */
     77  1.1  cgd printsq(sqn, eoln)
     78  1.1  cgd int		sqn;
     79  1.1  cgd reg bool	eoln; {
     80  1.1  cgd 
     81  1.1  cgd 	reg int		rnt;
     82  1.1  cgd 	reg PROP	*pp;
     83  1.1  cgd 	reg SQUARE	*sqp;
     84  1.1  cgd 	int		i;
     85  1.1  cgd 
     86  1.1  cgd 	sqp = &board[sqn];
     87  1.1  cgd 	printf("%-10.10s", sqp->name);
     88  1.1  cgd 	switch (sqp->type) {
     89  1.1  cgd 	  case SAFE:
     90  1.1  cgd 	  case CC:
     91  1.1  cgd 	  case CHANCE:
     92  1.1  cgd 	  case INC_TAX:
     93  1.1  cgd 	  case GOTO_J:
     94  1.1  cgd 	  case LUX_TAX:
     95  1.1  cgd 	  case IN_JAIL:
     96  1.1  cgd spec:
     97  1.1  cgd 		if (!eoln)
     98  1.1  cgd 			printf("                        ");
     99  1.1  cgd 		break;
    100  1.1  cgd 	  case PRPTY:
    101  1.1  cgd 		pp = sqp->desc;
    102  1.1  cgd 		if (sqp->owner < 0) {
    103  1.1  cgd 			printf(" - %-8.8s %3d", pp->mon_desc->name, sqp->cost);
    104  1.1  cgd 			if (!eoln)
    105  1.1  cgd 				printf("         ");
    106  1.1  cgd 			break;
    107  1.1  cgd 		}
    108  1.1  cgd 		printf(" %d %-8.8s %3d", sqp->owner+1, pp->mon_desc->name,
    109  1.1  cgd 			sqp->cost);
    110  1.1  cgd 		printmorg(sqp);
    111  1.1  cgd 		if (pp->monop) {
    112  1.1  cgd 			if (pp->houses < 5)
    113  1.1  cgd 				if (pp->houses > 0)
    114  1.1  cgd 					printf("%d %4d", pp->houses,
    115  1.1  cgd 						pp->rent[pp->houses]);
    116  1.1  cgd 				else
    117  1.1  cgd 					printf("0 %4d", pp->rent[0] * 2);
    118  1.1  cgd 			else
    119  1.1  cgd 				printf("H %4d", pp->rent[5]);
    120  1.1  cgd 		}
    121  1.1  cgd 		else
    122  1.1  cgd 			printf("  %4d", pp->rent[0]);
    123  1.1  cgd 		break;
    124  1.1  cgd 	  case UTIL:
    125  1.1  cgd 		if (sqp->owner < 0) {
    126  1.1  cgd 			printf(" -          150");
    127  1.1  cgd 			if (!eoln)
    128  1.1  cgd 				printf("         ");
    129  1.1  cgd 			break;
    130  1.1  cgd 		}
    131  1.1  cgd 		printf(" %d          150", sqp->owner+1);
    132  1.1  cgd 		printmorg(sqp);
    133  1.1  cgd 		printf("%d", play[sqp->owner].num_util);
    134  1.1  cgd 		if (!eoln)
    135  1.1  cgd 			printf("    ");
    136  1.1  cgd 		break;
    137  1.1  cgd 	  case RR:
    138  1.1  cgd 		if (sqp->owner < 0) {
    139  1.1  cgd 			printf(" - Railroad 200");
    140  1.1  cgd 			if (!eoln)
    141  1.1  cgd 				printf("         ");
    142  1.1  cgd 			break;
    143  1.1  cgd 		}
    144  1.1  cgd 		printf(" %d Railroad 200", sqp->owner+1);
    145  1.1  cgd 		printmorg(sqp);
    146  1.1  cgd 		rnt = 25;
    147  1.1  cgd 		rnt <<= play[sqp->owner].num_rr - 1;
    148  1.1  cgd 		printf("%d %4d", play[sqp->owner].num_rr, 25 << (play[sqp->owner].num_rr - 1));
    149  1.1  cgd 		break;
    150  1.1  cgd 	}
    151  1.1  cgd 	if (eoln)
    152  1.1  cgd 		putchar('\n');
    153  1.1  cgd }
    154  1.1  cgd /*
    155  1.1  cgd  *	This routine prints out the mortgage flag.
    156  1.1  cgd  */
    157  1.1  cgd printmorg(sqp)
    158  1.1  cgd reg SQUARE	*sqp; {
    159  1.1  cgd 
    160  1.1  cgd 	if (sqp->desc->morg)
    161  1.1  cgd 		printf(" * ");
    162  1.1  cgd 	else
    163  1.1  cgd 		printf("   ");
    164  1.1  cgd }
    165  1.1  cgd /*
    166  1.1  cgd  *	This routine lists the holdings of the player given
    167  1.1  cgd  */
    168  1.1  cgd printhold(pl)
    169  1.1  cgd reg int	pl; {
    170  1.1  cgd 
    171  1.1  cgd 	reg OWN		*op;
    172  1.1  cgd 	reg PLAY	*pp;
    173  1.1  cgd 	char		*bsp;
    174  1.1  cgd 
    175  1.1  cgd 	pp = &play[pl];
    176  1.1  cgd 	printf("%s's (%d) holdings (Total worth: $%d):\n", name_list[pl], pl+1,
    177  1.1  cgd 		pp->money + prop_worth(pp));
    178  1.1  cgd 	printf("\t$%d", pp->money);
    179  1.1  cgd 	if (pp->num_gojf) {
    180  1.1  cgd 		printf(", %d get-out-of-jail-free card", pp->num_gojf);
    181  1.1  cgd 		if (pp->num_gojf > 1)
    182  1.1  cgd 			putchar('s');
    183  1.1  cgd 	}
    184  1.1  cgd 	putchar('\n');
    185  1.1  cgd 	if (pp->own_list) {
    186  1.1  cgd 		printf("\t%s\n", header);
    187  1.1  cgd 		for (op = pp->own_list; op; op = op->next) {
    188  1.1  cgd 			putchar('\t');
    189  1.1  cgd 			printsq(sqnum(op->sqr), TRUE);
    190  1.1  cgd 		}
    191  1.1  cgd 	}
    192  1.1  cgd }
    193