protected void process(PatchHistoryIterator iterator) throws PatchingException { while (iterator.hasNext() && canProceed()) { final String patch = iterator.next(this); if (includeCurrent()) { processedPatch(patch); } } // If there are errors, fail if (!errors.isEmpty()) { throw new PatchingException(errors.toString()); } }
protected void process(PatchHistoryIterator iterator) throws PatchingException { while (iterator.hasNext() && canProceed()) { final String patch = iterator.next(this); if (includeCurrent()) { processedPatch(patch); } } // If there are errors, fail if (!errors.isEmpty()) { throw new PatchingException(errors.toString()); } }
assertTrue(tree.hasNext()); assertTrue(historyDirs.isEmpty()); assertTrue(moduleDirs.isEmpty()); assertTrue(bundleDirs.isEmpty()); assertTrue(tree.hasNext()); tree.next(); assertEquals(1, historyDirs.size()); assertTrue(historyDirs.contains("oneOff2")); assertTrue(bundleDirs.isEmpty()); assertTrue(tree.hasNext()); tree.next(); assertEquals(2, historyDirs.size()); assertTrue(historyDirs.contains("cp1")); assertTrue(bundleDirs.isEmpty()); assertTrue(tree.hasNext()); tree.next(); assertEquals(3, historyDirs.size()); assertTrue(historyDirs.contains("oneOff1")); assertTrue(bundleDirs.isEmpty()); assertFalse(tree.hasNext());