一个用Java实现的Windows资源管理器 - FileTree.java

// FileTree.java

 

/***********************************************************

 *    Author: Jason

 *     email: tl21cen@hotmail.com

 * CSDN blog: http://blog.csdn.net/UnAgain/

 ***********************************************************/

package tl.exercise.swing;

 

import java.awt.Component;

import java.io.File;

import java.util.Vector;

 

import javax.swing.Icon;

import javax.swing.JTree;

import javax.swing.event.TreeExpansionEvent;

import javax.swing.event.TreeExpansionListener;

import javax.swing.event.TreeModelListener;

import javax.swing.event.TreeSelectionEvent;

import javax.swing.event.TreeSelectionListener;

import javax.swing.filechooser.FileSystemView;

import javax.swing.tree.DefaultTreeCellRenderer;

import javax.swing.tree.TreeModel;

import javax.swing.tree.TreePath;

 

public class FileTree extends JTree {

    static final long serialVersionUID = 0;

 

    private FileList theList;

 

    public FileTree(FileList list) {

        theList = list;

        setModel(new FileSystemModel(new FolderNode()));

        this.setCellRenderer(new FolderRenderer());

      

        addTreeSelectionListener(new TreeSelectionListener() {

           public void valueChanged(TreeSelectionEvent tse) {

           }

       });

      

        this.setSelectionRow(0);

    }

 

    public void fireValueChanged(TreeSelectionEvent tse) {

        TreePath tp = tse.getNewLeadSelectionPath();

        Object o = tp.getLastPathComponent();

       // theList.fireTreeSelectionChanged((PathNode)o);

        theList.fireTreeSelectionChanged((FolderNode) o);

    }

 

    public void fireTreeCollapsed(TreePath path) {

        super.fireTreeCollapsed(path);

        TreePath curpath = getSelectionPath();

 

       if (path.isDescendant(curpath)) {

           setSelectionPath(path);

       }

    }

 

    public void fireTreeWillExpand(TreePath path) {

        System.out.println("Path will expand is " + path);

    }

 

    public void fireTreeWillCollapse(TreePath path) {

        System.out.println("Path will collapse is " + path);

    }

 

    class ExpansionListener implements TreeExpansionListener {

        FileTree tree;

 

        public ExpansionListener(FileTree ft) {

           tree = ft;

       }

 

        public void treeCollapsed(TreeExpansionEvent tee) {

       }

 

        public void treeExpanded(TreeExpansionEvent tee) {

       }

    }

}

 

class FileSystemModel implements TreeModel {

    I_fileSystem theRoot;

 

    char fileType = I_fileSystem.DIRECTORY;

 

    public FileSystemModel(I_fileSystem fs) {

        theRoot = fs;

    }

 

    public Object getRoot() {

        return theRoot;

    }

 

    public Object getChild(Object parent, int index) {

        return ((I_fileSystem) parent).getChild(fileType, index);

 

    }

 

    public int getChildCount(Object parent) {

        return ((I_fileSystem) parent).getChildCount(fileType);

    }

 

    public boolean isLeaf(Object node) {

        return ((I_fileSystem) node).isLeaf(fileType);

    }

 

    public int getIndexOfChild(Object parent, Object child) {

        return ((I_fileSystem) parent).getIndexOfChild(fileType, child);

    }

 

    public void valueForPathChanged(TreePath path, Object newValue) {

    }

 

    public void addTreeModelListener(TreeModelListener l) {

    }

 

    public void removeTreeModelListener(TreeModelListener l) {

    }

}

 

interface I_fileSystem {

    final public static char DIRECTORY = 'D';

 

    final public static char FILE = 'F';

 

    final public static char ALL = 'A';

 

    public Icon getIcon();

 

    public I_fileSystem getChild(char fileType, int index);

 

    public int getChildCount(char fileType);

 

    public boolean isLeaf(char fileType);

 

    public int getIndexOfChild(char fileType, Object child);

}

 

