Lines Matching defs: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;
179 Iterator<E> it = iterator();
182 if (! it.hasNext()) { // fewer elements than expected
195 r[i] = (T)it.next();
198 return it.hasNext() ? finishToArray(r, it) : r;
211 * returned more elements than expected, and finishes filling it from
215 * @param it the in-progress iterator over this collection
219 private static <T> T[] finishToArray(T[] r, Iterator<?> it) {
221 while (it.hasNext()) {
230 r[i++] = (T)it.next();
267 * specified element. If it finds the element, it removes the element
280 Iterator<E> it = iterator();
282 while (it.hasNext()) {
283 if (it.next()==null) {
284 it.remove();
289 while (it.hasNext()) {
290 if (o.equals(it.next())) {
291 it.remove();
307 * if it's contained in this collection. If all elements are so
351 * element returned by the iterator in turn to see if it's contained
352 * in the specified collection. If it's so contained, it's removed from
370 Iterator<?> it = iterator();
371 while (it.hasNext()) {
372 if (c.contains(it.next())) {
373 it.remove();
384 * element returned by the iterator in turn to see if it's contained
385 * in the specified collection. If it's not so contained, it's removed
403 Iterator<E> it = iterator();
404 while (it.hasNext()) {
405 if (!c.contains(it.next())) {
406 it.remove();
429 Iterator<E> it = iterator();
430 while (it.hasNext()) {
431 it.next();
432 it.remove();
450 Iterator<E> it = iterator();
451 if (! it.hasNext())
457 E e = it.next();
459 if (! it.hasNext())