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