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. Neither the name of the University nor the names of its contributors
  14  *    may be used to endorse or promote products derived from this software
  15  *    without specific prior written permission.
  16  *
  17  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  18  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  19  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  20  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  21  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  22  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  23  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  24  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  25  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  26  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  27  * SUCH DAMAGE.
  28  *
  29  * @(#)cards.c  8.1 (Berkeley) 5/31/93
  30  * $FreeBSD: src/games/cribbage/cards.c,v 1.5 1999/11/30 03:48:44 billf Exp $
  31  * $DragonFly: src/games/cribbage/cards.c,v 1.3 2005/08/03 13:31:00 eirikn Exp $
  32  */
  33
  34 #include <curses.h>
  35 #include <stdlib.h>
  36
  37 #include "deck.h"
  38 #include "cribbage.h"
  39
  40 /*
  41  * Initialize a deck of cards to contain one of each type.
  42  */
  43 void
  44 makedeck(CARD d[])
  45 {
  46         int i, j, k;
  47
  48         srandomdev();
  49         k = 0;
  50         for (i = 0; i < RANKS; i++)
  51                 for (j = 0; j < SUITS; j++) {
  52                         d[k].suit = j;
  53                         d[k++].rank = i;
  54                 }
  55 }
  56
  57 /*
  58  * Given a deck of cards, shuffle it -- i.e. randomize it
  59  * see Knuth, vol. 2, page 125.
  60  */
  61 void
  62 shuffle(CARD d[])
  63 {
  64         int j, k;
  65         CARD c;
  66
  67         for (j = CARDS; j > 0; --j) {
  68                 k = random() % j;               /* random 0 <= k < j */
  69                 c = d[j - 1];                   /* exchange (j - 1) and k */
  70                 d[j - 1] = d[k];
  71                 d[k] = c;
  72         }
  73 }
  74
  75 /*
  76  * return true if the two cards are equal...
  77  */
  78 static bool
  79 eq(CARD a, CARD b)
  80 {
  81         return ((a.rank == b.rank) && (a.suit == b.suit));
  82 }
  83
  84 /*
  85  * isone returns TRUE if a is in the set of cards b
  86  */
  87 bool
  88 isone(CARD a, CARD b[], int n)
  89 {
  90         int i;
  91
  92         for (i = 0; i < n; i++)
  93                 if (eq(a, b[i]))
  94                         return (true);
  95         return (false);
  96 }
  97
  98 /*
  99  * remove the card a from the deck d of n cards
 100  */
 101 void
 102 cremove(CARD a, CARD d[], int n)
 103 {
 104         int i, j;
 105
 106         for (i = j = 0; i < n; i++)
 107                 if (!eq(a, d[i]))
 108                         d[j++] = d[i];
 109         if (j < n)
 110                 d[j].suit = d[j].rank = EMPTY;
 111 }
 112
 113 /*
 114  * sorthand:
 115  *      Sort a hand of n cards
 116  */
 117 void
 118 sorthand(CARD h[], int n)
 119 {
 120         CARD *cp, *endp;
 121         CARD c;
 122
 123         for (endp = &h[n]; h < endp - 1; h++)
 124                 for (cp = h + 1; cp < endp; cp++)
 125                         if ((cp->rank < h->rank) ||
 126                             (cp->rank == h->rank && cp->suit < h->suit)) {
 127                                 c = *h;
 128                                 *h = *cp;
 129                                 *cp = c;
 130                         }
 131 }