/**

 * A data model for a JTree. This model explorer windows file system directly.

 *

 * <p>

 * Perhaps there is a fatal bug with this design. For speed, each of instances

 * of this model contains file objects of subdirectory, up to now, there isn't

 * any method to release them until program be end. I'm afraid that the memory

 * would be full of if the file system is large enough and JVM memery size

 * setted too small.

 *

 * <p>

 * I won't pay more attention to solve it. it isn't goal of current a exercise.

 *

 * @author Jason

 */

class FolderNode implements I_fileSystem {

 

    // private static FolderNode theRoot;

    private static FileSystemView fsView;

 

    private static boolean showHiden = true;;

 

    private File theFile;

 

    private Vector<File> all = new Vector<File>();

 

    private Vector<File> folder = new Vector<File>();

 

    /**

     * set that whether apply hiden file.

     *

     * @param ifshow

     */

    public void setShowHiden(boolean ifshow) {

        showHiden = ifshow;

    }

 

    public Icon getIcon() {

        return fsView.getSystemIcon(theFile);

    }

 

    public String toString() {

       // return fsView.

        return fsView.getSystemDisplayName(theFile);

    }

 

    /**

     * create a root node. by default, it should be the DeskTop in window file

     * system.

     *

     */

    public FolderNode() {

        fsView = FileSystemView.getFileSystemView();

        theFile = fsView.getHomeDirectory();

        prepareChildren();

    }

 

    private void prepareChildren() {

      File[] files = fsView.getFiles(theFile, showHiden);

 

       for (int i = 0; i < files.length; i++) {

           all.add(files[i]);

           if (files[i].isDirectory()

                   && !files[i].toString().toLowerCase().endsWith(".lnk")) {

 

               folder.add(files[i]);

           }

       }

    }

 

    private FolderNode(File file) {

        theFile = file;

        prepareChildren();

    }

 

    public FolderNode getChild(char fileType, int index) {

       if (I_fileSystem.DIRECTORY == fileType) {

           return new FolderNode(folder.get(index));

       } else if (I_fileSystem.ALL == fileType) {

           return new FolderNode(all.get(index));

       } else if (I_fileSystem.FILE == fileType) {

           return null;

       } else {

           return null;

       }

 

    }

 

    public int getChildCount(char fileType) {

       if (I_fileSystem.DIRECTORY == fileType) {

           return folder.size();

       } else if (I_fileSystem.ALL == fileType) {

           return all.size();

       } else if (I_fileSystem.FILE == fileType) {

           return -1;

       } else {

           return -1;

       }

    }

 

    public boolean isLeaf(char fileType) {

       if (I_fileSystem.DIRECTORY == fileType) {

           return folder.size() == 0;

       } else if (I_fileSystem.ALL == fileType) {

           return all.size() == 0;

       } else if (I_fileSystem.FILE == fileType) {

           return true;

       } else {

           return true;

       }

    }

 

    public int getIndexOfChild(char fileType, Object child) {

       if (child instanceof FolderNode) {

           if (I_fileSystem.DIRECTORY == fileType) {

               return folder.indexOf(((FolderNode) child).theFile);

           } else if (I_fileSystem.ALL == fileType) {

               return all.indexOf(((FolderNode) child).theFile);

           } else if (I_fileSystem.FILE == fileType) {

               return -1;

           } else {

               return -1;

           }

       } else {

           return -1;

       }

    }

}

 

class FolderRenderer extends DefaultTreeCellRenderer {

    private static final long serialVersionUID = 1L;

    public Component getTreeCellRendererComponent(JTree tree, Object value,

           boolean sel, boolean expanded, boolean leaf, int row,

           boolean hasFocus) {

 

        I_fileSystem node = (I_fileSystem) value;

       Icon icon = node.getIcon();

 

        setLeafIcon(icon);

        setOpenIcon(icon);

        setClosedIcon(icon);

 

        return super.getTreeCellRendererComponent(tree, value, sel, expanded,

              leaf, row, hasFocus);

    }

}

  • 1
    点赞
  • 7
    收藏
    觉得还不错? 一键收藏
  • 10
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 10
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值