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
|
/*
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
/*
* This file is available under and governed by the GNU General Public
* License version 2 only, as published by the Free Software Foundation.
* However, the following notice accompanied the original version of this
* file:
*
* Written by Doug Lea with assistance from members of JCP JSR-166
* Expert Group and released to the public domain, as explained at
* http://creativecommons.org/publicdomain/zero/1.0/
* Other contributors include Andrew Wright, Jeffrey Hayes,
* Pat Fisher, Mike Judd.
*/
import java.util.AbstractQueue;
import java.util.Arrays;
import java.util.Iterator;
import java.util.NoSuchElementException;
import junit.framework.Test;
import junit.framework.TestSuite;
public class AbstractQueueTest extends JSR166TestCase {
public static void main(String[] args) {
main(suite(), args);
}
public static Test suite() {
return new TestSuite(AbstractQueueTest.class);
}
static class Succeed extends AbstractQueue<Integer> {
public boolean offer(Integer x) {
if (x == null) throw new NullPointerException();
return true;
}
public Integer peek() { return one; }
public Integer poll() { return one; }
public int size() { return 0; }
public Iterator iterator() { return null; } // not needed
}
static class Fail extends AbstractQueue<Integer> {
public boolean offer(Integer x) {
if (x == null) throw new NullPointerException();
return false;
}
public Integer peek() { return null; }
public Integer poll() { return null; }
public int size() { return 0; }
public Iterator iterator() { return null; } // not needed
}
/**
* add returns true if offer succeeds
*/
public void testAddS() {
Succeed q = new Succeed();
assertTrue(q.add(two));
}
/**
* add throws IllegalStateException if offer fails
*/
public void testAddF() {
Fail q = new Fail();
try {
q.add(one);
shouldThrow();
} catch (IllegalStateException success) {}
}
/**
* add throws NullPointerException if offer does
*/
public void testAddNPE() {
Succeed q = new Succeed();
try {
q.add(null);
shouldThrow();
} catch (NullPointerException success) {}
}
/**
* remove returns normally if poll succeeds
*/
public void testRemoveS() {
Succeed q = new Succeed();
assertSame(one, q.remove());
}
/**
* remove throws NSEE if poll returns null
*/
public void testRemoveF() {
Fail q = new Fail();
try {
q.remove();
shouldThrow();
} catch (NoSuchElementException success) {}
}
/**
* element returns normally if peek succeeds
*/
public void testElementS() {
Succeed q = new Succeed();
assertSame(one, q.element());
}
/**
* element throws NSEE if peek returns null
*/
public void testElementF() {
Fail q = new Fail();
try {
q.element();
shouldThrow();
} catch (NoSuchElementException success) {}
}
/**
* addAll(null) throws NullPointerException
*/
public void testAddAll1() {
Succeed q = new Succeed();
try {
q.addAll(null);
shouldThrow();
} catch (NullPointerException success) {}
}
/**
* addAll(this) throws IllegalArgumentException
*/
public void testAddAllSelf() {
Succeed q = new Succeed();
try {
q.addAll(q);
shouldThrow();
} catch (IllegalArgumentException success) {}
}
/**
* addAll of a collection with null elements throws NullPointerException
*/
public void testAddAll2() {
Succeed q = new Succeed();
Integer[] ints = new Integer[SIZE];
try {
q.addAll(Arrays.asList(ints));
shouldThrow();
} catch (NullPointerException success) {}
}
/**
* addAll of a collection with any null elements throws NPE after
* possibly adding some elements
*/
public void testAddAll3() {
Succeed q = new Succeed();
Integer[] ints = new Integer[SIZE];
for (int i = 0; i < SIZE - 1; ++i)
ints[i] = new Integer(i);
try {
q.addAll(Arrays.asList(ints));
shouldThrow();
} catch (NullPointerException success) {}
}
/**
* addAll throws IllegalStateException if an add fails
*/
public void testAddAll4() {
Fail q = new Fail();
Integer[] ints = new Integer[SIZE];
for (int i = 0; i < SIZE; ++i)
ints[i] = new Integer(i);
try {
q.addAll(Arrays.asList(ints));
shouldThrow();
} catch (IllegalStateException success) {}
}
}
|
