zoukankan      html  css  js  c++  java
  • Java GUI 窗体事件

    import java.awt.Frame;
    import java.awt.event.WindowAdapter;
    import java.awt.event.WindowEvent;
    
    public class Java窗体事件 {
    	public static void main(String[] args) {
    		Frame f = new Frame("WindowEvent");
    		f.setSize(400,300);
    		f.setLocation(300, 200);
    		f.setVisible(true);
    		f.addWindowListener(new WindowAdapter() {
    			public void windowOpened(WindowEvent e) {
    				System.out.println("windowOpened---窗体打开事件");
    			}
    
    			@Override
    			public void windowActivated(WindowEvent e) {
    				// TODO Auto-generated method stub
    				System.out.println("windowActivated---窗体激活事件");
    			}
    
    			@Override
    			public void windowClosed(WindowEvent e) {
    				// TODO Auto-generated method stub
    				System.out.println("windowClosed---窗体关闭事件");
    				
    			}
    
    			@Override
    			public void windowClosing(WindowEvent e) {
    				// TODO Auto-generated method stub
    				System.out.println("windowClosing---窗体正在关闭事件");
    				
    			}
    
    			@Override
    			public void windowDeactivated(WindowEvent e) {
    				// TODO Auto-generated method stub
    				System.out.println("windowDeactivated---窗体停用事件");
    				
    			}
    
    			@Override
    			public void windowDeiconified(WindowEvent e) {
    				// TODO Auto-generated method stub
    				System.out.println("windowDeiconified---窗体取消图标化事件");
    				
    			}
    
    			@Override
    			public void windowIconified(WindowEvent e) {
    				// TODO Auto-generated method stub
    				System.out.println("windowiconified---窗体图标化事件");
    				
    			}
    		});
    	}
    
    }
    
    
  • 相关阅读:
    Numpy入门
    Numpy入门
    Spring源码之IoC原理
    LeetCode之连续子数组的最大和
    剑指Offer之从1到n整数中1出现的次数
    剑指Offer之最小的k个数
    剑指Offer之字符串的排列
    剑指Offer之二叉搜索树与双向链表
    剑指Offer之二叉树中和为某一值的路径
    剑指Offer之二叉搜索树的后序遍历序列
  • 原文地址:https://www.cnblogs.com/a1439775520/p/13076536.html
Copyright © 2011-2022 走看看