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