/** {@inheritDoc} */ @Override public Object getChild(Object parent, int index) { if(parent == treeRoot) { return treeList.getRoots().get(index); } else { TreeList.Node<E> node = (TreeList.Node<E>)parent; return node.getChildren().get(index); } }
/** {@inheritDoc} */ public int getChildCount(Object parent) { if(parent == treeRoot) { return treeList.getRoots().size(); } else { TreeList.Node<E> node = (TreeList.Node<E>)parent; return node.getChildren().size(); } }
/** {@inheritDoc} */ public int getIndexOfChild(Object parent, Object child) { if(parent == treeRoot) { return treeList.getRoots().indexOf(child); } else { TreeList.Node<E> treeNode = (TreeList.Node<E>)parent; return treeNode.getChildren().indexOf(child); } }
private void expandAll() { if (jTree.getRowCount() > 0) { //Always expand root jTree.expandRow(0); } for (int i = 0; i < jTree.getRowCount(); i++) { //Expand everything TreePath path = jTree.getPathForRow(i); Object object = path.getLastPathComponent(); if (object instanceof TreeList.Node) { TreeList.Node<?> node = (TreeList.Node) object; if (node.getChildren().size() > 5000) { //Ignore nodes with more that 5000 children continue; } } jTree.expandPath(path); } }
/** {@inheritDoc} */ public Object getChild(Object parent, int index) { if(parent == treeRoot) { return treeList.getRoots().get(index); } else { TreeList.Node<E> node = (TreeList.Node<E>)parent; return node.getChildren().get(index); } }
/** {@inheritDoc} */ @Override public int getChildCount(Object parent) { if(parent == treeRoot) { return treeList.getRoots().size(); } else { TreeList.Node<E> node = (TreeList.Node<E>)parent; return node.getChildren().size(); } }
/** {@inheritDoc} */ public Object getChild(Object parent, int index) { if(parent == treeRoot) { return treeList.getRoots().get(index); } else { TreeList.Node<E> node = (TreeList.Node<E>)parent; return node.getChildren().get(index); } }
/** {@inheritDoc} */ @Override public int getIndexOfChild(Object parent, Object child) { if(parent == treeRoot) { return treeList.getRoots().indexOf(child); } else { TreeList.Node<E> treeNode = (TreeList.Node<E>)parent; return treeNode.getChildren().indexOf(child); } }
/** {@inheritDoc} */ public int getChildCount(Object parent) { if(parent == treeRoot) { return treeList.getRoots().size(); } else { TreeList.Node<E> node = (TreeList.Node<E>)parent; return node.getChildren().size(); } }
/** {@inheritDoc} */ public int getIndexOfChild(Object parent, Object child) { if(parent == treeRoot) { return treeList.getRoots().indexOf(child); } else { TreeList.Node<E> treeNode = (TreeList.Node<E>)parent; return treeNode.getChildren().indexOf(child); } }