contingencyentry.java

一个数据挖掘软件ALPHAMINERR的整个过程的JAVA版源代码

/*
 *    This program 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.
 *
 *    This program 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 General Public License for more details.
 *
 *    You should have received a copy of the GNU General Public License
 *    along with this program; if not, write to the Free Software
 *    Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 */

/**
 * Title: XELOPES Data Mining Library
 * Description: The XELOPES library is an open platform-independent and data-source-independent library for Embedded Data Mining.
 * Copyright: Copyright (c) 2002 Prudential Systems Software GmbH
 * Company: ZSoft (www.zsoft.ru), Prudsys (www.prudsys.com)
 * @author Valentine Stepanenko ([e-mail])
 * @author Victor Borichev
 * @version 1.0
 */

package com.prudsys.pdm.Models.Statistics;

public class ContingencyEntry extends com.prudsys.pdm.Cwm.Core.ModelElement
{
  double firstValue, secondValue;
  long count;

  public ContingencyEntry(double firstValue, double secondValue) {
    this.firstValue = firstValue;
    this.secondValue = secondValue;
    count = 0l;
  }
  public double getFirstValue() {
    return firstValue;
  }
  public void setFirstValue(double firstValue) {
    this.firstValue = firstValue;
  }
  public double getSecondValue() {
    return secondValue;
  }
  public void setSecondValue(double secondValue) {
    this.secondValue = secondValue;
  }
  public long getCount() {
    return count;
  }
  public void setCount(long count) {
    this.count = count;
  }

  public void increment() {
    count++;
  }
  public String toString() {
    return new String(firstValue+" - "+secondValue+" : "+count);
  }
  public int hashCode() {
    return (int)firstValue + (int)secondValue;
  }
  public boolean equals(Object obj) {
    if(!(obj instanceof ContingencyEntry)) return false;
    ContingencyEntry entry = (ContingencyEntry)obj;
    if(firstValue != entry.firstValue || secondValue != entry.secondValue) return false;
    return true;
  }
}