문자열에서 JTree 빌드하기

Question

두 개의 문자열 node1/node2/node3/node4와 "node1/node2/node5/node6".... 어떻게이 문자열로부터 하나의 JTree을 만들 수 있습니까? 즉, 하나의 문자열 ....

import java.awt.*; 
import java.util.ArrayList; 

import javax.swing.*; 
import javax.swing.tree.*; 

public class PathTest 
{ 
    public PathTest() 
    { 

    DefaultMutableTreeNode node = buildNodeFromString(); 


     DefaultTreeModel model = new DefaultTreeModel(node); 
     JTree tree = new JTree(model); 
     JFrame f = new JFrame(); 
     f.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); 
     f.add(tree); 
     f.setSize(300,300); 
     f.setLocation(200,200); 
     f.setVisible(true); 
    } 

private DefaultMutableTreeNode buildNodeFromString() { 



String qqq= "node1/node2/node3/node4"; 
DefaultMutableTreeNode node, lastNode = null, root = null; 

    String[] s = qqq.split("/"); 
    for (String str : s) { 
    node = new DefaultMutableTreeNode(str);  
    if (root == null) 
     root = node; 
    if (lastNode != null) 
     lastNode.add(node); 
    lastNode = node; 
    } 

return root; 
} 

    public static void main(String[] args) 
    { 
     new PathTest(); 
    } 
} 

Answer 1

을이 밖으로 시도,이 코드는 트리에 대한 하나의 루트를 만든 다음 루트 아래에 문자열을 추가하기 시작합니다. 루트를 표시하지 않으려면, 단순히 전화 tree.setRootVisible(false);

import java.util.Enumeration; 

import javax.swing.JFrame; 
import javax.swing.JTree; 
import javax.swing.tree.DefaultMutableTreeNode; 
import javax.swing.tree.DefaultTreeModel; 

public class PathTest { 
    public PathTest() { 
     // Create the root node, I'm assuming that the delimited strings will have 
     // different string value at index 0 
     DefaultMutableTreeNode root = new DefaultMutableTreeNode("ROOT"); 

     // Create the tree model and add the root node to it 
     DefaultTreeModel model = new DefaultTreeModel(root); 

     // Create the tree with the new model 
     JTree tree = new JTree(model); 

     // Build the tree from the various string samples 
     buildTreeFromString(model, "Node 1/Node 2/Node 3/Node 4"); 
     buildTreeFromString(model, "Node 1/Node 2/Node 3/Node 5"); 
     buildTreeFromString(model, "Node 1/Node 2/Node 3/Node 6"); 
     buildTreeFromString(model, "Node 1/Node 2/Node 4/Node 5"); 
     buildTreeFromString(model, "Node 1/Node 1/Node 3/Node 5"); 

     // UI 
     JFrame f = new JFrame(); 
     f.setDefaultCloseOperation(JFrame.EXIT_ON_CLOSE); 
     f.add(tree); 
     f.setSize(300, 300); 
     f.setLocation(200, 200); 
     f.setVisible(true); 
    } 

    /** 
    * Builds a tree from a given forward slash delimited string. 
    * 
    * @param model The tree model 
    * @param str The string to build the tree from 
    */ 
    private void buildTreeFromString(final DefaultTreeModel model, final String str) { 
     // Fetch the root node 
     DefaultMutableTreeNode root = (DefaultMutableTreeNode) model.getRoot(); 

     // Split the string around the delimiter 
     String [] strings = str.split("/"); 

     // Create a node object to use for traversing down the tree as it 
     // is being created 
     DefaultMutableTreeNode node = root; 

     // Iterate of the string array 
     for (String s: strings) { 
      // Look for the index of a node at the current level that 
      // has a value equal to the current string 
      int index = childIndex(node, s); 

      // Index less than 0, this is a new node not currently present on the tree 
      if (index < 0) { 
       // Add the new node 
       DefaultMutableTreeNode newChild = new DefaultMutableTreeNode(s); 
       node.insert(newChild, node.getChildCount()); 
       node = newChild; 
      } 
      // Else, existing node, skip to the next string 
      else { 
       node = (DefaultMutableTreeNode) node.getChildAt(index); 
      } 
     } 
    } 

    /** 
    * Returns the index of a child of a given node, provided its string value. 
    * 
    * @param node The node to search its children 
    * @param childValue The value of the child to compare with 
    * @return The index 
    */ 
    private int childIndex(final DefaultMutableTreeNode node, final String childValue) { 
     Enumeration<DefaultMutableTreeNode> children = node.children(); 
     DefaultMutableTreeNode child = null; 
     int index = -1; 

     while (children.hasMoreElements() && index < 0) { 
      child = children.nextElement(); 

      if (child.getUserObject() != null && childValue.equals(child.getUserObject())) { 
       index = node.getIndex(child); 
      } 
     } 

     return index; 
    } 

    public static void main(String[] args) { 
     new PathTest(); 
    } 
} 

희망이 도움이됩니다.

Answer 2

for (String str : s) { 
    node = new DefaultMutableTreeNode(str);  
    if (root == null) 
     root = node; 
    if (lastNode != null) 
     lastNode.add(node); 
    lastNode = node; 
} 

대신 만드는 새로운 DefaultMutableTreeNode의 인스턴스의 코드에 이미 같은 이름의 아이가 어떤가를 lastNode를 확인을 구축합니다.