Changeset 12216
- Timestamp:
- 05/07/12 10:11:02 (13 years ago)
- Location:
- issm/trunk-jpl/src/c/objects
- Files:
-
- 4 edited
Legend:
- Unmodified
- Added
- Removed
-
issm/trunk-jpl/src/c/objects/Bamg/QuadTree.cpp
r6412 r12216 179 179 } 180 180 181 /*check that l is not 0 (this should not happen as MaxDe ep= 30)*/181 /*check that l is not 0 (this should not happen as MaxDepth = 30)*/ 182 182 _assert_(level>0); 183 183 … … 236 236 237 237 /*Intermediaries*/ 238 QuadTreeBox *pb[MaxDe ep];239 int pi[MaxDe ep];240 Icoor1 ii[MaxDe ep];241 Icoor1 jj[MaxDe ep];238 QuadTreeBox *pb[MaxDepth]; 239 int pi[MaxDepth]; 240 Icoor1 ii[MaxDepth]; 241 Icoor1 jj[MaxDepth]; 242 242 int level; 243 243 long n0; … … 394 394 /*Original code from Frederic Hecht <hecht@ann.jussieu.fr> (BAMG v1.01, QuadTree.cpp/NearestVertexWithNormal)*/ 395 395 396 QuadTreeBox * pb[ MaxDe ep];397 int pi[ MaxDe ep];398 Icoor1 ii[ MaxDe ep ], jj [ MaxDeep];396 QuadTreeBox * pb[ MaxDepth ]; 397 int pi[ MaxDepth ]; 398 Icoor1 ii[ MaxDepth ], jj [ MaxDepth]; 399 399 int l; // level 400 400 QuadTreeBox * b; … … 530 530 const Metric Mx(v.m); 531 531 532 QuadTreeBox * pb[ MaxDe ep];533 int pi[ MaxDe ep];534 Icoor1 ii[ MaxDe ep ], jj [ MaxDeep];532 QuadTreeBox * pb[ MaxDepth ]; 533 int pi[ MaxDepth ]; 534 Icoor1 ii[ MaxDepth ], jj [ MaxDepth]; 535 535 register int l=0; // level 536 536 register QuadTreeBox * b; -
issm/trunk-jpl/src/c/objects/Bamg/QuadTree.h
r12014 r12216 7 7 namespace bamg { 8 8 9 const int MaxDe ep= 30;10 const long MaxISize = ( 1L << MaxDe ep); // = 2^30 : 010000000000..000 (bitwise operation)9 const int MaxDepth = 30; 10 const long MaxISize = ( 1L << MaxDepth); // = 2^30 : 010000000000..000 (bitwise operation) 11 11 12 12 class BamgVertex; -
issm/trunk-jpl/src/c/objects/Kriging/Quadtree.cpp
r12213 r12216 83 83 Quadtree::Quadtree(){ 84 84 85 /*Number of boxes and vertices*/ 86 NbQuadtreeBox=0; 87 NbObs=0; 85 /*Initialize fields*/ 86 this->MaxDepth=30; 87 this->NbQuadtreeBox=0; 88 this->NbObs=0; 88 89 89 90 /*Create container*/ 90 boxcontainer=new DataSet();91 this->boxcontainer=new DataSet(); 91 92 92 93 /*Create Root, pointer toward the main box*/ 93 root=NewQuadtreeBox();94 this->root=NewQuadtreeBox(); 94 95 95 96 } 96 97 /*}}}1*/ 97 98 /*FUNCTION Quadtree::~Quadtree(){{{1*/ 98 Quadtree::~Quadtree() 99 Quadtree::~Quadtree(){ 99 100 100 101 delete boxcontainer; … … 109 110 110 111 /*Intermediaries*/ 111 const int MaxDeep = 30;112 112 int xi,yi,ij,level; 113 113 QuadtreeBox **pb = NULL; … … 121 121 122 122 /*Initialize level*/ 123 level=(1L<< MaxDeep);// = 2^30123 level=(1L<<this->MaxDepth);// = 2^30 124 124 125 125 /*Get inital box (the largest)*/ … … 189 189 190 190 printf("Quadtree:\n"); 191 printf(" MaxDepth = %i\n",MaxDepth); 191 192 printf(" NbQuadtreeBox = %i\n",NbQuadtreeBox); 192 193 printf(" NbObs = %i\n",NbObs); … … 218 219 void Quadtree::QuadtreeColoring(double* A,int *xi,int *yi,int n){ 219 220 220 const int MaxDeep = 30;221 221 QuadtreeBox **pb = NULL; 222 222 QuadtreeBox *b = NULL; … … 226 226 227 227 /*Initialize level*/ 228 level=(1L<< MaxDeep);// = 2^30228 level=(1L<<this->MaxDepth);// = 2^30 229 229 230 230 /*Get inital box (the largest)*/ -
issm/trunk-jpl/src/c/objects/Kriging/Quadtree.h
r12213 r12216 35 35 36 36 public: 37 QuadtreeBox* root; // main box 37 int MaxDepth; // maximum number of subdivision 38 QuadtreeBox *root; // main box 38 39 long NbQuadtreeBox; // total number of boxes 39 long NbObs; // number of points40 long NbObs; // number of points 40 41 41 42 Quadtree();
Note:
See TracChangeset
for help on using the changeset viewer.