nodeinfo.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.skin;

import java.util.ArrayList;
import java.util.List;

import net.sf.jsptree.WebWriter;
import net.sf.jsptree.component.JSPTreeComponent;
import net.sf.jsptree.tree.TreeNode;
import net.sf.jsptree.tree.TreeStateModel;

/**
 * @author Vladislav Kamensky
 */
public class NodeInfo {

    private JSPTreeComponent component;

    private TreeNode node;

    private TreeStateModel selectionModel;

    private WebWriter webWriter;

    private List depthVector = new ArrayList();

    boolean lastChild;

    public NodeInfo(JSPTreeComponent component, TreeNode node, TreeStateModel selectModel, WebWriter webWriter) {
        this.component = component;
        this.node = node;
        this.selectionModel = selectModel;
        this.webWriter = webWriter;
    }

    public JSPTreeComponent getComponent() {
        return component;
    }

    public void setComponent(JSPTreeComponent p_component) {
        component = p_component;
    }

    public TreeNode getNode() {
        return node;
    }

    public void setNode(TreeNode p_node) {
        node = p_node;
    }

    public WebWriter getWebWriter() {
        return webWriter;
    }

    public void setWebWriter(WebWriter p_webWriter) {
        webWriter = p_webWriter;
    }

    public List getDepthVector() {
        return depthVector;
    }

    public void setDepthVector(List p_depthVector) {
        depthVector = p_depthVector;
    }

    public boolean isLastChild() {
        return lastChild;
    }

    public void setLastChild(boolean p_lastChild) {
        lastChild = p_lastChild;
    }

    public boolean isSelected() {
        return selectionModel.isSelected(node.hashCode());
    }

    public void setSelected() {
        selectionModel.addSelected(node.hashCode());
    }

    public boolean isOpened() {
        return selectionModel.isOpened(node.hashCode());
    }

    public void setOpened() {
        selectionModel.addOpened(node.hashCode());
    }

}