HomeSort by: relevance | last modified time | path
    Searched refs:DECK (Results 1 - 4 of 4) sorted by relevancy

  /src/games/monop/
deck.h 1 /* $NetBSD: deck.h,v 1.9 2008/02/24 02:43:18 dholland Exp $ */
31 * @(#)deck.h 8.1 (Berkeley) 5/31/93
40 #define CC_D deck[0]
41 #define CH_D deck[1]
43 struct dk_st { /* deck description structure */
44 int num_cards; /* number of cards in deck */
46 bool gojf_used; /* set if gojf card out of deck */
51 typedef struct dk_st DECK;
53 extern DECK deck[2]
    [all...]
cards.c 44 #include "deck.h"
50 static void set_up(DECK *);
204 * This routine sets up the offset pointers for the given deck.
207 set_up(DECK *dp)
234 * This routine draws a card from the given deck
237 get_card(DECK *dp)
355 * to the bottom of a deck. XXX currently does not return to the correct
356 * deck.
364 DECK *dp;
374 /* Put at bottom of deck (top_card - 1) and remove it from wherever els
    [all...]
monop.c 51 #include "deck.h"
123 DECK deck[2]; /* Chance and Community Chest */ variable in typeref:typename:DECK[2]
execute.c 51 #include "deck.h"
210 deck[i].top_card = 0;
211 deck[i].gojf_used = FALSE;
294 fprintf(outf, "deck %d {\n", i);
295 fprintf(outf, " numcards %d\n", deck[i].num_cards);
296 fprintf(outf, " topcard %d\n", deck[i].top_card);
297 fprintf(outf, " gojf_used %d\n", deck[i].gojf_used);
299 for (j = 0; j < deck[i].num_cards; j++)
300 fprintf(outf, " %d", deck[i].cards[j]);
514 /* deck attributes *
    [all...]

Completed in 29 milliseconds