blob: ff9b7ad5d8cf6f9afb66ad8b567d26500a688546 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
|
;;; model.lisp - 2025-02-14
;; Copyright (C) 2025 Aryadev Chavali
;; This program is distributed in the hope that it will be useful, but WITHOUT
;; ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
;; FOR A PARTICULAR PURPOSE. See the GNU General Public License Version 2 for
;; details.
;; You may distribute and modify this code under the terms of the GNU General
;; Public License Version 2, which you should have received a copy of along with
;; this program. If not, please go to <https://www.gnu.org/licenses/>.
;;; Commentary:
;; Model of cards and sets of cards in Lisp.
;;; Code:
(in-package :cantedraw.model)
(deftype rank ()
`(or (member :Jack :Queen :King :Ace)
(integer 2 10)))
(deftype suit ()
`(member :Diamonds :Clubs :Hearts :Spades :Joker))
(deftype card () `(cons rank suit))
(deftype int-card () `(integer 0 51))
(fn cardsetp (lst) (-> (list) boolean)
(every #'(lambda (x) (typep x 'card)) lst))
(deftype cardset () `(and list (satisfies cardsetp)))
(fn int->suit (n) (-> (int-card) suit)
(case (floor n 13)
(0 :Diamonds)
(1 :Clubs)
(2 :Hearts)
(3 :Spades)
(t :Joker)))
(fn suit->int (item) (-> (suit) (integer 0 4))
(case item
(:Diamonds 0)
(:Clubs 1)
(:Hearts 2)
(:Spades 3)
(t 4)))
(fn int->rank (n) (-> (int-card) rank)
(let ((n (mod n 13)))
(case n
(9 :Jack)
(10 :Queen)
(11 :King)
(12 :Ace)
(t (+ n 2)))))
(fn rank->int (rank) (-> (rank) (integer 0 12))
(case rank
(:Jack 9)
(:Queen 10)
(:King 11)
(:Ace 12)
(t (- rank 2))))
(fn int->card (num) (-> (int-card) card)
(cons (int->rank num)
(int->suit num)))
(fn card->int (card) (-> (card) int-card)
(destructuring-bind (rank . suit) card
(->> (suit->int suit)
(* 13)
(+ (rank->int rank)))))
(fn suit< (s1 s2) (-> (suit suit) boolean)
(< (suit->int s1) (suit->int s2)))
(fn rank< (r1 r2) (-> (rank rank) boolean)
(< (rank->int r1) (rank->int r2)))
(fn card< (c1 c2) (-> (card card) boolean)
(destructuring-bind ((r1 . s1) (r2 . s2)) (list c1 c2)
(cond
;; Check for jokers!
((and (eq s1 :Joker)
(eq s2 :Joker))
(rank< r1 r2))
((eq s1 :Joker) nil)
((eq s2 :Joker) t)
((eq r1 r2) (suit< s1 s2))
(t (rank< r1 r2)))))
(fn suit->str (suit) (-> (suit) string)
(case suit
(:Diamonds "◆")
(:Clubs "♣")
(:Hearts "♥")
(:Spades "♠")
(t "Joker")))
(fn rank->str (rank) (-> (rank) string)
(case rank
(:Ace "Ace")
(:Jack "Jack")
(:Queen "Queen")
(:King "King")
(t (format nil "~a" rank))))
(fn card->str (card) (-> (card) string)
(destructuring-bind (rank . suit) card
(if (eq suit :Joker)
"Joker"
(format nil "~a[~a]"
(rank->str rank)
(suit->str suit)))))
(fn cardset->str (cardset) (-> (cardset) string)
(->> cardset
(mapcar #'card->str)
(format nil "~{~a~^, ~}")))
(fn make-joker (&optional (rank :ACE)) (-> (&optional rank) card)
(cons rank :Joker))
(fn make-deck (&optional (n 1)) (-> (&optional fixnum) cardset)
(append
(loop :for _ :from 1 :to n
:nconc (loop :for j :from 1 :to 52
collect (int->card (1- j))))
(mapcar ($ int->rank make-joker)
(range 0 (* 2 n)))))
|
