rf.h File Reference

This graph shows which files directly or indirectly include this file:

Macros
#define	isBitOn(x, pos)
#define	swapInt(a, b)
#define	F77_CALL(x)
#define	F77_NAME(x)
#define	F77_SUB(x)
#define	NODE_TERMINAL   -1
#define	NODE_TOSPLIT   -2
#define	NODE_INTERIOR   -3

Functions
void	normClassWt (int *cl, const int nsample, const int nclass, const int useWt, double *classwt, int *classFreq)
void	classForest (int *mdim, int *ntest, int *nclass, int *maxcat, int *nrnodes, int *jbt, double *xts, double *xbestsplit, double *pid, double *cutoff, double *countts, int *treemap, int *nodestatus, int *cat, int *nodeclass, int *jts, int *jet, int *bestvar, int *nodexts, int *ndbigtree, int *keepPred, int *prox, double *proxmatrix, int *nodes)
void	regTree (double *x, double *y, int mdim, int nsample, int *lDaughter, int *rDaughter, double *upper, double *avnode, int *nodestatus, int nrnodes, int *treeSize, int nthsize, int mtry, int *mbest, int *cat, double *tgini, int *varUsed)
void	findBestSplit (double *x, int *jdex, double *y, int mdim, int nsample, int ndstart, int ndend, int *msplit, double *decsplit, double *ubest, int *ndendl, int *jstat, int mtry, double sumnode, int nodecnt, int *cat)
void	predictRegTree (double *x, int nsample, int mdim, int *lDaughter, int *rDaughter, int *nodestatus, double *ypred, double *split, double *nodepred, int *splitVar, int treeSize, int *cat, int maxcat, int *nodex)
void	predictClassTree (double *x, int n, int mdim, int *treemap, int *nodestatus, double *xbestsplit, int *bestvar, int *nodeclass, int ndbigtree, int *cat, int nclass, int *jts, int *nodex, int maxcat)
int	pack (int l, int *icat)
void	unpack (unsigned int npack, int *icat)
void	zeroInt (int *x, int length)
void	zeroDouble (double *x, int length)
void	createClass (double *x, int realN, int totalN, int mdim)
void	prepare (int *cl, const int nsample, const int nclass, const int ipi, double *pi, double *pid, int *nc, double *wtt)
void	makeA (double *x, const int mdim, const int nsample, int *cat, int *a, int *b)
void	modA (int *a, int *nuse, const int nsample, const int mdim, int *cat, const int maxcat, int *ncase, int *jin)
void	Xtranslate (double *x, int mdim, int nrnodes, int nsample, int *bestvar, int *bestsplit, int *bestsplitnext, double *xbestsplit, int *nodestatus, int *cat, int treeSize)
void	permuteOOB (int m, double *x, int *in, int nsample, int mdim)
void	computeProximity (double *prox, int oobprox, int *node, int *inbag, int *oobpair, int n)

Macro Definition Documentation

F77_CALL

#define F77_CALL

(

x

)

Value:

x ## _

F77_NAME

#define F77_NAME

(

x

)

Value:

F77_CALL(x)

F77_SUB

#define F77_SUB

(

x

)

Value:

F77_CALL(x)

isBitOn

#define isBitOn	(		x,
			pos )

Value:

(((x) & (1 << (pos))) > 0)

NODE_INTERIOR

#define NODE_INTERIOR   -3

Referenced by regTree().

NODE_TERMINAL

#define NODE_TERMINAL   -1

Referenced by predictClassTree(), predictRegTree(), and regTree().

NODE_TOSPLIT

#define NODE_TOSPLIT   -2

Referenced by regTree().

swapInt

#define swapInt	(		a,
			b )

Value:

((a ^= b), (b ^= a), (a ^= b))

Referenced by classRF().

Function Documentation

classForest()

void classForest	(	int *	mdim,
		int *	ntest,
		int *	nclass,
		int *	maxcat,
		int *	nrnodes,
		int *	jbt,
		double *	xts,
		double *	xbestsplit,
		double *	pid,
		double *	cutoff,
		double *	countts,
		int *	treemap,
		int *	nodestatus,
		int *	cat,
		int *	nodeclass,
		int *	jts,
		int *	jet,
		int *	bestvar,
		int *	nodexts,
		int *	ndbigtree,
		int *	keepPred,
		int *	prox,
		double *	proxmatrix,
		int *	nodes )

computeProximity()

void computeProximity	(	double *	prox,
		int	oobprox,
		int *	node,
		int *	inbag,
		int *	oobpair,
		int	n )

References n.

Referenced by classForest(), classRF(), regForest(), and regRF().

Here is the caller graph for this function:

