util.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 _UTIL_H
#define _UTIL_H

//#ifdef __GNUC__
//#pragma interface
//#endif

#include "assoc.h"

template <class Items>
class Util{
public:
   static boolean Bsearch(int min, int max, Items *itary, Items it,
                          CMPFUNC cfunc, int& ret);
   static int Realloc (int newlen, int elsz, Items*&ary);
};

int Choose(int n, int k);
#endif //_UTIL_H
@