-
Notifications
You must be signed in to change notification settings - Fork 22
/
infinite_eller_test.go
130 lines (123 loc) · 3.49 KB
/
infinite_eller_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
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
package pacman
import (
"math/rand"
"testing"
"github.com/stretchr/testify/assert"
)
func randSrc() *rand.Rand {
return rand.New(rand.NewSource(1))
}
func TestNewMaze(t *testing.T) {
assert.NotNil(t, NewMaze(10, randSrc()), "Should not be nil.")
}
func TestRows(t *testing.T) {
maze := NewMaze(10, randSrc())
assert.NotNil(t, maze, "Should not be nil.")
assert.Equal(t, 10, maze.Rows(), "Rows should be same")
}
func TestPopulate(t *testing.T) {
result := [][Columns][4]rune{{
[4]rune{'N', '_', 'S', 'W'},
[4]rune{'_', 'E', 'S', '_'},
[4]rune{'_', '_', 'S', 'W'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'_', '_', 'S', '_'},
[4]rune{'_', '_', 'S', '_'},
[4]rune{'_', '_', 'S', '_'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'N', 'E', 'S', '_'},
}, {
[4]rune{'N', '_', 'S', 'W'},
[4]rune{'N', '_', '_', '_'},
[4]rune{'N', '_', '_', '_'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'N', 'E', 'S', '_'},
[4]rune{'N', '_', '_', 'W'},
[4]rune{'N', '_', '_', '_'},
[4]rune{'N', 'E', '_', '_'},
[4]rune{'N', '_', 'S', 'W'},
[4]rune{'N', 'E', 'S', '_'},
}}
maze := NewMaze(2, randSrc())
maze.Populate()
assert.Equal(t, 2, maze.Rows(), "Rows should be same")
assert.Equal(t, result, maze.Get(0, 2), "Should be equal")
}
func TestGrowBy(t *testing.T) {
maze := NewMaze(2, randSrc())
maze.Populate()
result := [][Columns][4]rune{{
[4]rune{'N', '_', 'S', 'W'},
[4]rune{'_', 'E', 'S', '_'},
[4]rune{'_', '_', 'S', 'W'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'_', '_', 'S', '_'},
[4]rune{'_', '_', 'S', '_'},
[4]rune{'_', '_', 'S', '_'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'N', 'E', 'S', '_'},
}, {
[4]rune{'N', '_', 'S', 'W'},
[4]rune{'N', '_', '_', '_'},
[4]rune{'N', '_', '_', '_'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'N', 'E', 'S', '_'},
[4]rune{'N', '_', '_', 'W'},
[4]rune{'N', '_', '_', '_'},
[4]rune{'N', 'E', '_', '_'},
[4]rune{'N', '_', 'S', 'W'},
[4]rune{'N', 'E', 'S', '_'},
}}
assert.Equal(t, 2, maze.Rows(), "Rows should be same")
assert.Equal(t, result, maze.Get(0, 2), "Should be equal")
maze.GrowBy(2)
result = [][Columns][4]rune{{
[4]rune{'N', '_', 'S', 'W'},
[4]rune{'_', 'E', 'S', '_'},
[4]rune{'_', '_', 'S', 'W'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'_', '_', 'S', '_'},
[4]rune{'_', '_', 'S', '_'},
[4]rune{'_', '_', 'S', '_'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'N', 'E', 'S', '_'},
}, {
[4]rune{'_', '_', 'S', 'W'},
[4]rune{'N', '_', '_', '_'},
[4]rune{'N', '_', '_', '_'},
[4]rune{'_', '_', 'S', '_'},
[4]rune{'N', 'E', 'S', '_'},
[4]rune{'_', '_', '_', 'W'},
[4]rune{'N', '_', '_', '_'},
[4]rune{'_', 'E', '_', '_'},
[4]rune{'_', '_', 'S', 'W'},
[4]rune{'N', 'E', 'S', '_'},
}, {
[4]rune{'N', '_', '_', 'W'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'_', '_', '_', '_'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'_', '_', '_', '_'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'N', '_', '_', '_'},
[4]rune{'_', '_', '_', '_'},
[4]rune{'N', 'E', 'S', '_'},
}, {
[4]rune{'N', '_', 'S', 'W'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'N', '_', 'S', '_'},
[4]rune{'N', 'E', '_', '_'},
[4]rune{'N', 'E', 'S', 'W'},
[4]rune{'N', 'E', '_', 'W'},
[4]rune{'N', 'E', 'S', 'W'},
[4]rune{'N', '_', 'S', 'W'},
[4]rune{'N', '_', '_', '_'},
[4]rune{'N', 'E', 'S', '_'},
}}
assert.Equal(t, 4, maze.Rows(), "Rows should be same")
assert.Equal(t, result, maze.Get(0, 4), "Should be equal")
}