dpeakset.java

著名的神经网络工具箱

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

This program is copyrighted. Please refer to COPYRIGHT.txt for the
copyright notice.

This file is part of JavaNNS.

JavaNNS is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2 of the License, or
(at your option) any later version.

JavaNNS is distributed in the hope that it will be useful,
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

You should have received a copy of the GNU General Public License
along with JavaNNS; if not, write to the Free Software
Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA

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


/**
 *  Filename: $RCSfile: DPeakSet.java,v $
 *  Purpose:
 *  Language: Java
 *  Compiler: JDK 1.3
 *  Authors:  Fabian Hennecke
 *  Version:  $Revision: 1.1.2.3 $
 *            $Date: 2005/02/03 17:52:00 $
 *            $Author: hoensela $
 *  Copyright (c) Dept. Computer Architecture, University of Tuebingen, Germany
 */

package wsi.ra.chart2d;

/*==========================================================================*
 * IMPORTS
 *==========================================================================*/

import java.awt.Color;

/*==========================================================================*
 * CLASS DECLARATION
 *==========================================================================*/

public class DPeakSet extends DContainer
{
  private double width;
  private Color fill_color = Color.lightGray;

  public DPeakSet( double width ){
    this( width, 5 );
  }

  public DPeakSet( double width, int initial_capacity ) {
    super( initial_capacity );
    if( width <= 0 ) throw
      new IllegalArgumentException("The width of the peaks has to be a positive value");
    this.width = width;
  }

  public void setFillColor( Color fill_color ){
    boolean changed = this.fill_color == fill_color;
    this.fill_color = fill_color;
    for( int i=0; i<elements.size(); i++ ){
      DElement e = (DElement)elements.get(i);
      if( e instanceof DRectangle ) ((DRectangle)e).fillColor = fill_color;
    }
    if( changed ) repaint();
  }

  public Color getFillColor(){ return fill_color; }

  public void addValue( double v ){
    boolean found = false;
    for( int i=0; i<elements.size() && !found; i++ ){
      DElement e = (DElement)elements.get(i);
      if( e instanceof DCountingPeak ){
        DCountingPeak p = (DCountingPeak)e;
        if( p.addValue( v ) ) {
          found = true;
          if( p.height > rectangle.height ) {
            rectangle.height = p.height;
            repaint();
          }
        }
      }
    }
    if( found ) return;
    double min = (int)( v / width );
    DCountingPeak p = new DCountingPeak( min, width );
    p.setColor( color );
    p.setFillColor( fill_color );
    p.addValue();
    addDElement( p );
  }
}

/**
 * this class can be used as part of a peak diagramm
 */
class DCountingPeak extends DRectangle{

  public DCountingPeak( double minx, double width ) {
    super( minx, 0, width, 0 );
    color = Color.gray;
    fillColor = Color.lightGray;
  }

  public boolean addValue(){ height++; repaint(); return true; }

  public boolean addValue( double v ){
    if( v >= x && v < x + width ){
      height++;
      repaint();
      return true;
    }
    return false;
  }

  public void reset(){
    if( height == 0 ) return;
    height = 0;
    repaint();
  }
}

/****************************************************************************
 * END OF FILE
 ****************************************************************************/