Home | History | Annotate | Line # | Download | only in cribbage
cards.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[] = "@(#)cards.c	5.5 (Berkeley) 2/28/91";
     36  1.1  cgd #endif /* not lint */
     37  1.1  cgd 
     38  1.1  cgd #include	<stdio.h>
     39  1.1  cgd #include	"deck.h"
     40  1.1  cgd 
     41  1.1  cgd 
     42  1.1  cgd /*
     43  1.1  cgd  * initialize a deck of cards to contain one of each type
     44  1.1  cgd  */
     45  1.1  cgd 
     46  1.1  cgd makedeck( d )
     47  1.1  cgd 
     48  1.1  cgd     CARD	d[];
     49  1.1  cgd {
     50  1.1  cgd 	register  int		i, j, k;
     51  1.1  cgd 	long			time();
     52  1.1  cgd 
     53  1.1  cgd 	i = time( (long *) 0 );
     54  1.1  cgd 	i = ( (i&0xff) << 8 ) | ( (i >> 8)&0xff ) | 1;
     55  1.1  cgd 	srand( i );
     56  1.1  cgd 	k = 0;
     57  1.1  cgd 	for( i = 0; i < RANKS; i++ )  {
     58  1.1  cgd 	    for( j = 0; j < SUITS; j++ )  {
     59  1.1  cgd 		d[k].suit = j;
     60  1.1  cgd 		d[k++].rank = i;
     61  1.1  cgd 	    }
     62  1.1  cgd 	}
     63  1.1  cgd }
     64  1.1  cgd 
     65  1.1  cgd 
     66  1.1  cgd 
     67  1.1  cgd /*
     68  1.1  cgd  * given a deck of cards, shuffle it -- i.e. randomize it
     69  1.1  cgd  * see Knuth, vol. 2, page 125
     70  1.1  cgd  */
     71  1.1  cgd 
     72  1.1  cgd shuffle( d )
     73  1.1  cgd 
     74  1.1  cgd     CARD	d[];
     75  1.1  cgd {
     76  1.1  cgd 	register  int		j, k;
     77  1.1  cgd 	CARD			c;
     78  1.1  cgd 
     79  1.1  cgd 	for( j = CARDS; j > 0; --j )  {
     80  1.1  cgd 	    k = ( rand() >> 4 ) % j;		/* random 0 <= k < j */
     81  1.1  cgd 	    c = d[j - 1];			/* exchange (j - 1) and k */
     82  1.1  cgd 	    d[j - 1] = d[k];
     83  1.1  cgd 	    d[k] = c;
     84  1.1  cgd 	}
     85  1.1  cgd }
     86  1.1  cgd 
     87  1.1  cgd 
     88  1.1  cgd 
     89  1.1  cgd /*
     90  1.1  cgd  * return true if the two cards are equal...
     91  1.1  cgd  */
     92  1.1  cgd 
     93  1.1  cgd eq( a, b )
     94  1.1  cgd 
     95  1.1  cgd     CARD		a, b;
     96  1.1  cgd {
     97  1.1  cgd 	return(  ( a.rank == b.rank )  &&  ( a.suit == b.suit )  );
     98  1.1  cgd }
     99  1.1  cgd 
    100  1.1  cgd 
    101  1.1  cgd 
    102  1.1  cgd /*
    103  1.1  cgd  * isone returns TRUE if a is in the set of cards b
    104  1.1  cgd  */
    105  1.1  cgd 
    106  1.1  cgd isone( a, b, n )
    107  1.1  cgd 
    108  1.1  cgd     CARD		a, b[];
    109  1.1  cgd     int			n;
    110  1.1  cgd {
    111  1.1  cgd 	register  int		i;
    112  1.1  cgd 
    113  1.1  cgd 	for( i = 0; i < n; i++ )  {
    114  1.1  cgd 	    if(  eq( a, b[i] )   )  return( TRUE );
    115  1.1  cgd 	}
    116  1.1  cgd 	return( FALSE );
    117  1.1  cgd }
    118  1.1  cgd 
    119  1.1  cgd 
    120  1.1  cgd 
    121  1.1  cgd /*
    122  1.1  cgd  * remove the card a from the deck d of n cards
    123  1.1  cgd  */
    124  1.1  cgd 
    125  1.1  cgd cremove( a, d, n )
    126  1.1  cgd 
    127  1.1  cgd     CARD		a, d[];
    128  1.1  cgd     int			n;
    129  1.1  cgd {
    130  1.1  cgd 	register  int		i, j;
    131  1.1  cgd 
    132  1.1  cgd 	j = 0;
    133  1.1  cgd 	for( i = 0; i < n; i++ )  {
    134  1.1  cgd 	    if(  !eq( a, d[i] )  )  d[j++] = d[i];
    135  1.1  cgd 	}
    136  1.1  cgd 	if(  j < n  )  d[j].suit = d[j].rank = EMPTY;
    137  1.1  cgd }
    138  1.1  cgd 
    139  1.1  cgd 
    140  1.1  cgd 
    141  1.1  cgd /*
    142  1.1  cgd  * sorthand:
    143  1.1  cgd  *	Sort a hand of n cards
    144  1.1  cgd  */
    145  1.1  cgd sorthand(h, n)
    146  1.1  cgd register CARD		h[];
    147  1.1  cgd int			n;
    148  1.1  cgd {
    149  1.1  cgd 	register CARD		*cp, *endp;
    150  1.1  cgd 	CARD			c;
    151  1.1  cgd 
    152  1.1  cgd 	for (endp = &h[n]; h < endp - 1; h++)
    153  1.1  cgd 	    for (cp = h + 1; cp < endp; cp++)
    154  1.1  cgd 		if ((cp->rank < h->rank) ||
    155  1.1  cgd 		     (cp->rank == h->rank && cp->suit < h->suit)) {
    156  1.1  cgd 		    c = *h;
    157  1.1  cgd 		    *h = *cp;
    158  1.1  cgd 		    *cp = c;
    159  1.1  cgd 		}
    160  1.1  cgd }
    161  1.1  cgd 
    162