games/cribbage/cards.c

   1 /*-
   2  * Copyright (c) 1980, 1993
   3  *      The Regents of the University of California.  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  * @(#)cards.c  8.1 (Berkeley) 5/31/93
  34  * $FreeBSD: src/games/cribbage/cards.c,v 1.5 1999/11/30 03:48:44 billf Exp $
  35  * $DragonFly: src/games/cribbage/cards.c,v 1.3 2005/08/03 13:31:00 eirikn Exp $
  36  */
  37
  38 #include <stdlib.h>
  39
  40 #include "cribbage.h"
  41
  42 static bool     eq(CARD, CARD);
  43 /*
  44  * Initialize a deck of cards to contain one of each type.
  45  */
  46 void
  47 makedeck(CARD d[])
  48 {
  49         int i, j, k;
  50
  51         srandomdev();
  52         k = 0;
  53         for (i = 0; i < RANKS; i++)
  54                 for (j = 0; j < SUITS; j++) {
  55                         d[k].suit = j;
  56                         d[k++].rank = i;
  57                 }
  58 }
  59
  60 /*
  61  * Given a deck of cards, shuffle it -- i.e. randomize it
  62  * see Knuth, vol. 2, page 125.
  63  */
  64 void
  65 shuffle(CARD d[])
  66 {
  67         int j, k;
  68         CARD c;
  69
  70         for (j = CARDS; j > 0; --j) {
  71                 k = random() % j;               /* random 0 <= k < j */
  72                 c = d[j - 1];                   /* exchange (j - 1) and k */
  73                 d[j - 1] = d[k];
  74                 d[k] = c;
  75         }
  76 }
  77
  78 /*
  79  * return true if the two cards are equal...
  80  */
  81 static bool
  82 eq(CARD a, CARD b)
  83 {
  84         return ((a.rank == b.rank) && (a.suit == b.suit));
  85 }
  86
  87 /*
  88  * isone returns TRUE if a is in the set of cards b
  89  */
  90 bool
  91 isone(CARD a, CARD b[], int n)
  92 {
  93         int i;
  94
  95         for (i = 0; i < n; i++)
  96                 if (eq(a, b[i]))
  97                         return (true);
  98         return (false);
  99 }
 100
 101 /*
 102  * remove the card a from the deck d of n cards
 103  */
 104 void
 105 cremove(CARD a, CARD d[], int n)
 106 {
 107         int i, j;
 108
 109         for (i = j = 0; i < n; i++)
 110                 if (!eq(a, d[i]))
 111                         d[j++] = d[i];
 112         if (j < n)
 113                 d[j].suit = d[j].rank = EMPTY;
 114 }
 115
 116 /*
 117  * sorthand:
 118  *      Sort a hand of n cards
 119  */
 120 void
 121 sorthand(CARD h[], int n)
 122 {
 123         CARD *cp, *endp;
 124         CARD c;
 125
 126         for (endp = &h[n]; h < endp - 1; h++)
 127                 for (cp = h + 1; cp < endp; cp++)
 128                         if ((cp->rank < h->rank) ||
 129                             (cp->rank == h->rank && cp->suit < h->suit)) {
 130                                 c = *h;
 131                                 *h = *cp;
 132                                 *cp = c;
 133                         }
 134 }