rem: }; 
add: } 
context: qx.Proto.getNext = function() {   /* if curChild is equal to the starting parent we have finished   */  if ( this._curChild == this._parent ) {    return null;  }  var qxChildren = this._curParent.getChildren();  var childrenLength = qxChildren == null ? 0 : qxChildren.length;  /* the last child was already returned.   * now we have to go one level up and return the parent   */  if ( this._curPos[this._curLvl] >= childrenLength ) {    this._curPos[this._curLvl] = 0;    this._curLvl -= 1;    this._curChild  = this._curParent;    this._curParent = this._curParent.getParent();    this._curPos[this._curLvl] += 1;    return this._curChild;  }    /* we have not finished the current child   */  this._curChild = qxChildren[this._curPos[this._curLvl]];  /* now test if the current child has children itself  */   var qxChildren = this._curChild.getChildren();  if ( qxChildren != null ) {    this._curLvl += 1;    this._curPos[this._curLvl] = 0;    this._curParent = this._curChild;    this._curChild = null;    return this.getNext()  }  /* if there are no children return the current child and increment   * the position on this level   */  else {    this._curPos[this._curLvl] += 1;    return this._curChild;  }};
meta: 1005	/local1/tlutelli/issta_data/temp/all_js/javascript/2006_temp/2006/1005/5b1a09c4ca80efdfbd41063412dd526cf7e711df/QxChildrenIterator.js/buggy/qooxdoo/source/contributed/childreniterator_streifert/QxChildrenIterator.js