public LockStepIterator(ResumableIterator[] i) { iteratorsArray = i; if (i.length == 0) { // Empty set supplied System.out.println("Empty iterator created."); isEmptyIterator = true; } else { int iteratorSize = i[0].size(); for (int j = 0; j < i.length; j++) { if (i[j].size() != iteratorSize) { // Iterator sizes don't match System.out .println("Iterator sizes mismatch, creating an empty iterator."); isEmptyIterator = true; } } } }
boolean emptyIterator() { for (int i = 0; i < JoinIteratorNode.this.getChildCount(); i++) { if (((ResumableIterator) JoinIteratorNode.this .getChildAt(i)).size() == 0) { return true; } } return false; } };
/** * Return the total number of iterations this joinIterator will produce, * this is the product of the sizes of all component iterators. */ public int size() { int size = 1; for (int i = 0; i < iterators().length; i++) { size = size * iterators()[i].size(); } return size; }
/** * All iterators are the same size */ public int size() { return (emptyIterator()) ? 0 : iterators()[0].size(); }
private static void printIterator(ResumableIterator i) { System.out.println("Iterator is of class " + i.getClass().toString().split("\\.")[5] + ", " + ((ResumableIterator) i).size() + " elements, " + ((TreeNode) i).getChildCount() + " children."); while (i.hasNext()) {
inputSet = (Map<String, DataThing>) jobQueue.next(); currentLocation = jobQueue.getCurrentLocation(); queueSize = jobQueue.size(); int eventListSize = eventList.size(); Object o = eventList.get(eventListSize - 1);