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 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425
|
/*
* Copyright (c) 2012, 2013, Oracle and/or its affiliates. All rights reserved.
* 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.
*/
import org.testng.annotations.Test;
import java.lang.reflect.Constructor;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collection;
import java.util.Collections;
import java.util.Iterator;
import java.util.List;
import java.util.ListIterator;
import java.util.NoSuchElementException;
import static org.testng.Assert.assertEquals;
import static org.testng.Assert.assertFalse;
import static org.testng.Assert.assertTrue;
import static org.testng.Assert.fail;
/**
* @test
* @run testng IteratorDefaults
* @summary test extension methods on Iterator
*/
@Test
public class IteratorDefaults {
private static interface Callback {
void call(List<Integer> list);
}
// call the callback for each recursive subList
private void trimmedSubList(final List<Integer> list, final Callback callback) {
int size = list.size();
if (size > 1) {
// trim 1 element from both ends
final List<Integer> subList = list.subList(1, size - 1);
callback.call(subList);
trimmedSubList(subList, callback);
}
}
public void testRemoveUnsupported() {
final Iterator iterator = new Iterator() {
@Override
public boolean hasNext() {
return false;
}
@Override
public Object next() {
return null;
}
};
try {
iterator.remove();
fail("expected UnsupportedOperationException from remove not thrown");
} catch (UnsupportedOperationException ignore) {
}
}
public void testRemoveOverride() {
final IteratorWithRemove iterator = new IteratorWithRemove();
iterator.remove();
assertTrue(iterator.removed);
}
public void testForEach() throws Exception {
final Integer[] data = new Integer[1000];
for (int i=0; i < data.length; i++) {
data[i] = i;
}
final List<Integer> source = Arrays.asList(data);
final String[] iterableCollectionClasses = {
"java.util.ArrayDeque",
"java.util.ArrayList",
"java.util.HashSet",
"java.util.LinkedHashSet",
"java.util.LinkedList",
"java.util.PriorityQueue",
"java.util.TreeSet",
"java.util.Vector",
"java.util.concurrent.ConcurrentLinkedDeque",
"java.util.concurrent.ConcurrentLinkedQueue",
"java.util.concurrent.ConcurrentSkipListSet",
"java.util.concurrent.CopyOnWriteArrayList",
"java.util.concurrent.CopyOnWriteArraySet",
"java.util.concurrent.LinkedBlockingDeque",
"java.util.concurrent.LinkedBlockingQueue",
"java.util.concurrent.LinkedTransferQueue",
"java.util.concurrent.PriorityBlockingQueue"
};
for (final String iterableClass : iterableCollectionClasses) {
final Iterable<Integer> iterable =
(Iterable<Integer>) Class.forName(iterableClass).newInstance();
((Collection<Integer>) iterable).addAll(source);
final Iterator<Integer> iterator = iterable.iterator();
final List<Integer> target = new ArrayList<>(source.size());
iterator.forEachRemaining(target::add);
if ("java.util.HashSet".equals(iterableClass)) {
target.sort((x, y) -> x - y);
assertEquals(target, source);
} else {
assertEquals(target, source);
}
// verify that for an iterator that has been advanced via next(),
// forEach starts from the current location, not zero
final int OFFSET = 5;
final List<Integer> reference2 = new ArrayList<>(source).subList(OFFSET, source.size());
final List<Integer> removed2 = new ArrayList<>(OFFSET);
final Iterator<Integer> iterator2 = iterable.iterator();
for (int i=0; i < OFFSET; i++) {
// advance the iterator by OFFSET, saving iterated elements
removed2.add(iterator2.next());
}
final List<Integer> target2 = new ArrayList<>(reference2.size());
iterator2.forEachRemaining(target2::add);
if ("java.util.HashSet".equals(iterableClass)) {
assertEquals(target2.size(), reference2.size());
target2.addAll(removed2);
target2.sort((x, y) -> x - y);
assertEquals(target2, source);
assertEquals(target2.subList(OFFSET, source.size()), reference2);
} else {
assertEquals(target2, reference2);
}
}
}
public void testForEachSubList() throws Exception {
final Integer[] data = new Integer[100];
for (int i = 0; i < data.length; i++) {
data[i] = i;
}
final List<Integer> source = Arrays.asList(data);
final String[] listClasses = {
"java.util.ArrayList",
"java.util.LinkedList",
"java.util.Vector",
"java.util.concurrent.CopyOnWriteArrayList"
};
for (final String listClass : listClasses) {
final List<Integer> list =
(List<Integer>) Class.forName(listClass).newInstance();
list.addAll(source);
trimmedSubList(list, new Callback() {
@Override
public void call(final List<Integer> list) {
if (list.size() < 1) {
return;
}
final List<Integer> target = new ArrayList<>(list.size());
final ListIterator<Integer> iterator = list.listIterator();
assertTrue(iterator.hasNext());
assertFalse(iterator.hasPrevious());
assertEquals(iterator.nextIndex(), 0);
assertEquals(iterator.previousIndex(), -1);
iterator.forEachRemaining(target::add);
assertEquals(target, list);
assertFalse(iterator.hasNext());
assertTrue(iterator.hasPrevious());
assertEquals(iterator.nextIndex(), list.size());
assertEquals(iterator.previousIndex(), list.size() - 1);
try {
iterator.next();
fail(listClass + " iterator advanced beyond end");
} catch (NoSuchElementException ignore) {
}
}
});
}
}
public void testOptimizedForEach() throws Exception {
final Integer[] data = new Integer[1000 * 1000];
for (int i=0; i < data.length; i++) {
data[i] = i;
}
final List<Integer> source = Arrays.asList(data);
final String[] listClasses = {
"java.util.ArrayList",
"java.util.LinkedList",
"java.util.Vector",
"java.util.concurrent.CopyOnWriteArrayList"
};
final int OFFSET = 3;
final List<Integer> target = new ArrayList<>(source);
for (final String listClass : listClasses) {
final List<Integer> list =
(List<Integer>) Class.forName(listClass).newInstance();
list.addAll(source);
final ListIterator<Integer> iterator = list.listIterator();
assertFalse(iterator.hasPrevious());
for (int i=0; i < OFFSET; i++) {
iterator.next();
}
assertTrue(iterator.hasNext());
assertTrue(iterator.hasPrevious());
assertEquals(iterator.nextIndex(), OFFSET);
assertEquals(iterator.previousIndex(), OFFSET - 1);
iterator.forEachRemaining(e -> {
target.set(e, e + 1);
});
for (int i=OFFSET; i < data.length; i++) {
assertEquals(target.get(i).intValue(), source.get(i)+1);
}
assertFalse(iterator.hasNext());
assertTrue(iterator.hasPrevious());
assertEquals(iterator.nextIndex(), data.length);
assertEquals(iterator.previousIndex(), data.length - 1);
// CopyOnWriteArrayList.listIterator().remove() is unsupported
if (!"java.util.concurrent.CopyOnWriteArrayList".equals(listClass)) {
for (int i = data.length - 1; i >= 0; i--) {
iterator.remove(); // must not throw
if (i > 0) {
iterator.previous();
}
}
assertTrue(list.isEmpty());
}
try {
iterator.next();
fail(listClass + " iterator advanced beyond end");
} catch (NoSuchElementException ignore) {
}
}
}
@Test(enabled = false)
public void compareForEachPerformance() throws Exception {
final Integer[] data = new Integer[1000 * 100];
for (int i=0; i < data.length; i++) {
data[i] = i;
}
final List<Integer> source = Arrays.asList(data);
final String[] iterableCollectionClasses = {
"java.util.ArrayList", // warmup, results discarded
"java.util.ArrayDeque",
"java.util.ArrayList",
"java.util.HashSet",
"java.util.LinkedHashSet",
"java.util.LinkedList",
"java.util.PriorityQueue",
"java.util.TreeSet",
"java.util.Vector",
"java.util.concurrent.ConcurrentLinkedDeque",
"java.util.concurrent.ConcurrentLinkedQueue",
"java.util.concurrent.ConcurrentSkipListSet",
"java.util.concurrent.CopyOnWriteArrayList",
"java.util.concurrent.CopyOnWriteArraySet",
"java.util.concurrent.LinkedBlockingDeque",
"java.util.concurrent.LinkedBlockingQueue",
"java.util.concurrent.LinkedTransferQueue",
"java.util.concurrent.PriorityBlockingQueue"
};
boolean warmup = true;
final int ITERATIONS = 10;
final Integer[] target = new Integer[source.size()];
for (final String iterableClass : iterableCollectionClasses) {
final Class<? extends Collection<Integer>> type =
(Class<? extends Collection<Integer>>) Class.forName(iterableClass);
final Constructor<? extends Collection<Integer>> copyConstructor =
type.getConstructor(Collection.class);
final Iterable<Integer> iterable = copyConstructor.newInstance(source);
final Iterable<Integer> reference =
Collections.unmodifiableCollection((Collection<Integer>) iterable);
for (int i=0; i < ITERATIONS; i++) {
final Iterator<Integer> iterator = reference.iterator();
final long forEachStart = System.nanoTime();
iterator.forEachRemaining(x -> {target[x.intValue()] = x;});
final long forEachEnd = System.nanoTime();
final Iterator<Integer> iterator2 = reference.iterator();
Integer x;
final long iteratorStart = System.nanoTime();
while (iterator2.hasNext()) {
x = iterator2.next();
target[x.intValue()] = x;
}
final long iteratorEnd = System.nanoTime();
if (warmup) { continue; } // warmup, discard results
final long forEachTime = forEachEnd - forEachStart;
final long iteratorTime = iteratorEnd - iteratorStart;
final long speedup = iteratorTime - forEachTime;
System.out.print(iterableClass);
System.out.print(" iterator: ");
System.out.print(iteratorTime);
System.out.print(", forEach: ");
System.out.print(forEachTime);
System.out.print(", speedup: ");
System.out.print(speedup);
System.out.print(" (");
System.out.print((speedup * 100) / iteratorTime);
System.out.print("%)\n");
}
if (warmup) { warmup = false; }
System.out.println();
}
}
@Test(enabled = false)
public void compareSubListForEachPerformance() throws Exception {
final Integer[] data = new Integer[1000 * 100];
for (int i = 0; i < data.length; i++) {
data[i] = i;
}
final List<Integer> source = Arrays.asList(data);
final String[] listClasses = {
"java.util.ArrayList", // warmup, results discarded
"java.util.ArrayList",
"java.util.LinkedList",
"java.util.Vector",
"java.util.concurrent.CopyOnWriteArrayList"
};
boolean warmup = true;
final int ITERATIONS = 10;
final Integer[] target = new Integer[source.size()];
for (final String listClass : listClasses) {
final Class<? extends List<Integer >> type =
(Class<? extends List<Integer>>) Class.forName(listClass);
final Constructor<? extends List<Integer >> copyConstructor =
type.getConstructor(Collection.class);
final List<Integer> iterable = copyConstructor.newInstance(source);
final List<Integer> reference = Collections.unmodifiableList(iterable);
for (int i = 0; i < ITERATIONS; i++) {
final Iterator<Integer> iterator = reference.subList(42, reference.size() - 37).iterator();
final long forEachStart = System.nanoTime();
iterator.forEachRemaining(x -> {
target[x.intValue()] = x;
});
final long forEachEnd = System.nanoTime();
final Iterator<Integer> iterator2 = reference.iterator();
Integer x;
final long iteratorStart = System.nanoTime();
while (iterator2.hasNext()) {
x = iterator2.next();
target[x.intValue()] = x;
}
final long iteratorEnd = System.nanoTime();
if (warmup) { continue; } // warmup, discard results
final long forEachTime = forEachEnd - forEachStart;
final long iteratorTime = iteratorEnd - iteratorStart;
final long speedup = iteratorTime - forEachTime;
System.out.print(listClass);
System.out.print(" iterator: ");
System.out.print(iteratorTime);
System.out.print(", forEach: ");
System.out.print(forEachTime);
System.out.print(", speedup: ");
System.out.print(speedup);
System.out.print(" (");
System.out.print((speedup * 100) / iteratorTime);
System.out.print("%)\n");
}
if (warmup) { warmup = false; }
System.out.println();
}
}
static class IteratorWithRemove implements Iterator {
public boolean removed;
IteratorWithRemove() {
removed = false;
}
@Override
public boolean hasNext() {
return false;
}
@Override
public Object next() {
return null;
}
@Override
public void remove() {
removed = true;
}
}
}
|