Lines Matching defs:childIndex

193             int              childIndex = treeModel.getIndexOfChild
197 if(childIndex != -1)
198 return getBounds(node, childIndex, placeIn);
527 * Returns the bounds for the given node. If <code>childIndex</code>
529 * the bounds of the node at <code>childIndex</code> are returned.
531 private Rectangle getBounds(FHTreeStateNode parent, int childIndex,
538 if(childIndex == -1) {
546 row = parent.getRowToModelIndex(childIndex);
547 value = treeModel.getChild(parent.getUserObject(), childIndex);
673 private FHTreeStateNode createNodeForValue(Object value,int childIndex) {
674 return new FHTreeStateNode(value, childIndex, -1);
749 protected int childIndex;
762 public FHTreeStateNode(Object userObject, int childIndex, int row) {
764 this.childIndex = childIndex;
789 public void remove(int childIndex) {
790 FHTreeStateNode node = (FHTreeStateNode)getChildAt(childIndex);
793 super.remove(childIndex);
818 return childIndex;
836 if(((FHTreeStateNode)getChildAt(counter)).childIndex == index)
873 if(child.childIndex >= index) {
874 if(child.childIndex == index)
878 return child.row - (child.childIndex - index);
903 (nextSibling.childIndex - childIndex);
991 if(aNode.childIndex > newChildIndex) {
1068 lastRow += (child.childIndex - lastModelIndex);
1069 lastModelIndex = child.childIndex + 1;
1082 * at <code>childIndex</code> (and <code>modelIndex</code>) to
1092 protected void resetChildrenRowsFrom(int newRow, int childIndex,
1099 for(int counter = childIndex; counter < maxCounter; counter++) {
1101 lastRow += (node.childIndex - lastModelIndex);
1102 lastModelIndex = node.childIndex + 1;
1114 this.childIndex + 1);
1200 * The location is determined from the childIndex of newChild.
1204 int childIndex = newChild.getChildIndex();
1209 childIndex) {
1247 if(aChild.childIndex >= modelIndex) {
1257 childIndex--;
1279 ((FHTreeStateNode)getChildAt(counter)).childIndex += amount;
1285 * children that have a childIndex >= index their index is incremented
1295 if(aChild.childIndex >= index) {
1303 ((FHTreeStateNode)getChildAt(counter)).childIndex++;
1329 info.childIndex = childIndex;
1344 info.childIndex = row - this.row - 1;
1350 (child.childIndex - lastChild.childIndex);
1359 info.childIndex = row - lastChildEndRow +
1360 lastChild.childIndex + 1;
1371 (childCount - lastChild.childIndex) + 1;
1379 info.childIndex = row - lastChildEndRow +
1380 lastChild.childIndex + 1;
1392 info.childIndex = retChildIndex;
1408 if(aChild.childIndex >= stopIndex)
1415 .getCountTo(childIndex);
1434 if(aChild.childIndex >= stopIndex)
1458 protected int childIndex;
1467 childIndex));
1558 nextIndex = parent.childIndex;