Changeset 3263 for issm/trunk/src/c/Bamgx/objects/QuadTree.cpp

Timestamp:

03/11/10 15:13:57 (15 years ago)

Author:

Mathieu Morlighem

Message:

Big reorg

File:

• issm/trunk/src/c/Bamgx/objects/QuadTree.cpp (modified) (4 diffs)

issm/trunk/src/c/Bamgx/objects/QuadTree.cpp

@@ -4 +4 @@
 
 //#include "QuadTree.h"
-#include "../BamgObjects.h"
+#include "BamgObjects.h"
 
 #undef __FUNCT__ 
@@ -11 +11 @@
 namespace bamg {
 
-        //INTER_SEG(a,b,x,y) returns 1 if [x y] is included in [a b]
+        /*MACROS {{{1*/
 #define INTER_SEG(a,b,x,y) (((y) > (a)) && ((x) <(b)))
-        //ABS(i) retruns |i|
 #define ABS(i) ((i)<0 ?-(i) :(i))
-        //MAX1(i,j) returns max(i,j)
 #define MAX1(i,j) ((i)>(j) ?(i) :(j))
-        //NORM(i1,j1,i2,j2) returns max(|i1-j1|,|i2-j2|)
 #define NORM(i1,j1,i2,j2) MAX1(ABS((i1)-(j1)),ABS((i2)-(j2)))
         //IJ(i,j,l) returns the box number of i and j with respect to l
@@ -29 +26 @@
         //J_IJ(k,l) returns l if second bit of k is 1, else 0
 #define J_IJ(k,l)  ((k&2) ? l:0)
-
-        /*What is a QuadTree?
+        /*}}}*/
+        /*DOCUMENTATION What is a QuadTree? {{{1
          * A Quadtree is a very simple way to group the vertices according
          * to their location. A square that holds all the points of the mesh
@@ -76 +73 @@
          * Using the binaries is therefor very easy to locate a vertex in a box:
          * we just need to look at the bits from the left to the right (See ::Add)
-         */
+         }}}1*/
 
         /*Constructors/Destructors*/