Home | History | Annotate | Line # | Download | only in cribbage
cards.c revision 1.3 
      1 /*	$NetBSD: cards.c,v 1.3 1995/03/21 15:08:41 cgd Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 1980, 1993
      5  *	The Regents of the University of California.  All rights reserved.
      6  *
      7  * Redistribution and use in source and binary forms, with or without
      8  * modification, are permitted provided that the following conditions
      9  * are met:
     10  * 1. Redistributions of source code must retain the above copyright
     11  *    notice, this list of conditions and the following disclaimer.
     12  * 2. Redistributions in binary form must reproduce the above copyright
     13  *    notice, this list of conditions and the following disclaimer in the
     14  *    documentation and/or other materials provided with the distribution.
     15  * 3. All advertising materials mentioning features or use of this software
     16  *    must display the following acknowledgement:
     17  *	This product includes software developed by the University of
     18  *	California, Berkeley and its contributors.
     19  * 4. Neither the name of the University nor the names of its contributors
     20  *    may be used to endorse or promote products derived from this software
     21  *    without specific prior written permission.
     22  *
     23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     33  * SUCH DAMAGE.
     34  */
     35 
     36 #ifndef lint
     37 static char sccsid[] = "@(#)cards.c	8.1 (Berkeley) 5/31/93";
     38 #endif /* not lint */
     39 
     40 #include <curses.h>
     41 #include <stdio.h>
     42 #include <stdlib.h>
     43 #include <time.h>
     44 
     45 #include "deck.h"
     46 #include "cribbage.h"
     47 
     48 
     49 /*
     50  * Initialize a deck of cards to contain one of each type.
     51  */
     52 void
     53 makedeck(d)
     54 	CARD    d[];
     55 {
     56 	register int i, j, k;
     57 
     58 	i = time(NULL);
     59 	i = ((i & 0xff) << 8) | ((i >> 8) & 0xff) | 1;
     60 	srand(i);
     61 	k = 0;
     62 	for (i = 0; i < RANKS; i++)
     63 		for (j = 0; j < SUITS; j++) {
     64 			d[k].suit = j;
     65 			d[k++].rank = i;
     66 		}
     67 }
     68 
     69 /*
     70  * Given a deck of cards, shuffle it -- i.e. randomize it
     71  * see Knuth, vol. 2, page 125.
     72  */
     73 void
     74 shuffle(d)
     75 	CARD d[];
     76 {
     77 	register int j, k;
     78 	CARD c;
     79 
     80 	for (j = CARDS; j > 0; --j) {
     81 		k = (rand() >> 4) % j;		/* random 0 <= k < j */
     82 		c = d[j - 1];			/* exchange (j - 1) and k */
     83 		d[j - 1] = d[k];
     84 		d[k] = c;
     85 	}
     86 }
     87 
     88 /*
     89  * return true if the two cards are equal...
     90  */
     91 int
     92 eq(a, b)
     93 	CARD a, b;
     94 {
     95 	return ((a.rank == b.rank) && (a.suit == b.suit));
     96 }
     97 
     98 /*
     99  * isone returns TRUE if a is in the set of cards b
    100  */
    101 int
    102 isone(a, b, n)
    103 	CARD a, b[];
    104 	int n;
    105 {
    106 	register int i;
    107 
    108 	for (i = 0; i < n; i++)
    109 		if (eq(a, b[i]))
    110 			return (TRUE);
    111 	return (FALSE);
    112 }
    113 
    114 /*
    115  * remove the card a from the deck d of n cards
    116  */
    117 void
    118 cremove(a, d, n)
    119 	CARD a, d[];
    120 	int n;
    121 {
    122 	register int i, j;
    123 
    124 	for (i = j = 0; i < n; i++)
    125 		if (!eq(a, d[i]))
    126 			d[j++] = d[i];
    127 	if (j < n)
    128 		d[j].suit = d[j].rank = EMPTY;
    129 }
    130 
    131 /*
    132  * sorthand:
    133  *	Sort a hand of n cards
    134  */
    135 void
    136 sorthand(h, n)
    137 	register CARD h[];
    138 	int n;
    139 {
    140 	register CARD *cp, *endp;
    141 	CARD c;
    142 
    143 	for (endp = &h[n]; h < endp - 1; h++)
    144 		for (cp = h + 1; cp < endp; cp++)
    145 			if ((cp->rank < h->rank) ||
    146 			    (cp->rank == h->rank && cp->suit < h->suit)) {
    147 				c = *h;
    148 				*h = *cp;
    149 				*cp = c;
    150 			}
    151 }
    152