cribbage/cards.c

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