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