Lines Matching refs:it
5 * This code is free software; you can redistribute it and/or modify it
11 * This code is distributed in the hope that it will be useful, but WITHOUT
99 Iterator<E> it = iterator();
101 while (it.hasNext())
102 if (it.next()==null)
105 while (it.hasNext())
106 if (o.equals(it.next()))
137 Iterator<E> it = iterator();
139 if (! it.hasNext()) // fewer elements than expected
141 r[i] = it.next();
143 return it.hasNext() ? finishToArray(r, it) : r;
180 Iterator<E> it = iterator();
183 if (! it.hasNext()) { // fewer elements than expected
196 r[i] = (T)it.next();
199 return it.hasNext() ? finishToArray(r, it) : r;
212 * returned more elements than expected, and finishes filling it from
216 * @param it the in-progress iterator over this collection
221 private static <T> T[] finishToArray(T[] r, Iterator<?> it) {
223 while (it.hasNext()) {
232 r[i++] = (T)it.next();
269 * specified element. If it finds the element, it removes the element
282 Iterator<E> it = iterator();
284 while (it.hasNext()) {
285 if (it.next()==null) {
286 it.remove();
291 while (it.hasNext()) {
292 if (o.equals(it.next())) {
293 it.remove();
309 * if it's contained in this collection. If all elements are so
353 * element returned by the iterator in turn to see if it's contained
354 * in the specified collection. If it's so contained, it's removed from
373 Iterator<?> it = iterator();
374 while (it.hasNext()) {
375 if (c.contains(it.next())) {
376 it.remove();
387 * element returned by the iterator in turn to see if it's contained
388 * in the specified collection. If it's not so contained, it's removed
407 Iterator<E> it = iterator();
408 while (it.hasNext()) {
409 if (!c.contains(it.next())) {
410 it.remove();
433 Iterator<E> it = iterator();
434 while (it.hasNext()) {
435 it.next();
436 it.remove();
454 Iterator<E> it = iterator();
455 if (! it.hasNext())
461 E e = it.next();
463 if (! it.hasNext())
