java - 如何在 jTree 中显示 Windows 注册表？

Question

我正在使用java swing。我想在jTree中显示Windows注册表是如何实现的。我是java新手，请给我一个解决方案。实际上我想删除一个特定的Windows注册表项，我做到了，但我无法在jtree中显示它意味着我显示了regkey删除之前和删除之后的结构。

Answer 1

我遇到了类似的问题，但无法找到现成的东西。经过一番阅读后，我编写了一个 TreeModel 实现类来执行此操作。
类可用于将任何TreePath列表转换为树，例如:

A->B->C->D
A->B->E->F
A->G->H->J

将变成:

A+
 |B+
 | |C+
 | | |D
 | |E+
 |   |F
 |G+
   |H+
     |J

这里是:

    import java.util.ArrayList;
    import java.util.Arrays;
    import java.util.Iterator;
    import java.util.NoSuchElementException;
    import javax.swing.event.TreeModelListener;
    import javax.swing.tree.DefaultMutableTreeNode;
    import javax.swing.tree.TreeModel;
    import javax.swing.tree.TreePath;

    /**
     *
     * @author Majkel
     */
    public class TreePathsTreeModel implements TreeModel {
      private final ArrayList<TreePath> paths;
      private final String root;

      public TreePathsTreeModel(String root, TreePath[] paths) {
        this.root = root;
        this.paths = new ArrayList<TreePath> (Arrays.asList(paths));
      }


      @Override
      public Object getRoot() {
        return this.root;
      }

      @Override
      public Object getChild(Object parent, int index) {
        try {
          return getChildren(parent).get(index);
        } catch (IndexOutOfBoundsException ex) {
          return null;
        }
      }

      @Override
      public int getChildCount(Object parent) {
        return getChildren(parent).size();
      }

      @Override
      public boolean isLeaf(Object node) {
        for (int i = 0; i < paths.size(); i++) {
          TreePath treePath = paths.get(i);
          if (treePath.getLastPathComponent().equals(node))
            return true;
        }
        return false;
      }

      // This method is only required for editable trees, so it is not
      // implemented here.
      @Override
      public void valueForPathChanged(TreePath path, Object newValue) {
        //throw new UnsupportedOperationException("Not supported yet.");
      }

      @Override
      public int getIndexOfChild(Object parent, Object child) {
        return getChildren(parent).indexOf(child);
      }

      // This TreeModel never fires any events (since it is not editable)
      // so event listener registration methods are left unimplemented
      @Override
      public void addTreeModelListener(TreeModelListener l) {
        //throw new UnsupportedOperationException("Not supported yet.");
      }

      @Override
      public void removeTreeModelListener(TreeModelListener l) {
        //throw new UnsupportedOperationException("Not supported yet.");
      }
              //search all paths in list for given object 
              //return every item one level further than it
      private ArrayList<String> getChildren(Object parent) {
        ArrayList<String> children = new ArrayList<String>();
        for (int i = 0; i < this.paths.size(); i++) {
          ArrayList<Object> pathObjects = new ArrayList<Object>( Arrays.asList(this.paths.get(i).getPath()) );
          for (Iterator<Object> it = pathObjects.iterator(); it.hasNext();) {
            Object parentCandidate = it.next();
            if (parentCandidate.equals(parent)) {
              Iterator<Object> checker = it;
              try {
                String child = new DefaultMutableTreeNode( checker.next() ).toString();
                if ( !children.contains(child) )
                  children.add (child);
              } catch (NoSuchElementException ex) {

              } 
            }
          }
        }
        return children;
      }

    }

它容易受到重复条目的影响，例如:

A->B->C->D
A->C->E->F
A->G->H->J

将变成:

 A+
  |B+
  | |C+
  |   |D
  |   |E+
  |     |F
  |C+
  | |D
  | |E+
  |   |F
  |G+
    |H+
      |J

也许我稍后会修复它，或者也许有人知道如何做到这一点？使用示例:

TreePath tpOne = new TreePath(new String [] {"A", "B", "C", "D"});
TreePath tpTwo = new TreePath(new String [] {"A", "B", "E", "F"});
TreePath tpThree = new TreePath(new String [] {"A", "G", "H", "J"});

TreeModel model = new TreePathsTreeModel("A", TreePath[]{tpOne, tpTwo, tpThree}  );
JTree tree = new JTree(model);