public void testFirstIteratorIsEmptyBug() { List empty = new ArrayList(); List notEmpty = new ArrayList(); notEmpty.add("A"); notEmpty.add("B"); notEmpty.add("C"); IteratorChain chain = new IteratorChain(); chain.addIterator(empty.iterator()); chain.addIterator(notEmpty.iterator()); assertTrue("should have next",chain.hasNext()); assertEquals("A",chain.next()); assertTrue("should have next",chain.hasNext()); assertEquals("B",chain.next()); assertTrue("should have next",chain.hasNext()); assertEquals("C",chain.next()); assertTrue("should not have next",!chain.hasNext()); }
public void testEmptyChain() { IteratorChain chain = new IteratorChain(); assertEquals(false, chain.hasNext()); try { chain.next(); fail(); } catch (NoSuchElementException ex) {} try { chain.remove(); fail(); } catch (IllegalStateException ex) {} }
public boolean hasNext() { return (_closed) ? false : super.hasNext(); }
public boolean hasNext() { return (_closed) ? false : super.hasNext(); }
public boolean hasNext() { return _itr.hasNext(); }
public boolean hasNext() { return (_closed) ? false : super.hasNext(); }
public boolean hasNext() { return _itr.hasNext(); }
public boolean hasNext() { return _itr.hasNext(); }
public boolean hasNext() { return _itr.hasNext(); }
public boolean hasNext() { return (_closed) ? false : super.hasNext(); }
public boolean hasNext() { return (_closed) ? false : super.hasNext(); }
public boolean hasNext() { return _itr.hasNext(); }
public boolean hasNext() { if (_state == CLOSED) return false; // close automatically if no more elements if (!_itr.hasNext()) { free(); _state = LAST_ELEM; return false; } return true; }
public boolean hasNext() { if (_state == CLOSED) return false; // close automatically if no more elements if (!_itr.hasNext()) { free(); _state = LAST_ELEM; return false; } return true; }
public boolean hasNext() { if (_state == CLOSED) return false; // close automatically if no more elements if (!_itr.hasNext()) { free(); _state = LAST_ELEM; return false; } return true; }
public boolean hasNext() { if (_state == CLOSED) return false; // close automatically if no more elements if (!_itr.hasNext()) { free(); _state = LAST_ELEM; return false; } return true; }
public boolean hasNext() { if (_state != OPEN) return false; // close automatically if no more elements if (!_itr.hasNext()) { free(); _state = LAST_ELEM; return false; } return true; }
public boolean hasNext() { if (_state == CLOSED) return false; // close automatically if no more elements if (!_itr.hasNext()) { free(); _state = LAST_ELEM; return false; } return true; }
chain.addIterator(staleStates.iterator()); while (chain.hasNext()) { ItemState state = (ItemState) chain.next(); if (containedInTree(target, state)) {
chain.addIterator(staleStates.iterator()); while (chain.hasNext()) { ItemState state = (ItemState) chain.next(); if (containedInTree(target, state)) {