Lines Matching refs:child
138 * @param allowsChildren if true, the node is allowed to have child
155 * parent), sets the child's parent to this node, and then adds the child
156 * to this node's child array at index <code>childIndex</code>.
161 * @param childIndex the index in this node's child array
176 throw new IllegalArgumentException("new child is null");
178 throw new IllegalArgumentException("new child is an ancestor");
194 * Removes the child at the specified index from this node's children
195 * and sets that node's parent to null. The child node to remove
198 * @param childIndex the index in this node's child array
199 * of the child to remove
204 MutableTreeNode child = (MutableTreeNode)getChildAt(childIndex);
206 child.setParent(null);
211 * change the parent's child array. This method is called from
213 * reassign a child's parent, it should not be messaged from anywhere
232 * Returns the child at the specified index in this node's child array.
234 * @param index an index into this node's child array
237 * @return the TreeNode in this node's child array at the specified index
260 * Returns the index of the specified child in this node's child array.
261 * If the specified node is not a child of this node, returns
268 * @return an int giving the index of the node in this node's child
270 * a child of this node
285 * children. Modifying this node's child array invalidates any child
366 * Removes <code>aChild</code> from this node's child array, giving it a
369 * @param aChild a child of this node to remove
371 * is null or is not a child of this node
379 throw new IllegalArgumentException("argument is not a child");
395 * Removes <code>newChild</code> from its parent and makes it a child of
396 * this node by adding it to the end of this node's child array.
399 * @param newChild node to add as a child of this node
819 * then the child of <code>ancestor</code> that is an ancestor of this
845 * Returns true if <code>aNode</code> is a child of this node. If
848 * @return true if <code>aNode</code> is a child of this node; false if
869 * Returns this node's first child. If this node has no children,
872 * @return the first child of this node
884 * Returns this node's last child. If this node has no children,
887 * @return the last child of this node
899 * Returns the child in this node's child array that immediately
900 * follows <code>aChild</code>, which must be a child of this node. If
901 * <code>aChild</code> is the last child, returns null. This method
908 * null or is not a child of this node
909 * @return the child of this node that immediately follows
920 throw new IllegalArgumentException("node is not a child");
932 * Returns the child in this node's child array that immediately
933 * precedes <code>aChild</code>, which must be a child of this node. If
934 * <code>aChild</code> is the first child, returns null. This method
939 * or is not a child of this node
940 * @return the child of this node that immediately precedes
951 throw new IllegalArgumentException("argument is not a child");
1016 * Returns null if this node has no parent or is the parent's last child.
1018 * of children; to traverse the entire array, use the parent's child
1036 throw new Error("child of parent is not a sibling");
1046 * first child. This method performs a linear search that is O(n) where n
1063 throw new Error("child of parent is not a sibling");
1091 * either this node or its first child's first leaf.
1111 * either this node or its last child's last leaf.
1136 * parent's child-list in order to find the current node.
1171 * parent's child-list in order to find the current node.