ResumableIterator[] iterators() { ResumableIterator[] result = new ResumableIterator[JoinIteratorNode.this .getChildCount()]; for (int i = 0; i < JoinIteratorNode.this.getChildCount(); i++) { result[i] = (ResumableIterator) JoinIteratorNode.this .getChildAt(i); } return result; }
/** * Trap any calls to add children and forcibly reset everything */ public void insert(MutableTreeNode node, int index) { super.insert(node, index); reset(); }
rootNode = new JoinIteratorNode(); for (Iterator i = iteratorNodeMap.values().iterator(); i.hasNext();) { BaclavaIteratorNode iteratorNode = (BaclavaIteratorNode) i .next(); ((JoinIteratorNode) rootNode).add(iteratorNode);
MutableTreeNode t = new JoinIteratorNode(); t.insert(new BaclavaIteratorNode(coloursThing.iterator("''"), "Colour"), 0); MutableTreeNode t2 = new JoinIteratorNode(); t2.insert(t, 0); t2.insert(new BaclavaIteratorNode(shapesThing.iterator("''"),
boolean emptyIterator() { for (int i = 0; i < JoinIteratorNode.this.getChildCount(); i++) { if (((ResumableIterator) JoinIteratorNode.this .getChildAt(i)).size() == 0) { return true; } } return false; } };