cribbage/cards.c

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