* Copyright (c) 1980 Regents of the University of California.
* All rights reserved. The Berkeley software License Agreement
* specifies the terms and conditions for redistribution.
static char sccsid
[] = "@(#)cards.c 5.1 (Berkeley) %G%";
* initialize a deck of cards to contain one of each type
i
= ( (i
&0xff) << 8 ) | ( (i
>> 8)&0xff ) | 1;
for( i
= 0; i
< RANKS
; i
++ ) {
for( j
= 0; j
< SUITS
; j
++ ) {
* given a deck of cards, shuffle it -- i.e. randomize it
* see Knuth, vol. 2, page 125
for( j
= CARDS
; j
> 0; --j
) {
k
= ( rand() >> 4 ) % j
; /* random 0 <= k < j */
c
= d
[j
- 1]; /* exchange (j - 1) and k */
* return true if the two cards are equal...
return( ( a
.rank
== b
.rank
) && ( a
.suit
== b
.suit
) );
* isone returns TRUE if a is in the set of cards b
for( i
= 0; i
< n
; i
++ ) {
if( eq( a
, b
[i
] ) ) return( TRUE
);
* remove the card a from the deck d of n cards
for( i
= 0; i
< n
; i
++ ) {
if( !eq( a
, d
[i
] ) ) d
[j
++] = d
[i
];
if( j
< n
) d
[j
].suit
= d
[j
].rank
= EMPTY
;
register CARD
*cp
, *endp
;
for (endp
= &h
[n
]; h
< endp
- 1; h
++)
for (cp
= h
+ 1; cp
< endp
; cp
++)
if ((cp
->rank
< h
->rank
) ||
(cp
->rank
== h
->rank
&& cp
->suit
< h
->suit
)) {