count.h

charm是基于垂直数据集挖掘关联规则的一个著名算法

#include "Array.h"


class CountAry 
{
	Array<int> *counter;
	
public:

	CountAry(); 
	~CountAry() { delete counter; }

	void add(int i);
	void kadd(int index,int n);
   Array<int> *ctr(){ return counter; }
   
	void print();
};