-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathImmutableQueueTest.java
More file actions
229 lines (208 loc) · 6.34 KB
/
Copy pathImmutableQueueTest.java
File metadata and controls
229 lines (208 loc) · 6.34 KB
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
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
import org.junit.Test;
import org.junit.Assert;
import java.util.*;
public class ImmutableQueueTest {
private static class A {}
private static class B extends A {}
static final A dasA = new A();
static final ImmutableQueue<A> Empty = new ImmutableQueue<A>();
static ImmutableQueue<A> dasQ;
@Test
public void EmptyQueueIsSizeZero() {
Assert.assertEquals(0, Empty.size());
Assert.assertEquals(0, Empty.length);
}
@Test
public void EmptyQueueIsEmpty () {
Assert.assertEquals(true, Empty.isEmpty());
Assert.assertEquals(true, Empty.empty);
}
@Test
public void EmptyQueueCanPushRight() {
ImmutableQueue<A> q = Empty.pushRight(dasA);
Assert.assertSame(dasA, q.peekRight());
}
@Test
public void EmptyQueueCanPushLeft() {
ImmutableQueue<A> q = Empty.pushLeft(dasA);
Assert.assertSame(dasA, q.peekLeft());
}
@Test(expected = EmptyQueueException.class)
public void CannotPeekRightOnEmptyQueue () {
Empty.peekRight();
}
@Test(expected = EmptyQueueException.class)
public void CannotPeekLeftOnEmptyQueue () {
Empty.peekLeft();
}
@Test(expected = EmptyQueueException.class)
public void CannotPopRightOnEmptyQueue () {
Empty.popRight();
}
@Test(expected = EmptyQueueException.class)
public void CannotPopLeftOnEmptyQueue () {
Empty.popLeft();
}
@Test
public void CanPeekLeftOnQueueWithOnlyRightBranch() {
ImmutableQueue<A> q = Empty.pushRight(dasA);
Assert.assertSame(dasA, q.peekLeft());
}
@Test
public void CanPeekRightOnQueueWithOnlyLeftBranch() {
ImmutableQueue<A> q = Empty.pushLeft(dasA);
Assert.assertSame(dasA, q.peekRight());
}
@Test
public void PushRightUntilFilloverIntoLeft () {
A[] as = new A[5];
dasQ = Empty;
for( int i = 0; i < as.length; i += 1) {
as[i] = new A();
dasQ = dasQ.pushRight(as[i]);
}
Assert.assertEquals(5, dasQ.length);
}
@Test
public void PushRightUntilFilloverIntoMiddle () {
A[] as = new A[9];
dasQ = Empty;
for( int i = 0; i < as.length; i += 1) {
as[i] = new A();
dasQ = dasQ.pushRight(as[i]);
}
Assert.assertEquals(9, dasQ.length);
}
@Test
public void PushLeftUntilFilloverIntoRight () {
A[] as = new A[5];
dasQ = Empty;
for( int i = 0; i < as.length; i += 1) {
as[i] = new A();
dasQ = dasQ.pushLeft(as[i]);
}
Assert.assertEquals(5, dasQ.length);
}
@Test
public void PushLeftUntilFilloverIntoMiddle () {
A[] as = new A[9];
dasQ = Empty;
for( int i = 0; i < as.length; i += 1) {
as[i] = new A();
dasQ = dasQ.pushLeft(as[i]);
}
Assert.assertEquals(9, dasQ.length);
}
@Test
public void PopLeftFromRightFilledWithMidData () {
ImmutableQueue<Integer> q = new ImmutableQueue<Integer>();
for (int i = 0; i < 1000; i += 1) {
q = q.pushRight(i);
}
for (int i = 0; i < 1000; i += 1) {
Assert.assertEquals(i, (int)q.peekLeft());
q = q.popLeft();
}
}
@Test
public void PopRightFromRightFilledWithMidData () {
ImmutableQueue<Integer> q = new ImmutableQueue<Integer>();
for (int i = 0; i < 1000; i += 1) {
q = q.pushRight(i);
}
for (int i = 999; i >= 0; i -= 1) {
Assert.assertEquals(i, (int)q.peekRight());
q = q.popRight();
}
}
@Test
public void PopRightFromLeftFilledWithMidData () {
ImmutableQueue<Integer> q = new ImmutableQueue<Integer>();
for (int i = 0; i < 1000; i += 1) {
q = q.pushLeft(i);
}
for (int i = 0; i < 1000; i += 1) {
Assert.assertEquals(i, (int)q.peekRight());
q = q.popRight();
}
}
@Test
public void PopLeftFromLeftFilledWithMidData () {
ImmutableQueue<Integer> q = new ImmutableQueue<Integer>();
for (int i = 0; i < 1000; i += 1) {
q = q.pushLeft(i);
}
for (int i = 999; i >= 0; i -= 1) {
Assert.assertEquals(i, (int)q.peekLeft());
q = q.popLeft();
}
}
@Test
public void IteratorWorksForSmallQueue () {
ImmutableQueue<Integer> q = new ImmutableQueue<Integer>();
int limit = 4;
for (int i = 0; i < limit; i += 1) {
q = q.push(i);
}
int expected = 0;
for (int actual: q) {
Assert.assertEquals(expected, actual);
expected += 1;
}
}
@Test
public void IteratorWorksForMediumQueue () {
ImmutableQueue<Integer> q = new ImmutableQueue<Integer>();
int limit = 24;
for (int i = 0; i < limit; i += 1) {
q = q.push(i);
}
int expected = 0;
for (int actual: q) {
Assert.assertEquals(expected, actual);
expected += 1;
}
}
@Test
public void IteratorWorksForLargeQueue () {
ImmutableQueue<Integer> q = new ImmutableQueue<Integer>();
int limit = 255;
for (int i = 0; i < limit; i += 1) {
q = q.push(i);
}
int expected = 0;
for (int actual: q) {
Assert.assertEquals(expected, actual);
expected += 1;
}
}
@Test
public void IteratorWorksForHugeQueue () {
ImmutableQueue<Integer> q = new ImmutableQueue<Integer>();
int limit = 1000000;
for (int i = 0; i < limit; i += 1) {
q = q.push(i);
}
int expected = 0;
for (int actual: q) {
Assert.assertEquals(expected, actual);
expected += 1;
}
}
@Test
public void ToArrayForwards () {
ImmutableQueue<Integer> q = new ImmutableQueue<Integer>();
Integer[] a = new Integer[1000000];
Object[] b;
for (int i = 0; i < a.length; i += 1) {
a[i]=i;
q = q.push(i);
}
Assert.assertEquals(a.length, q.length);
b = q.toArray();
Assert.assertEquals(a.length, b.length);
for (int i = 0; i < a.length; i += 1) {
Assert.assertEquals(a[i], b[i]);
}
}
}