2 // #include "TMatrixD.h"
3 // #include "TRandom.h"
5 // #include "TStopwatch.h"
12 static struct mallinfo memdebug;
13 memdebug = mallinfo();
14 return memdebug.uordblks/1000;
19 void testindexes(Int_t nloop, Int_t npoints);
20 void testkdtreeIF(Int_t npoints=1000, Int_t nloop=1000, Int_t mode = 1, Int_t bsize=9);
21 void TestSizeIF(Int_t npoints=1000, Int_t nrows = 150, Int_t nsec=18, Int_t mode = 1, Int_t bsize=9);
25 void testindexes(Int_t nloop, Int_t npoints){
29 TKDTree<Int_t, Float_t> *kdtree = new TKDTree<Int_t, Float_t>(0,0,0,0);
35 for (Int_t iloop=0;iloop<nloop;iloop++)
36 for (Int_t index=1;index<npoints;index++){
37 //row = TMath::Log2(index);
39 // if (index< (16<<row)) row=0;
40 // for (; index>=(32<<row);row+=5);
41 // for (; index>=(2<<row);row++);
42 // collumn= index-(1<<row);
43 TKDTree<Int_t, Float_t>::GetCoord(index,row,collumn);
45 //Int_t index2=kdtree->GetIndex(row,collumn);
46 //printf("%d\t%d\t%d\t%d\n",index,index2,row,collumn);
47 if (kdtree->GetIndex(row,collumn)!=index || collumn<0) {
55 void TestBuild(Int_t npoints, Int_t bsize){
56 Float_t *data0 = new Float_t[npoints*2];
59 data[1] = &data0[npoints];
60 for (Int_t i=0;i<npoints;i++) {
61 data[1][i]= gRandom->Rndm();
62 data[0][i]= gRandom->Rndm();
67 TKDTreeIF *kdtree = new TKDTreeIF(npoints, 2, bsize, data);
69 for (Int_t i=0; i<npoints;i++){
70 Int_t index = kdtree->fIndPoints[i];
71 //printf("%d\t%d\t%f\n",i,index,data[0][index]);
73 for (Int_t i=0; i<kdtree->fNnodes;i++){
74 //printf("%d\t%f\n",i,kdtree->fNodes[i].fValue);
77 for (Int_t i=0;i<npoints;i++){
78 dataf[0] = data[0][i];
79 dataf[1] = data[1][i];
82 kdtree->FindPoint(dataf,index, iter);
84 printf("%d\t%d\t%f\t%f\n",i,index,dataf[0],data[0][index]);
88 printf("Mean iter = %f\n",float(sumiter)/float(npoints));
92 void TestSizeIF(Int_t npoints, Int_t nrows, Int_t nsec, Int_t mode, Int_t bsize)
95 // test size to build kdtree
98 for (Int_t isec=0; isec<nsec;isec++)
99 for (Int_t irow=0;irow<nrows;irow++){
100 testkdtreeIF(npoints,0,mode,bsize);
103 printf("Memory usage %d\n",after-before);
107 void testkdtreeIF(Int_t npoints, Int_t nloop, Int_t mode, Int_t bsize)
110 // test speed and functionality of kdtree
112 Float_t rangey = 100;
113 Float_t rangez = 100;
114 Float_t drangey = 0.1;
115 Float_t drangez = 0.1;
116 // Float_t rangey = 20;
117 // Float_t rangez = 250;
118 // Float_t drangey = 1;
119 // Float_t drangez = 1;
122 Float_t *data0 = new Float_t[npoints*2];
125 data[1] = &data0[npoints];
127 for (i=0; i<npoints; i++){
128 data[0][i] = gRandom->Uniform(-rangey, rangey);
129 data[1][i] = gRandom->Uniform(-rangez, rangez);
130 // data[i+npoints] = TMath::Nint(gRandom->Uniform(-rangez, rangez)/10.)*10.;
131 //printf("%d %f %f\n", i, data[i], data[i+npoints]);
133 TStopwatch timerbuild;
134 TKDTree<Int_t, Float_t> *kdtree = new TKDTree<Int_t, Float_t>(npoints,2,bsize,data);
141 Float_t counteriter = 0;
142 Float_t counterfound = 0;
146 if (nloop) timer.Start();
149 for (Int_t kloop = 0;kloop<nloop;kloop++){
155 for (Int_t i=0;i<npoints;i++){
156 Float_t point[2]={data[0][i],data[1][i]};
157 Float_t delta[2]={drangey,drangez};
161 //kdtree->FindBNode(point,delta, bnode);
163 kdtree->FindInRangeA(point,delta,res,nfound,iter,bnode);
165 //Bool_t isOK = kTRUE;
166 Bool_t isOK = kFALSE;
167 for (Int_t ipoint=0;ipoint<nfound;ipoint++)
168 if (res[ipoint]==i) isOK =kTRUE;
170 counterfound+=nfound;
186 counteriter/=npoints;
187 counterfound/=npoints;
188 if (nloop) printf("Find nearest point:\t%f\t%f\t%f\n",countern, counteriter, counterfound);