ResumableIterator[] iterators() { ResumableIterator[] result = new ResumableIterator[LockStepIteratorNode.this .getChildCount()]; for (int i = 0; i < LockStepIteratorNode.this.getChildCount(); i++) { result[i] = (ResumableIterator) LockStepIteratorNode.this .getChildAt(i); } return result; }
boolean emptyIterator() { return (LockStepIteratorNode.this.getChildCount() == 0); } };
/** * Trap any calls to add children and forcibly reset everything */ public void insert(MutableTreeNode node, int index) { super.insert(node, index); reset(); }
t = new LockStepIteratorNode(); t.insert(new BaclavaIteratorNode(coloursThing.iterator("''"), "Colour"), 0);