| 1 |
|
/* |
| 2 |
< |
* Copyright 2003 Sun Microsystems, Inc. All Rights Reserved. |
| 2 |
> |
* Copyright (c) 2003, Oracle and/or its affiliates. All rights reserved. |
| 3 |
|
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
| 4 |
|
* |
| 5 |
|
* This code is free software; you can redistribute it and/or modify it |
| 16 |
|
* 2 along with this work; if not, write to the Free Software Foundation, |
| 17 |
|
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. |
| 18 |
|
* |
| 19 |
< |
* Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara, |
| 20 |
< |
* CA 95054 USA or visit www.sun.com if you need additional information or |
| 21 |
< |
* have any questions. |
| 19 |
> |
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA |
| 20 |
> |
* or visit www.oracle.com if you need additional information or have any |
| 21 |
> |
* questions. |
| 22 |
|
*/ |
| 23 |
|
|
| 24 |
|
/* |
| 26 |
|
* @bug 4904067 |
| 27 |
|
* @summary Unit test for Collections.checkedList |
| 28 |
|
* @author Josh Bloch |
| 29 |
+ |
* @key randomness |
| 30 |
|
*/ |
| 31 |
|
|
| 32 |
< |
import java.util.*; |
| 32 |
> |
import java.util.ArrayList; |
| 33 |
> |
import java.util.Arrays; |
| 34 |
> |
import java.util.Collections; |
| 35 |
> |
import java.util.Iterator; |
| 36 |
> |
import java.util.List; |
| 37 |
> |
import java.util.ListIterator; |
| 38 |
> |
import java.util.Random; |
| 39 |
|
|
| 40 |
|
public class CheckedListBash { |
| 41 |
|
static Random rnd = new Random(); |
| 115 |
|
|
| 116 |
|
List even = clone(s); |
| 117 |
|
Iterator it = even.iterator(); |
| 118 |
< |
while(it.hasNext()) |
| 119 |
< |
if(((Integer)it.next()).intValue() % 2 == 1) |
| 118 |
> |
while (it.hasNext()) |
| 119 |
> |
if (((Integer)it.next()).intValue() % 2 == 1) |
| 120 |
|
it.remove(); |
| 121 |
|
it = even.iterator(); |
| 122 |
< |
while(it.hasNext()) |
| 123 |
< |
if(((Integer)it.next()).intValue() % 2 == 1) |
| 122 |
> |
while (it.hasNext()) |
| 123 |
> |
if (((Integer)it.next()).intValue() % 2 == 1) |
| 124 |
|
fail("Failed to remove all odd nubmers."); |
| 125 |
|
|
| 126 |
|
List odd = clone(s); |
| 127 |
|
for (int i=0; i<(listSize/2); i++) |
| 128 |
|
odd.remove(i); |
| 129 |
|
for (int i=0; i<(listSize/2); i++) |
| 130 |
< |
if(((Integer)odd.get(i)).intValue() % 2 != 1) |
| 130 |
> |
if (((Integer)odd.get(i)).intValue() % 2 != 1) |
| 131 |
|
fail("Failed to remove all even nubmers."); |
| 132 |
|
|
| 133 |
|
List all = clone(odd); |
| 151 |
|
} |
| 152 |
|
itAll = all.listIterator(); |
| 153 |
|
it = s.iterator(); |
| 154 |
< |
while(it.hasNext()) |
| 155 |
< |
if(it.next()==itAll.next()) |
| 154 |
> |
while (it.hasNext()) |
| 155 |
> |
if (it.next()==itAll.next()) |
| 156 |
|
fail("Iterator.set failed to change value."); |
| 157 |
|
if (!all.equals(s)) |
| 158 |
|
fail("Failed to reconstruct ints with ListIterator."); |
| 215 |
|
} |
| 216 |
|
|
| 217 |
|
static void AddRandoms(List s, int n) { |
| 218 |
< |
for (int i=0; i<n; i++) { |
| 219 |
< |
int r = rnd.nextInt() % n; |
| 213 |
< |
Integer e = new Integer(r < 0 ? -r : r); |
| 218 |
> |
for (int i = 0; i < n; i++) { |
| 219 |
> |
Integer e = rnd.nextInt(n); |
| 220 |
|
|
| 221 |
|
int preSize = s.size(); |
| 222 |
|
if (!s.add(e)) |
| 223 |
< |
fail ("Add failed."); |
| 223 |
> |
fail("Add failed."); |
| 224 |
|
int postSize = s.size(); |
| 225 |
< |
if (postSize-preSize != 1) |
| 226 |
< |
fail ("Add didn't increase size by 1."); |
| 225 |
> |
if (postSize - preSize != 1) |
| 226 |
> |
fail("Add didn't increase size by 1."); |
| 227 |
|
} |
| 228 |
|
} |
| 229 |
|
|