createClass()

void createClass	(	double *	x,
		int	realN,
		int	totalN,
		int	mdim )

References unif_rand().

Referenced by classRF().

Here is the call graph for this function:

Here is the caller graph for this function:

findBestSplit()

void findBestSplit	(	double *	x,
		int *	jdex,
		double *	y,
		int	mdim,
		int	nsample,
		int	ndstart,
		int	ndend,
		int *	msplit,
		double *	decsplit,
		double *	ubest,
		int *	ndendl,
		int *	jstat,
		int	mtry,
		double	sumnode,
		int	nodecnt,
		int *	cat )

References imax2(), in_findBestSplit, pack(), R_qsort_I(), swapInt, unif_rand(), zeroDouble(), and zeroInt().

Referenced by regRF(), and regTree().

Here is the call graph for this function:

Here is the caller graph for this function:

makeA()

void makeA	(	double *	x,
		const int	mdim,
		const int	nsample,
		int *	cat,
		int *	a,
		int *	b )

References R_qsort_I().

Referenced by classRF().

Here is the call graph for this function:

Here is the caller graph for this function:

modA()

void modA	(	int *	a,
		int *	nuse,
		const int	nsample,
		const int	mdim,
		int *	cat,
		const int	maxcat,
		int *	ncase,
		int *	jin )

Referenced by classRF().

Here is the caller graph for this function:

normClassWt()

void normClassWt	(	int *	cl,
		const int	nsample,
		const int	nclass,
		const int	useWt,
		double *	classwt,
		int *	classFreq )

Referenced by classRF().

Here is the caller graph for this function:

pack()

int pack	(	int	l,
		int *	icat )

References pack().

Referenced by catmax(), catmaxb(), findBestSplit(), pack(), pack(), unpack(), and unpack().

Here is the call graph for this function:

Here is the caller graph for this function:

permuteOOB()

void permuteOOB	(	int	m,
		double *	x,
		int *	in,
		int	nsample,
		int	mdim )

References unif_rand().

Referenced by classRF(), and regRF().

Here is the call graph for this function:

Here is the caller graph for this function:

predictClassTree()

void predictClassTree	(	double *	x,
		int	n,
		int	mdim,
		int *	treemap,
		int *	nodestatus,
		double *	xbestsplit,
		int *	bestvar,
		int *	nodeclass,
		int	ndbigtree,
		int *	cat,
		int	nclass,
		int *	jts,
		int *	nodex,
		int	maxcat )

References n, NODE_TERMINAL, and zeroInt().

Referenced by classForest(), and classRF().

Here is the call graph for this function:

Here is the caller graph for this function:

predictRegTree()

void predictRegTree	(	double *	x,
		int	nsample,
		int	mdim,
		int *	lDaughter,
		int *	rDaughter,
		int *	nodestatus,
		double *	ypred,
		double *	split,
		double *	nodepred,
		int *	splitVar,
		int	treeSize,
		int *	cat,
		int	maxcat,
		int *	nodex )

References n.

prepare()

void prepare	(	int *	cl,
		const int	nsample,
		const int	nclass,
		const int	ipi,
		double *	pi,
		double *	pid,
		int *	nc,
		double *	wtt )

References n.

regTree()

void regTree	(	double *	x,
		double *	y,
		int	mdim,
		int	nsample,
		int *	lDaughter,
		int *	rDaughter,
		double *	upper,
		double *	avnode,
		int *	nodestatus,
		int	nrnodes,
		int *	treeSize,
		int	nthsize,
		int	mtry,
		int *	mbest,
		int *	cat,
		double *	tgini,
		int *	varUsed )

unpack()

void unpack	(	unsigned int	npack,
		int *	icat )

References pack().

Referenced by catmax().

Here is the call graph for this function:

Here is the caller graph for this function:

Xtranslate()

void Xtranslate	(	double *	x,
		int	mdim,
		int	nrnodes,
		int	nsample,
		int *	bestvar,
		int *	bestsplit,
		int *	bestsplitnext,
		double *	xbestsplit,
		int *	nodestatus,
		int *	cat,
		int	treeSize )

Referenced by classRF().

Here is the caller graph for this function:

zeroDouble()

void zeroDouble	(	double *	x,
		int	length )

Referenced by classForest(), classRF(), findBestSplit(), oob(), regForest(), regRF(), regTree(), and TestSetError().

Here is the caller graph for this function:

zeroInt()

void zeroInt	(	int *	x,
		int	length )

Referenced by catmax(), catmaxb(), classRF(), findBestSplit(), oob(), predictClassTree(), predictRegTree(), regForest(), regRF(), and regTree().

Here is the caller graph for this function: