count.cc,v

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

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 "Count.h"

CountAry::CountAry() {
	counter=new Array<int> (1) ;
	counter->add(0);
}

void CountAry::add(int i) {
	int j;

	if(counter->size()<i){
		for(j=0;i!=counter->size();j++) {
			counter->add(0);
		}
	}

	(*counter)[i-1]++;
	
}

void CountAry::kadd(int i,int k) {
	int j;

	if(counter->size()<i){
		for(j=0;i!=counter->size();j++) {
			counter->add(0);
		}
	}
	
	(*counter)[i-1]=k;
	
}



void CountAry::print() {
	int k,c=0;

	for(k=0;k<counter->size();k++) {
		//cout << "Length " << k+1 << " :" << (*counter)[k] << endl;
                cout << (*counter)[k] << " ";
		c+= (*counter)[k];
	}
	cout << c << endl;
}
@