• JTree单击事件


    import javax.swing.*;
    import javax.swing.tree.*;
    import java.awt.FlowLayout;
    import java.awt.GridLayout;
    public class TreeDemo extends JFrame{
     JTree jTree=new JTree();
     JTextField jTextField =new JTextField();
     GridLayout lay=new GridLayout(1,1);
     public TreeDemo(){
      treeinit();
      this.setSize(400,400);
      this.setLayout(lay);
      this.add(jTree);
      this.add(jTextField);
      this.setVisible(true);
      jTree.addTreeSelectionListener(new javax.swing.event.TreeSelectionListener() {
                public void valueChanged(javax.swing.event.TreeSelectionEvent evt) {
                    jTreeValueChanged(evt);
                }
            });
     }
      private void jTreeValueChanged(javax.swing.event.TreeSelectionEvent evt) {
            DefaultMutableTreeNode selectedNode=(DefaultMutableTreeNode) jTree.getLastSelectedPathComponent();//返回最后选定的节点
            if(selectedNode.toString().equals("child")){
             jTextField.setText("I LOVE YOU");
            }
    
    }
     public void treeinit(){
      DefaultMutableTreeNode root=new DefaultMutableTreeNode("root");
      DefaultMutableTreeNode father=new DefaultMutableTreeNode("father");
            DefaultMutableTreeNode child=new DefaultMutableTreeNode("child");
            father.add(child);
            root.add(father);
            TreeModel treeModel = new DefaultTreeModel(root);
            jTree.setModel(treeModel);
     }
     public static void main(String args[]){
      new TreeDemo();
     }
    }
    

      

  • 相关阅读:
    [Leetcode] 225. Implement Stack using Queues
    前端面试题2
    数据结构_stack
    数据结构 station
    数据结构_wow(泡泡的饭碗)
    数据结构_XingYunX(幸运儿)
    数据结构 nxd(顺序对)
    数据结构 hbb(汉堡包)
    数据结构 elegant_sequence(优雅的序列)
    数据结构 i_love(我喜欢)
  • 原文地址:https://www.cnblogs.com/nicebaby/p/6273001.html
Copyright © 2020-2023  润新知