-
Notifications
You must be signed in to change notification settings - Fork 0
/
CharGridTest.java
190 lines (163 loc) · 4.92 KB
/
CharGridTest.java
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
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
// Test cases for CharGrid -- a few basic tests are provided.
import junit.framework.TestCase;
public class CharGridTest extends TestCase {
public void testCharArea1() {
char[][] grid = new char[][] {
{'a', 'y', ' '},
{'x', 'a', 'z'},
};
CharGrid cg = new CharGrid(grid);
assertEquals(4, cg.charArea('a'));
assertEquals(1, cg.charArea('z'));
}
public void testCharArea2() {
char[][] grid = new char[][] {
{'c', 'a', ' '},
{'b', ' ', 'b'},
{' ', ' ', 'a'}
};
CharGrid cg = new CharGrid(grid);
assertEquals(6, cg.charArea('a'));
assertEquals(3, cg.charArea('b'));
assertEquals(1, cg.charArea('c'));
}
//empty grid
public void testCharArea3() {
char[][] grid = new char[][] {
};
CharGrid cg = new CharGrid(grid);
assertEquals(0, cg.charArea('a'));
assertEquals(0, cg.charArea('b'));
assertEquals(0, cg.charArea('c'));
}
// chars not in grid
public void testCharArea4() {
char[][] grid = new char[][] {
{'c', 'a', ' '},
{'b', ' ', 'b'},
{' ', ' ', 'a'}
};
CharGrid cg = new CharGrid(grid);
assertEquals(0, cg.charArea('z'));
assertEquals(0, cg.charArea('p'));
assertEquals(0, cg.charArea('j'));
}
// Area equals whole grid
public void testCharArea5(){
char[][] grid = new char[][] {
{'c', 'a', 'b'},
{'b', 'a', 'b'},
{'c', 'b', 'c'}
};
CharGrid cg = new CharGrid(grid);
assertEquals(9, cg.charArea('b'));
assertEquals(9, cg.charArea('b'));
assertEquals(9, cg.charArea('b'));
}
// test from handouts
public void testPlus0() {
char[][] grid = new char[][] {
{' ', ' ', 'p', ' ', ' ', ' ', ' ', ' ', ' '},
{' ', ' ', 'p', ' ', ' ', ' ', ' ', 'x', ' '},
{'p', 'p', 'p', 'p', 'p', ' ', 'x', 'x', 'x'},
{' ', ' ', 'p', ' ', ' ', 'y', ' ', 'x', ' '},
{' ', ' ', 'p', ' ', 'y', 'y', 'y', ' ', ' '},
{'z', 'z', 'z', 'z', ' ', 'y', 'z', 'z', 'z'},
{' ', 'p', 'x', 'x', ' ', 'y', ' ', ' ', ' '}
};
CharGrid cg = new CharGrid(grid);
assertEquals(2, cg.countPlus());
}
// One large plus
public void testPlus1() {
char[][] grid = new char[][] {
{'c', 'a', 'd'},
{'a', 'a', 'a'},
{' ', 'a', 'c'}
};
CharGrid cg = new CharGrid(grid);
assertEquals(1, cg.countPlus());
}
//small plus in grid
public void testPlus2() {
char[][] grid = new char[][] {
{'c', 'a', 'd', 'd'},
{'a', 'a', 'a', 'h'},
{' ', 'a', 'c', 'f'}
};
CharGrid cg = new CharGrid(grid);
assertEquals(1, cg.countPlus());
}
// no plus
public void testPlus3() {
char[][] grid = new char[][] {
{'c', 'a', 'd', 'd'},
{'a', 'j', 'a', 'h'},
{' ', 'a', 'c', 'f'}
};
CharGrid cg = new CharGrid(grid);
assertEquals(0, cg.countPlus());
}
//pluses with no interception
//pluses with ' ', '1', 'b' (upper right corner), '0'
public void testPlus4() {
char[][] grid = new char[][] {
{'b', ' ', ' ', 'b', 'b', 'b'},
{' ', ' ', ' ', 'b', 'b', 'b'},
{'b', ' ', 'l', '1', 'b', 'b'},
{'b', 'l', 'l', 'l', '0', 'b'},
{'b', 'b', 'l', '0', '0', '0'},
{'b', 'b', 'b', '0', '0', 'b'}
};
CharGrid cg = new CharGrid(grid);
assertEquals(4, cg.countPlus());
}
//pluses with no interception larger grid
//pluses with 'a', ' ', '5', '4', '3', '2'
public void testPlus5() {
char[][] grid = new char[][] {
{' ', ' ', 'a', ' ', ' ', ' ', ' ', ' '},
{' ', ' ', 'a', '1', '1', ' ', ' ', ' '},
{'a', 'a', 'a', 'a', 'a', ' ', ' ', ' '},
{' ', ' ', 'a', 'a', ' ', ' ', '1', ' '},
{' ', '6', 'a', 'a', 'a', '5', ' ', ' '},
{'6', '6', '6', 'a', ' ', '5', ' ', ' '},
{' ', '6', ' ', '5', '5', '5', '5', '5'},
{' ', '6', '7', ' ', ' ', '5', ' ', ' '},
{'7', '7', '7', '7', '7', '5', ' ', ' '},
{' ', ' ', '7', '4', ' ', ' ', ' ', ' '},
{' ', '3', '4', '4', '4', ' ', '2', ' '},
{'3', '3', '3', '4', ' ', '2', '2', '2'},
{' ', '3', ' ', ' ', ' ', ' ', '2', ' '}
};
CharGrid cg = new CharGrid(grid);
assertEquals(6, cg.countPlus());
}
//pluses with interception
//pluses with 'a', ' ', '5', '4', '3', '2'
public void testPlus6() {
char[][] grid = new char[][] {
{' ', ' ', ' ', '1', ' ', '1', ' ', ' ', '1', ' '},
{' ', ' ', '1', '1', '1', '1', ' ', '1', '1', '1'},
{' ', ' ', ' ', '1', ' ', '1', ' ', ' ', '1', ' '},
{'1', '1', '1', '1', '1', '1', '1', ' ', ' ', ' '},
{' ', '1', '1', '1', '1', '1', '1', '1', '1', '1'},
{' ', ' ', ' ', '1', ' ', '1', ' ', ' ', ' ', ' '},
{' ', ' ', ' ', '1', ' ', '1', ' ', ' ', ' ', ' '},
{' ', ' ', '1', ' ', ' ', '1', '1', ' ', ' ', ' '},
{' ', ' ', ' ', ' ', ' ', '1', '1', '1', ' ', ' '},
{' ', '1', ' ', ' ', ' ', ' ', '1', '1', '1', ' '},
{'1', '1', '1', ' ', ' ', ' ', ' ', '1', ' ', ' '},
{' ', '1', ' ', ' ', ' ', ' ', ' ', ' ', ' ', ' '}
};
CharGrid cg = new CharGrid(grid);
assertEquals(6, cg.countPlus());
}
//empty grid
public void testPlus7() {
char[][] grid = new char[][] {
};
CharGrid cg = new CharGrid(grid);
assertEquals(0, cg.countPlus());
}
}