stats.h,v

关联规则中的频繁项集生成算法TreeMiner

head	1.1;
access;
symbols;
locks
	zaki:1.1; strict;
comment	@ * @;


1.1
date	2001.06.06.00.04.45;	author zaki;	state Exp;
branches;
next	;


desc
@@


1.1
log
@Initial revision
@
text
@#ifndef __STATS_H
#define __STATS_H

#include<iostream.h>
#include<vector>

class iterstat{
public:
   iterstat(int nc=0, int nl=0, double tt=0.0,double aa=0.0):
      numcand(nc),numlarge(nl),time(tt),avgtid(aa){}
   int numcand;
   int numlarge;
   double time;
   double avgtid;
};
 
class Stats: public vector<iterstat>{
public:
   static double sumtime;
   static int sumcand;
   static int sumlarge;
   static double tottime;

   //Stats();

   void add(iterstat &is);
   void add(int cand, int freq, double time, double avgtid=0.0);
   void incrcand(int pos, int ncand=1);
   void incrlarge(int pos, int nlarge=1);
   void incrtime(int pos, double ntime);
   friend ostream& operator << (ostream& fout, Stats& stats);
};

#endif
@