ihdrdll.h

一种快速的多叉搜索树

#ifndef IHDRDLL_H_INCLUDED
#define IHDRDLL_H_INCLUDED

#ifndef EXPORT
#define EXPORT
#endif


EXPORT int CreateTree(
			int nXdim, 
			int nYdim, 
			int q, 
			int knn, 
			int freezeW, 
			double x_quantize,  
			double y_quantize, 
			int nTreeType, 
			int bLocalBal,
			double rho2, 
			double alpha, 
			double n1, 
			double n2, 
			double c, 
			double m);
//EXPORT int CreateTree();

EXPORT int CreateTree2(
			int nXdim, 
			int nYdim, 
			int q, 
			int knn, 
			int freezeW, 
			double x_quantize,  
			double y_quantize, 
			int nTreeType, 
			double rho2, 
			double alpha, 
			double n1, 
			double n2, 
			double c, 
			double m, 
			double wx, 
			double wy, 
			int bEstimSig, 
			double sigx2, 
			double sigy2);


EXPORT void CloseTree(int Tid);

EXPORT int Clear(); 

EXPORT int AddPattern(int tid, double *pX, int sX, double *pY, int sY);
	
EXPORT int Retrieval(int tid, double *pX, int sX, 
				   double *pXout, 
				   double *pYout, int sY, 
				   double *pDist);

EXPORT int Regression2(int tid, double *pX, int sX, double *pYout1, double *pYout2, int sY, 
					  int nX1dim, int nX2dim, int knn, double lambda);	

EXPORT int Regression(int tid, double *pX, int sX, double *pYout, int sY, int knn, double lambda);
	
EXPORT int Read(int tid, char *fname);
	
EXPORT int Write(int tid, char *fname);

EXPORT int GetXdim(int tid);

EXPORT int GetYdim(int tid);

#endif