bandnode.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.
 *
 * ------------------------------
 * ReportDefinitionNode.java
 * ------------------------------
 * (C)opyright 2003, by Thomas Morgner and Contributors.
 *
 * Original Author:  Thomas Morgner;
 * Contributor(s):   David Gilbert (for Simba Management Limited);
 *
 * $Id: BandNode.java,v 1.2 2004/04/20 18:55:02 taqua Exp $
 *
 * Changes
 * -------------------------
 * 20.10.2003 : Initial version
 *
 */

package org.jfree.designer.visualeditor.treemodel;

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

import org.jfree.report.Band;
import org.jfree.report.Element;

public final class BandNode
        extends ElementNode
{
  private final ElementNode[] nodes;

  public BandNode (final TreeNode rootNode, final Band band, final String role)
  {
    super(rootNode, band, role);

    final Element[] elements = band.getElementArray();
    nodes = new ElementNode[elements.length];
    for (int i = 0; i < elements.length; i++)
    {
      if (elements[i] instanceof Band)
      {
        nodes[i] = new BandNode(this, (Band) elements[i], "Band");
      }
      else
      {
        nodes[i] = new ElementNode(this, elements[i], "Element");
      }
    }
  }

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

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

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

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

  /**
   * 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 final int getIndex (final TreeNode node)
  {
    for (int i = 0; i < nodes.length; i++)
    {
      if (node == nodes[i])
      {
        return i;
      }
    }
    return -1;
  }

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

  protected final boolean isAnonymousElement ()
  {
    return (getElement().getName().startsWith(Band.ANONYMOUS_BAND_PREFIX));
  }
}