-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathserver_test.go
84 lines (71 loc) · 1.37 KB
/
server_test.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
package main
import (
"testing"
)
func TestShuffle(t *testing.T) {
// Arrange
testlist := map[string]int{
"a": 1, "b": 2, "c": 1,
}
// Act
result := Shuffle(testlist)
// Assert
if len(result) != 4 {
t.Fail()
}
// Check all cards are present
rc := map[string]int{
"a": 0, "b": 0, "c": 0,
}
for _, cardid := range result {
for k := range rc {
if k == cardid {
rc[k]++
}
}
}
if rc["a"] != 1 || rc["b"] != 2 || rc["c"] != 1 {
t.Log("Result card count is wrong")
}
}
type dummyStrategy struct {
}
func (ds dummyStrategy) MainPhase(previousState *PlayerState) []PlayerState {
if len(previousState.boardUntapped) == 0 {
playA := previousState.Clone()
playA.PlayCard("a", false)
playB := previousState.Clone()
playB.PlayCard("b", false)
result := []PlayerState{
*playA, *playB,
}
return result
}
result := []PlayerState{
*previousState,
}
return result
}
func (ds dummyStrategy) DiscardPhase(previousState *PlayerState) []PlayerState {
result := []PlayerState{
*previousState,
}
return result
}
func TestPlay(t *testing.T) {
// Arrange
testlist := []string{
"a", "b", "c", "a", "b", "c", "a", "b", "c", "a", "b", "c",
}
ti := engine{
ps: dummyStrategy{},
as: nil,
}
// Act
result := ti.PlayPermutations(testlist, 3)
// Assert
if len(result) != 4 {
t.Log("Unexpected player state mutation result")
t.Fail()
}
}