157 |
|
static void randomOp(Deque<Integer> deque) throws Exception { |
158 |
|
|
159 |
|
// Perform a random operation |
160 |
< |
switch(random() & 3) { |
160 |
> |
switch (random() & 3) { |
161 |
|
case 0: |
162 |
< |
switch(random() & 3) { |
162 |
> |
switch (random() & 3) { |
163 |
|
case 0: deque.addLast(nextTail++); break; |
164 |
|
case 1: deque.offerLast(nextTail++); break; |
165 |
|
case 2: deque.offer(nextTail++); break; |
172 |
|
int result = 666; |
173 |
|
boolean threw = false; |
174 |
|
try { |
175 |
< |
switch(random(3)) { |
175 |
> |
switch (random(3)) { |
176 |
|
case 0: result = deque.removeFirst(); break; |
177 |
|
case 1: result = deque.remove(); break; |
178 |
|
case 2: result = deque.pop(); break; |
185 |
|
throw new Exception("Remove-no exception: " + result); |
186 |
|
} else { // deque nonempty |
187 |
|
int result = -1; |
188 |
< |
switch(random(5)) { |
188 |
> |
switch (random(5)) { |
189 |
|
case 0: result = deque.removeFirst(); break; |
190 |
|
case 1: result = deque.remove(); break; |
191 |
|
case 2: result = deque.pop(); break; |
199 |
|
} |
200 |
|
break; |
201 |
|
case 2: |
202 |
< |
switch(random(3)) { |
202 |
> |
switch (random(3)) { |
203 |
|
case 0: deque.addFirst(nextHead--); break; |
204 |
|
case 1: deque.offerFirst(nextHead--); break; |
205 |
|
case 2: deque.push(nextHead--); break; |
287 |
|
|
288 |
|
private static void testRemove(Deque<Integer> deque) throws Exception { |
289 |
|
Deque<Integer> copy = null; |
290 |
< |
switch(random() & 1) { |
290 |
> |
switch (random() & 1) { |
291 |
|
case 0: |
292 |
|
copy = (Deque<Integer>) deque.getClass(). |
293 |
|
getConstructor(Collection.class).newInstance(deque); |
320 |
|
throw new Exception(e + " missing."); |
321 |
|
|
322 |
|
boolean removed = false; |
323 |
< |
switch(random(3)) { |
323 |
> |
switch (random(3)) { |
324 |
|
case 0: removed = copy.remove(e); break; |
325 |
|
case 1: removed = copy.removeFirstOccurrence(e); break; |
326 |
|
case 2: removed = copy.removeLastOccurrence(e); break; |