count.h,v

来自「charm是基于垂直数据集挖掘关联规则的一个著名算法」· H,V 代码 · 共 44 行

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


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


desc
@Charm with Hashing.
@


1.1
log
@Initial revision
@
text
@#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();
};
@