elementnode.java

报表设计软件,很好的

/**
 * ========================================
 * JFreeReport : a free Java report library
 * ========================================
 *
 * Project Info:  http://www.jfree.org/jfreereport/index.html
 * Project Lead:  Thomas Morgner ([e-mail]);
 *
 * (C) Copyright 2000-2003, by Simba Management Limited and Contributors.
 *
 * This library is free software; you can redistribute it and/or modify it under the terms
 * of the GNU Lesser General Public License as published by the Free Software Foundation;
 * either version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY;
 * without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
 * See the GNU Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public License along with this
 * library; if not, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330,
 * Boston, MA 02111-1307, USA.
 *
 * ------------------------------
 * ElementNode.java
 * ------------------------------
 * (C)opyright 2003, by Thomas Morgner and Contributors.
 *
 * Original Author:  Thomas Morgner;
 * Contributor(s):   David Gilbert (for Simba Management Limited);
 *
 * $Id: ElementNode.java,v 1.2 2004/04/20 18:55:02 taqua Exp $
 *
 * Changes
 * -------------------------
 * 21.10.2003 : Initial version
 *
 */

package org.jfree.designer.visualeditor.treemodel;

import java.util.Enumeration;
import javax.swing.tree.TreeNode;

import org.jfree.report.Element;

public class ElementNode
        implements TreeNode
{
  private final Element element;
  private final TreeNode rootNode;
  private final String role;

  public ElementNode (final TreeNode rootNode, final Element element, final String role)
  {
    this.element = element;
    this.rootNode = rootNode;
    this.role = role;
  }

  /**
   * Returns the children of the receiver as an <code>Enumeration</code>.
   */
  public Enumeration children ()
  {
    return ArrayEnumeration.EMPTY_ENUMERATION;
  }

  /**
   * Returns true if the receiver allows children.
   */
  public boolean getAllowsChildren ()
  {
    return false;
  }

  /**
   * Returns the child <code>TreeNode</code> at index <code>childIndex</code>.
   */
  public TreeNode getChildAt (final int childIndex)
  {
    return null;
  }

  /**
   * Returns the number of children <code>TreeNode</code>s the receiver contains.
   */
  public int getChildCount ()
  {
    return 0;
  }

  /**
   * Returns the index of <code>node</code> in the receivers children. If the receiver
   * does not contain <code>node</code>, -1 will be returned.
   */
  public int getIndex (final TreeNode node)
  {
    return -1;
  }

  /**
   * Returns the parent <code>TreeNode</code> of the receiver.
   */
  public final TreeNode getParent ()
  {
    return rootNode;
  }

  /**
   * Returns true if the receiver is a leaf.
   */
  public boolean isLeaf ()
  {
    return true;
  }

  public final Element getElement ()
  {
    return element;
  }

  protected boolean isAnonymousElement ()
  {
    return (element.getName().startsWith(Element.ANONYMOUS_ELEMENT_PREFIX));
  }

  public final String toString ()
  {
    final StringBuffer buffer = new StringBuffer();
    if (role != null)
    {
      buffer.append(role);
      buffer.append(": ");
    }

    if (isAnonymousElement())
    {
      buffer.append("<");
      buffer.append(element.getName());
      buffer.append(">");
    }
    else
    {
      buffer.append(getElement().getName());
    }
    return buffer.toString();
  }
}