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.2 2003/06/17 04:25:23 dillon Exp $ 36 */ 37 38 #include <curses.h> 39 #include <stdio.h> 40 #include <stdlib.h> 41 #include <time.h> 42 43 #include "deck.h" 44 #include "cribbage.h" 45 46 47 /* 48 * Initialize a deck of cards to contain one of each type. 49 */ 50 void 51 makedeck(d) 52 CARD d[]; 53 { 54 int i, j, k; 55 56 srandomdev(); 57 k = 0; 58 for (i = 0; i < RANKS; i++) 59 for (j = 0; j < SUITS; j++) { 60 d[k].suit = j; 61 d[k++].rank = i; 62 } 63 } 64 65 /* 66 * Given a deck of cards, shuffle it -- i.e. randomize it 67 * see Knuth, vol. 2, page 125. 68 */ 69 void 70 shuffle(d) 71 CARD d[]; 72 { 73 int j, k; 74 CARD c; 75 76 for (j = CARDS; j > 0; --j) { 77 k = random() % j; /* random 0 <= k < j */ 78 c = d[j - 1]; /* exchange (j - 1) and k */ 79 d[j - 1] = d[k]; 80 d[k] = c; 81 } 82 } 83 84 /* 85 * return true if the two cards are equal... 86 */ 87 int 88 eq(a, b) 89 CARD a, b; 90 { 91 return ((a.rank == b.rank) && (a.suit == b.suit)); 92 } 93 94 /* 95 * isone returns TRUE if a is in the set of cards b 96 */ 97 int 98 isone(a, b, n) 99 CARD a, b[]; 100 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 114 cremove(a, d, n) 115 CARD a, d[]; 116 int n; 117 { 118 int i, j; 119 120 for (i = j = 0; i < n; i++) 121 if (!eq(a, d[i])) 122 d[j++] = d[i]; 123 if (j < n) 124 d[j].suit = d[j].rank = EMPTY; 125 } 126 127 /* 128 * sorthand: 129 * Sort a hand of n cards 130 */ 131 void 132 sorthand(h, n) 133 CARD h[]; 134 int n; 135 { 136 CARD *cp, *endp; 137 CARD c; 138 139 for (endp = &h[n]; h < endp - 1; h++) 140 for (cp = h + 1; cp < endp; cp++) 141 if ((cp->rank < h->rank) || 142 (cp->rank == h->rank && cp->suit < h->suit)) { 143 c = *h; 144 *h = *cp; 145 *cp = c; 146 } 147 } 148