statefultreemodel.java

jsp + xmｌ实现ｔｒｅｅｖｉｅｗ

/*
 * ====================================================================
 * The JSP Tree Software License, Version 1.1
 *
 * (this license is derived and fully compatible with the Apache Software
 * License - see http://www.apache.org/LICENSE.txt)
 *
 * Copyright (c) 2002-2005 jsptree.sourceforge.net . All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions
 * are met:
 *
 * 1. Redistributions of source code must retain the above copyright
 *    notice, this list of conditions and the following disclaimer.
 *
 * 2. Redistributions in binary form must reproduce the above copyright
 *    notice, this list of conditions and the following disclaimer in
 *    the documentation and/or other materials provided with the
 *    distribution.
 *
 * 3. The end-user documentation included with the redistribution,
 *    if any, must include the following acknowledgment:
 *       "This product includes software developed by
 *        jsptree.sourceforge.net (http://jsptree.sourceforge.net/)."
 *    Alternately, this acknowledgment may appear in the software itself,
 *    if and wherever such third-party acknowledgments normally appear.
 *
 * 4. The name "JSP Tree" must not be used to endorse or promote
 *    products derived from this software without prior written permission.
 *    For written permission, please contact [e-mail] .
 *
 * 5. Products derived from this software may not be called "JSP Tree",
 *    nor may "JSP Tree" appear in their name, without prior written
 *    permission of jsptree.sourceforge.net.
 *
 * THIS SOFTWARE IS PROVIDED ``AS IS'' AND ANY EXPRESSED OR IMPLIED
 * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED.  IN NO EVENT SHALL THE APACHE SOFTWARE FOUNDATION OR
 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF
 * USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
 * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT
 * OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
 * SUCH DAMAGE.
 * ====================================================================
 */
package net.sf.jsptree.tree;

import java.util.Iterator;

/**
 * @author Vladislav Kamensky
 */
public class StatefulTreeModel implements Tree {

    private TreeStructureModel tree = null;

    private TreeStateModel selectionModel = null;

    public StatefulTreeModel(TreeStructureModel tree, TreeStateModel selectionModel) {
        this.tree = tree;
        this.selectionModel = selectionModel;
    }

    // SELECTION METHODS

    public boolean openNode(Object node) {
        selectionModel.addOpened(node.hashCode());
        return true;
    }

    public boolean isNodeOpened(Object p_node) {
        return selectionModel.isOpened(p_node.hashCode());
    }

    public boolean closeNode(Object p_node) {
        selectionModel.removeOpened(p_node.hashCode());
        return true;
    }

    public boolean selectNode(Object p_nodeData) {
        unselectAllNodes();
        selectionModel.addSelected(p_nodeData.hashCode());
        return true;
    }

    public boolean isNodeSelected(Object p_node) {
        return selectionModel.isSelected(p_node.hashCode());
    }

    public void unselectAllNodes() {
        selectionModel.removeAllSelected();
    }

    public void unselectAllNodes(Object p_node) {
        selectionModel.removeSelected(p_node.hashCode());
        TreeNode parentNode = ((TreeModel) tree).getNode(p_node);
        if (parentNode.hasChildren()) {
            for (Iterator it = parentNode.getChildNodes().iterator(); it.hasNext();) {
                DefaultTreeNode a_treeNode = (DefaultTreeNode) it.next();
                unselectAllNodes(a_treeNode);
            }
        }
    }

    public void closeAllNodes(Object p_node) {
        TreeNode parentNode = ((TreeModel) tree).getNode(p_node);
        if (parentNode.hasChildren()) {
            selectionModel.removeOpened(p_node.hashCode());
        }
        if (parentNode.hasChildren()) {
            for (Iterator it = parentNode.getChildNodes().iterator(); it.hasNext();) {
                DefaultTreeNode a_treeNode = (DefaultTreeNode) it.next();
                closeAllNodes(a_treeNode);
            }
        }
    }

    public boolean unselectNode(Object p_nodeData) {
        selectionModel.removeSelected(p_nodeData.hashCode());
        return true;
    }

    public void closeAllNodes() {
        selectionModel.removeAllOpened();
    }

    // END SELECTION METHODS

    public String getName() {
        return tree.getName();
    }

    public void setName(String p_name) {
        tree.setName(p_name);
    }

    public TreeNode getRootNode() {
        return tree.getRootNode();
    }

    public void setRoot(Object root) {
        tree.setRoot(root);
    }

    public boolean addChildToRoot(Object child) {
        return tree.addChildToRoot(child);
    }

    public boolean addChildToParent(Object parent, Object child) {
        return tree.addChildToParent(parent, child);
    }

    public boolean removeNode(Object node) {
        return tree.removeNode(node);
    }

    public boolean isLeaf(Object node) {
        return tree.isLeaf(node);
    }

    public int getChildCount(Object parent) {
        return tree.getChildCount(parent);
    }

    public int getMaxDepth() {
        return tree.getMaxDepth();
    }

    public Object clone() throws CloneNotSupportedException {
        return tree.clone();
    }
}