Index: /issm/trunk-jpl/src/c/bamg/Mesh.cpp
===================================================================
--- /issm/trunk-jpl/src/c/bamg/Mesh.cpp	(revision 22212)
+++ /issm/trunk-jpl/src/c/bamg/Mesh.cpp	(revision 22213)
@@ -1134,5 +1134,5 @@
 
 	}/*}}}*/
-	void  Mesh::BoundAnisotropy(double anisomax,double hminaniso) {/*{{{*/
+	void Mesh::BoundAnisotropy(double anisomax,double hminaniso) {/*{{{*/
 		/*Original code from Frederic Hecht <hecht@ann.jussieu.fr> (BAMG v1.01, Metric.cpp/BoundAnisotropy)*/
 
@@ -2335,10 +2335,10 @@
 		/*Original code from Frederic Hecht <hecht@ann.jussieu.fr> (BAMG v1.01, Mesh2.cpp/FindSubDomain)*/
 
-		long int verbose=0;
+		int verbose=0;
 
 		if (verbose >2){
 			if (OutSide) _printf_("   Find all external sub-domain\n"); 
 			else _printf_("   Find all internal sub-domain\n");
-		  }
+		}
 		short * HeapArete = new short[nbt];
 		Triangle  **  HeapTriangle = new Triangle*  [nbt];
@@ -2346,10 +2346,10 @@
 		long k,it;
 
-		for (int itt=0;itt<nbt;itt++) 
-		 triangles[itt].link=0; // par defaut pas de couleur
+		/*No color by default*/
+		for(int itt=0;itt<nbt;itt++) triangles[itt].link=0;
 
 		long  NbSubDomTot =0;
-		for ( it=0;it<nbt;it++)  { 
-			if ( ! triangles[it].link  ) {
+		for(it=0;it<nbt;it++)  { 
+			if( !triangles[it].link ){
 				t = triangles + it;
 				NbSubDomTot++;; // new composante connexe
@@ -2360,6 +2360,6 @@
 				HeapArete[i] = 3;
 
-				while (i >= 0) // boucle sur la pile
-				  { while ( HeapArete[i]--) // boucle sur les 3 aretes 
+				while(i >= 0) // boucle sur la pile
+				  { while (HeapArete[i]--) // boucle sur les 3 aretes 
 					  { 
 						int na =  HeapArete[i];
@@ -2445,9 +2445,8 @@
 							_error_("k!=nbsubdomains");
 						}
-						if(OutSide) 
-						  {
+						if(OutSide){
 							//  to remove all the sub domain by parity adjacents
 							//  because in this case we have only the true boundary edge
-							// so teh boundary is manifold
+							//  so the boundary is manifold
 							long nbk = nbsubdomains;
 							while (nbk)
@@ -3084,5 +3083,5 @@
 					Triangle* ta=tadjj;
 
-					//if the adjacent triangle is a boundary triangle, continur
+					//if the adjacent triangle is a boundary triangle, continue
 					if (ta->det<0) continue;	  
 
