-
Notifications
You must be signed in to change notification settings - Fork 0
/
card.go
155 lines (130 loc) · 2.31 KB
/
card.go
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
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
//go:generate stringer -type=Suit,Rank
package shuffle
import (
"fmt"
"math/rand"
"sort"
"time"
)
//Suit type
type Suit uint8
const (
Spade Suit = iota
Diamond
Club
Heart
Joker // special case
)
var suits = [...]Suit{Spade, Diamond, Club, Heart}
//Rank type
type Rank uint8
const (
_ Rank = iota
Ace
Two
Three
Four
Five
Six
Seven
Eight
Nine
Ten
Jack
Queen
King
)
const (
minRank = Ace
maxRank = King
)
//Card struct
type Card struct {
Suit
Rank
}
func (c Card) String() string {
if c.Suit == Joker {
return c.Suit.String()
}
return fmt.Sprintf("%s of %ss", c.Rank.String(), c.Suit.String())
}
//New func
func New(opts ...func([]Card) []Card) []Card {
var cards []Card
for _, suit := range suits {
for rank := minRank; rank <= maxRank; rank++ {
cards = append(cards, Card{Suit: suit, Rank: rank})
}
}
for _, opt := range opts {
cards = opt(cards)
}
return cards
}
//DefaultSort func
func DefaultSort(cards []Card) []Card {
sort.Slice(cards, Less(cards))
return cards
}
//Less func
func Less(cards []Card) func(i, j int) bool {
return func(i, j int) bool {
return absRank(cards[i]) < absRank(cards[j])
}
}
//Sort func : Custom
func Sort(less func(cards []Card) func(i, j int) bool) func([]Card) []Card {
return func(cards []Card) []Card {
sort.Slice(cards, less(cards))
return cards
}
}
func absRank(c Card) int {
return int(c.Suit)*int(maxRank) + int(c.Rank)
}
//Shuffle func
func Shuffle(cards []Card) []Card {
newCards := make([]Card, len(cards))
r := rand.New(rand.NewSource(time.Now().Unix()))
perm := r.Perm(len(cards))
// perm = [0,1,4,2,3]
for i, j := range perm {
newCards[i] = cards[j]
}
return newCards
}
// Jokers func
func Jokers(n int) func([]Card) []Card {
return func(cards []Card) []Card {
for i := 0; i < n; i++ {
cards = append(cards, Card{
Rank: Rank(i),
Suit: Joker,
})
}
return cards
}
}
//Filter func
func Filter(f func(card Card) bool) func([]Card) []Card {
return func(cards []Card) []Card {
var filtered []Card
for _, c := range cards {
if !f(c) {
filtered = append(filtered, c)
}
}
return filtered
}
}
// Deck func
func Deck(n int) func([]Card) []Card {
return func(cards []Card) []Card {
var retCards []Card
for i := 0; i < n; i++ {
retCards = append(retCards, cards...)
}
return retCards
}
}