extl2.h,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
@#ifndef __EXT_H_
#define __EXT_H_
#include "assoc.h"
#include "Array.h"
#include "calcdb.h"

class invdb: public Array<Array<int> *>{
public:
   invdb(int sz);
   ~invdb();
   void add_db(int tid, int it);
};

extern int make_l1_pass(Dbase_Ctrl_Blk &DCB);
extern int make_l2_pass(boolean ext_l2_pass, char *it2f, Dbase_Ctrl_Blk &DCB);

#endif //__EXT_H_
@