Index: /issm/trunk/src/c/Bamgx/Mesh2.cpp
===================================================================
--- /issm/trunk/src/c/Bamgx/Mesh2.cpp	(revision 2801)
+++ /issm/trunk/src/c/Bamgx/Mesh2.cpp	(revision 2802)
@@ -42,11 +42,4 @@
 
 namespace bamg {
-
-
-#ifdef DEBUG1
-	extern int SHOW ; // for debugging 
-	int SHOW = 0; // for debugging 
-
-#endif
 
 	int  Triangles::counter = 0;
@@ -146,8 +139,4 @@
 			int ap1 = PreviousEdge[a1];
 			int ap2 = PreviousEdge[a2];
-#ifdef DEBUG1
-			t1->check();
-			t2->check();
-#endif
 			(*t1)(VerticesOfTriangularEdge[a1][1]) = s2 ; // avant sb
 			(*t2)(VerticesOfTriangularEdge[a2][1]) = s1  ; // avant sa
@@ -157,8 +146,4 @@
 							 tas1(t1,as1), tas2(t2,as2),
 							 ta1(t1,a1),ta2(t2,a2);
-#ifdef DEBUG
-			assert( ! ta1.Locked());
-			assert( ! ta2.Locked());
-#endif
 			// externe haut gauche
 			taas1.SetAdj2(ta2, taas1.GetAllFlag_UnSwap());
@@ -176,8 +161,4 @@
 			t1->SetTriangleContainingTheVertex();
 			t2->SetTriangleContainingTheVertex();
-#ifdef DEBUG1
-			t1->check();
-			t2->check();
-#endif
 		} // end swap 
 
@@ -263,7 +244,4 @@
 		{
 			// turn around  the vertex ns[i] also call  s
-#ifdef DEBUG
-			register Vertex * s  =  ns[i];
-#endif
 			Triangle   *t = (Triangle *) this , *ttc;
 			int k=0,j = EdgesVertexTriangle[i][0],jc;
@@ -274,7 +252,4 @@
 				int exterieurp = exterieur;
 				k++; 
-#ifdef DEBUG
-				assert( s == & (*t)[VerticesOfTriangularEdge[j][1]] );
-#endif
 				ttc =  t->at[j];
 				exterieur = !ttc->link;
@@ -673,9 +648,4 @@
 								dt[1]=bamg::det((*t)[2],(*t)[0],b);
 								dt[2]=bamg::det((*t)[0],(*t)[1],b);
-#ifdef DEBUG 
-								assert(dt[0] >= 0);
-								assert(dt[1] >= 0);
-								assert(dt[2] >= 0);
-#endif
 								Real8 dd = t->det;
 								NewItem(t,dt[0]/dd,dt[1]/dd,dt[2]/dd);      
@@ -728,8 +698,4 @@
 				if ((v=(*tt)(2))) m2    = v->m;
 				lIntTria[Size].m =  Metric(lIntTria[Size].bary,m0,m1,m2);
-#ifdef DEBUG1
-				if(SHOW) { cout << "SHOW       ++ NewItem =" << Size << x ;
-					cout << " " << d0 << " " << d1 << " " << d2 <<endl;}
-#endif
 					n=Size++;}
 			else n=Size-1;
@@ -743,7 +709,4 @@
 				lIntTria[Size].x=A;
 				lIntTria[Size].m=mm;
-#ifdef DEBUG1
-				if (SHOW)  cout << "SHOW       ++ NewItem A" << Size << A << endl;
-#endif
 				n=Size++;
 			}
@@ -836,17 +799,7 @@
 				sx =lIntTria[ii1].s;
 				Metric Mx=lIntTria[ii1].m;
-#ifdef DEBUG    
-				double lx = lIntTria[ii-1].sn;
-#endif
 				y  =lIntTria[ii].x;
 				sy =lIntTria[ii].s;
 				Metric My=lIntTria[ii].m;
-#ifdef DEBUG    
-				double ly =lIntTria[ii].sp;  
-				assert( sx <= si);
-				assert( si <= sy);
-				assert( sy != sx);
-#endif 
-
 				Real8 lxy = sy-sx;
 				Real8 cy = abscisseInterpole(Mx,My,y-x,(si-sx)/lxy);
@@ -863,13 +816,4 @@
 						cout << "   -- Add point " << nbv-1 << " " << vertices[nbv-1] << " " << vertices[nbv-1].m << endl;
 
-#ifdef DEBUG
-					if(k>1) {
-						R2 AB = vertices[nbv-2].r - vertices[nbv-1].r ;
-						Real8 dp = LengthInterpole(vertices[nbv-2].m,vertices[nbv-1].m,AB);
-						if (dp > 1.6) {
-							cerr << "PB calcul new Int.  points trop loin l=" << dp << " v=" << nbv-1 << " " << nbv-2 <<Mx<<My<<y-x << endl;
-						}
-					}
-#endif
 				}
 				else return nbv-nbvold;
@@ -899,35 +843,5 @@
 
 			Icoor2 dets2 = det(*pva,*pvb,s2);
-
-#ifdef DEBUG
-			Vertex & sb= (*t1)[VerticesOfTriangularEdge[a1][1]];
-			Icoor2 wdets1 = det(*pva,*pvb,s1);  
-			Icoor2 wdetsa = det(*pva,*pvb,sa);
-			Icoor2 wdetsb = det(*pva,*pvb,sb);
-			assert(wdets1 == dets1);
-			assert(wdetsa == detsa);
-			assert(wdetsb == detsb);
-#endif
-
 			Icoor2 det1=t1->det , det2=t2->det ;
-#ifdef DEBUG  
-			assert(det1>0 && det2 >0);
-			Icoor2 ddet1 = det((*t1)[0],(*t1)[1],(*t1)[2]);
-			Icoor2 ddet2 = det((*t2)[0],(*t2)[1],(*t2)[2]);
-			if ((det1 != ddet1) || (det2 != ddet2) )
-			{
-				assert(det1 == ddet1);
-				assert(det2 == ddet2);
-			}
-			Icoor2 detvasasb = det(*pva,sa,sb);
-			Icoor2 detvbsasb = det(*pvb,sa,sb);
-			if (  CurrentTh && !  ( ( (detvasasb <= 0) && (detvbsasb >= 0)) || ( (detvasasb >= 0) && (detvbsasb <= 0)))) 
-			{
-				cout << " detvasasb =" <<  detvasasb << "detvbsasb = " <<  detvbsasb 
-					<< " " << pva << " " << pvb << " "  <<CurrentTh <<endl;
-			}
-			assert( ( (detvasasb <= 0) && (detvbsasb >= 0)) || ( (detvasasb >= 0) && (detvbsasb <= 0)));
-#endif
-
 			Icoor2 detT = det1+det2;
 			assert((det1>0 ) && (det2 > 0));
@@ -945,18 +859,7 @@
 						ToSwap =2; 
 			}
-#ifdef DEBUG
-			if (ForDebugging) {
-				cerr << "swap = " << ToSwap << " ndet1 " << ndet1 << ", ndet2 " << ndet2 << "det1  " << det1 << " det2 " <<  det2  
-					<< " if1 = " << ((ndet1 >0) && (ndet2 >0)) 
-					<< " if2 = " << ((dets1 <=0 && dets2 <=0) || (dets2 >=0 && detsb >=0)) << endl;
-			}
-#endif
 			if (ToSwap) NbSwap++,
 				bamg::swap(t1,a1,t2,a2,&s1,&s2,ndet1,ndet2);
 
-#ifdef DEBUG
-			if (ForDebugging) {
-			}
-#endif
 			int ret=1;
 
@@ -1003,7 +906,4 @@
 		int ForceEdge(Vertex &a, Vertex & b,TriangleAdjacent & taret)  
 		{ 
-#ifdef DEBUG
-restart: // for debug 
-#endif
 			int NbSwap =0;
 			assert(a.t && b.t); // the 2 vertex is in a mesh 
@@ -1032,8 +932,4 @@
 				v2 = tc.EdgeVertex(0);
 				det1 = det2;
-#ifdef DEBUG
-				assert( v1 ==  tta.EdgeVertex(0));
-				assert( &a ==  tc.EdgeVertex(1) );
-#endif
 				det2 =  v2 ? det(*v2,a,b): det2; 
 
@@ -1045,16 +941,4 @@
 					Icoor2 detss = 0,l=0,ks;
 					// cout << "Real ForcingEdge " << *va << *vb << detss << endl;
-#ifdef DEBUG
-					Icoor2 dettt1 =  det(*v1,a,b);
-					Icoor2 dettt2 =  det(*v2,a,b);
-
-					if (!(dettt1==det1 && dettt2==det2))
-					{
-						assert(ForDebugging==0);
-						ForDebugging=1;
-						goto restart;
-					}
-
-#endif 
 					while ((ks=SwapForForcingEdge(  va,  vb, tc, detss, det1,det2,NbSwap)))
 						if(l++ > 10000000) {
@@ -1067,7 +951,4 @@
 							if ( CurrentTh ) 
 								cerr << " vertex number " << CurrentTh->Number(a) << " " <<  CurrentTh->Number(b) << endl;
-#ifdef DEBUG
-							ForDebugging = 1;
-#endif
 							MeshError(990);
 						}
@@ -1108,21 +989,9 @@
 
 		int Triangle::swap(Int2 a,int koption){
-#ifdef DEBUG
-			if(a &4 ) return 0;// arete lock 
-			int munswap1 = a/4;
-			a &=3;
-#else
 			if(a/4 !=0) return 0;// arete lock or MarkUnSwap
-#endif
 
 			register Triangle *t1=this,*t2=at[a];// les 2 triangles adjacent
 			register Int1 a1=a,a2=aa[a];// les 2 numero de l arete dans les 2 triangles
-#ifdef DEBUG
-			if(a2 & 4) return 0; // arete lock
-			int munswap2 = a2/4;
-			a2 &= 3;
-#else
 			if(a2/4 !=0) return 0; // arete lock or MarkUnSwap
-#endif
 
 			register Vertex  *sa=t1->ns[VerticesOfTriangularEdge[a1][0]];
@@ -1130,8 +999,4 @@
 			register Vertex  *s1=t1->ns[OppositeVertex[a1]];
 			register Vertex  *s2=t2->ns[OppositeVertex[a2]];
-
-#ifdef DEBUG
-			assert ( a >= 0 && a < 3 );  
-#endif
 
 			Icoor2 det1=t1->det , det2=t2->det ;
@@ -1232,12 +1097,4 @@
 				} // (! OnSwap &&(det1 > 0) && (det2 > 0) )
 			}
-#ifdef  DEBUG1   
-			if (OnSwap &&  ( munswap1  || munswap2)) {
-				cout << " erreur Mark unswap T " << CurrentTh->Number(t1) << " " <<  CurrentTh->Number(t2) << endl
-					<< *t1 << endl
-					<< *t2 << endl;
-				return 0;
-			}
-#endif 
 			if( OnSwap ) 
 				bamg::swap(t1,a1,t2,a2,s1,s2,det1,det2);
@@ -1251,7 +1108,4 @@
 		Real8  Vertex::Smoothing(Triangles & Th,const Triangles & BTh,Triangle  * & tstart ,Real8 omega)
 		{
-#ifdef DEBUG  
-			register  Int4 NbSwap =0;
-#endif
 			register Vertex * s  = this;
 			Vertex &vP = *s,vPsave=vP;
@@ -1267,8 +1121,4 @@
 				k++; 
 
-#ifdef DEBUG
-				assert( s == & (*tria)[VerticesOfTriangularEdge[j][1]] );
-				assert( tria->det >0);
-#endif
 				if (!tria->Hidden(j))
 				{
@@ -1423,12 +1273,4 @@
 							TriangleAdjacent ta = t->Adj(iedge);
 
-#ifdef DEBUG1      
-							cout << " the point " << Number(s) << " is the edge " <<  izerodet 
-								<< " of " << Number(t)	   << " det3 = " 
-								<< det3[0] << " " <<  det3[1] << " " <<  det3[2] << " " <<  endl;
-							cout  << " ta = "  <<  ta << "ta->det =" << ((Triangle*) ta)->det  
-								<< " "<< t->det<< endl;
-#endif
-
 							// the point is on the edge 
 							// if the point is one the boundary 
@@ -1505,10 +1347,4 @@
 								assert(rswap);
 							}
-
-#ifdef DEBUG 
-							tt[0]->check();
-							tt[1]->check();
-							tt[2]->check();
-#endif
 		}
 
@@ -1680,32 +1516,4 @@
 
 			NbTSwap +=  NbSwap ;
-#ifdef DEBUG
-			{  
-				Int4 NbErr=0;
-				Int4 i;
-				for (i=0;i<nbt;i++)
-					if (triangles[i].link) 
-					{
-						double dd =Det(triangles[i][1].r-triangles[i][0].r,triangles[i][2].r-triangles[i][0].r);
-						if(dd <=0) 
-						{
-							NbErr++;
-							cerr << " det triangle i " << i << " = " << triangles[i].det ;
-							cerr << " det triangle  " << dd ;
-							cerr << " Les trois sommets " ;
-							cerr << Number(triangles[i][0]) << " "  << Number(triangles[i][1]) << " " 
-								<< Number(triangles[i][2]) << endl;
-							cerr << "I2     " <<triangles[i][0].r << triangles[i][1].r << triangles[i][2].r << endl;
-							cerr << "R2     " << triangles[i][0].i << triangles[i][1].i << triangles[i][2].i << endl;
-							cerr << "I2-R2 =" <<toR2(triangles[i][0].i)-triangles[i][0].r 
-								<< toR2(triangles[i][1].i)-triangles[i][1].r
-								<< toR2(triangles[i][2].i)-triangles[i][2].r << endl;
-						}
-					}
-				if(NbErr) { 
-				}
-
-			}
-#endif
 			return nbv-nbvold;
 
@@ -2068,10 +1876,4 @@
 											if (ii1 != ii0)  stack[kstack++] = ii1;//cout << " add1 " << ii1;
 									}
-#ifdef DEBUG2
-									cout << "ii1 = " << ii1 
-										<< " ii0 = " << ii0 << endl;
-									cout << "   cccc = " << cii0 << " " << ciii 
-										<< " " << cii1 << " sss=" << sss << endl;
-#endif
 									if (kstack >5) // bug ?
 										cout << "NewPoints: bug????? " << kstack << " stack  " << stack[kstack]<< endl;
@@ -2216,11 +2018,4 @@
 			} while (nbv!=nbvold);
 			delete []  first_np_or_next_t;
-#ifdef  DEBUG
-			int nberr=0;
-			for (int it=0;it<nbt;it++)
-				if(triangles[it].det==0) 
-					if(nberr++<10) cerr << "Bug Triangle nul" << it << triangles[it] << endl;
-			if(nberr) MeshError(992,this);
-#endif
 			cout << " end :  Triangles::NewPoints old  nbv=" << nbv << endl;
 
@@ -2291,8 +2086,4 @@
 					triangles[1].link=&triangles[0];
 
-#ifdef DEBUG 
-					triangles[0].check();
-					triangles[1].check();
-#endif  
 					//  nbtf = 2;
 					if (  !quadtree )  quadtree = new QuadTree(this,0);
@@ -2352,11 +2143,4 @@
 					ReMakeTriangleContainingTheVertex(); 
 					// because we break the TriangleContainingTheVertex
-#endif
-#ifdef  DEBUG
-					int nberr=0;
-					for (int it=0;it<nbt;it++)
-						if(triangles[it].det==0) 
-							if(nberr++<10) cerr << "Bug Triangle nul" << it << triangles[it] << endl;
-					if(nberr) MeshError(991,this);
 #endif
 					time3=CPUtime();
@@ -2847,9 +2631,4 @@
 			nt = nbt - NbOutT;
 
-#ifdef DEBUG
-			// verif 
-			for ( it=0;it<nbt;it++)
-				triangles[it].check();
-#endif   
 		}
 		Int4  Triangles::ConsRefTriangle(Int4 *reft) const
@@ -3257,9 +3036,5 @@
 												Real8 se= (sNew-L0)/LAB;
 												assert(se>=0 && se < 1.000000001);
-#ifdef DEBUG
-												se =  abscisseInterpole(v0.m,v1.m,AB,se); // because code \ref(xxx)
-#else
 												se =  abscisseInterpole(v0.m,v1.m,AB,se,1);
-#endif
 												assert(se>=0 && se <= 1);
 												//((k1==1) != (k1==k1equi))
@@ -3279,17 +3054,4 @@
 														<< se <<" B edge " << BTh.Number(ee) << " signe = " << k1 <<" " << A1->r <<endl;
 
-#ifdef DEBUG
-												// code \label(xxx)
-												R2  A1A0 = A1->r - A0->r;
-												Real8 dp = LengthInterpole(A0->m,A1->m,A1A0);
-												if (dp > 1.4) {
-													cerr << " PB new Points "<< nbv-1 ;
-													cerr << " AB=" << LAB << " s=" << (sNew-L0)/LAB << " se= "  ;
-													cerr << se <<" B edge " << BTh.Number(ee) << " signe = " << k1 <<endl;	      
-													cerr << " PB calcul new on cuver points trop loin l=" << dp 
-														<< " v=" << nbv-1 << " " << nbv-2 << " Lcurve = " << Lcurve << AB <<v0.m<< v1.m <<endl;
-												}
-
-#endif
 												e->ref = eeequi.ref;
 												e->adj[0]=PreviousNewEdge;
@@ -3593,16 +3355,4 @@
 														PreviousNewEdge = edges + nbe;
 														nbe++;
-#ifdef DEBUG1                 
-														cout << " new points " << nbv-1 << " " << vb->r ;
-														cout << " new edge " << nbe-1 << " " ;
-														cout << va << vb <<  " kk0 = " << kk0 
-															<< " " << kk1 << " ss=" << ss ;
-														cout << " " << sbb << endl;
-														cout << "      " << aa << va->r << bb << vb->r 
-															<<" length=" << Norme(va->r-vb->r) << endl;
-														cout << "      s " << s << " lstep= " << lstep 
-															<< " ledge= " << ledge 
-															<< " lcurve= " << lcurve << endl;
-#endif
 														va = vb;
 												}
@@ -4193,7 +3943,4 @@
 	// turne around in positif sens
 	Int4 NbSwap =0;
-#ifdef DEBUG
-	Vertex * s  = ns[i];
-#endif
 	Triangle  *t = this;
 	int k=0,j =OppositeEdge[i];
@@ -4202,12 +3949,5 @@
 	Triangle *tp= at[jp];
 	jp = aa[jp]&3;
-#ifdef DEBUG
-	assert(tp->at[jp] == this);
-#endif
 	do {
-#ifdef DEBUG
-		assert(k++<20000);
-		assert( s == & (*t)[OppositeVertex[j]] );
-#endif
 		//    cout << *t << " " <<  j  << "\n\t try swap " ;
 		while (t->swap(j,koption))
@@ -4218,7 +3958,4 @@
 			j=  NextEdge[tp->aa[jp]&3];
 			//   cout << "\n\t s  " <<  *t << " " << j << endl;
-#ifdef DEBUG
-			assert( s == & (*t)[OppositeVertex[j]] );
-#endif
 		}
 		// end on this  Triangle 
@@ -4724,13 +4461,4 @@
 		dete[jn] = t->det-dete[j] -dete[jp];
 
-#ifdef DEBUG
-		const Vertex * s0 = (*t)(0);
-		const Vertex * s1 = (*t)(1);
-		const Vertex * s2 = (*t)(2);
-		assert(dete[0] == det(B ,*s1,*s2));
-		assert(dete[1] == det(*s0,B ,*s2));
-		assert(dete[2] == det(*s0,*s1,B ));
-		assert(t->det== (dete[0] + dete[1] +dete[2]));
-#endif
 		// count the number k of  dete <0
 		int k=0,ii[3];
Index: /issm/trunk/src/c/Bamgx/Mesh2.h
===================================================================
--- /issm/trunk/src/c/Bamgx/Mesh2.h	(revision 2801)
+++ /issm/trunk/src/c/Bamgx/Mesh2.h	(revision 2802)
@@ -450,11 +450,4 @@
     t->aa[aa[a] & 3] &=55; // 23 + 32 
     aa[a] &=55 ;}
-  
-
- 
-#ifdef DEBUG       
-  void inline checka(Int1 a); 
-  void inline check();
-#endif
 
 };  // end of Triangle class 
@@ -1309,80 +1302,4 @@
 }
 
-#ifdef DEBUG
-void inline Triangle::checka(Int1 a) {
-  // verif de la coherence des adjacences de l arete a
-  a = a%4;
-  assert(a < 3 && a >= 0 );
-  Triangle *t1=this,*t2=at[a];
-  Int2 a1=a,a2=aa[a]%4;
-  
-  assert(a2 < 3 && a2 >= 0 );
-  if (t2 && ( ((*t1).ns[VerticesOfTriangularEdge[a1][0]] != (*t2).ns[VerticesOfTriangularEdge[a2][1]])
-	      || ((*t1).ns[VerticesOfTriangularEdge[a1][1]] != (*t2).ns[VerticesOfTriangularEdge[a2][0]])))
-    {
-      if (CurrentTh) std::cerr << " In Triangles beetween Triangle " << CurrentTh->Number(t1) << " and " 
-		     <<  CurrentTh->Number(t2) <<  std::endl;
-      std::cerr << "---- t1="<< t1 << " " << a1 <<",  t2="<< t2 << " " << a2 << std::endl;
-      std::cerr <<"t1="<< t1 << " " << a1 << " " << t1->ns[VerticesOfTriangularEdge[a1][0]] 
-	   << " " << t1->ns[VerticesOfTriangularEdge[a1][1]] <<std::endl;
-      if (CurrentTh)
-	std::cerr <<"t1="<< t1 << " " << a1 << " " << CurrentTh->Number(t1->ns[VerticesOfTriangularEdge[a1][0]])
-	   << " " << CurrentTh->Number(t1->ns[VerticesOfTriangularEdge[a1][1]]) <<std::endl;
-      if (t2) std::cerr <<"t2="<< t2 << " " << a2 << " " 
-		   <<  t2->ns[VerticesOfTriangularEdge[a2][0]] 
-		   << " " << t2->ns[VerticesOfTriangularEdge[a2][1]] <<std::endl;
-      if (t2 &&CurrentTh)
-	std::cerr <<"t2="<< t2 << " " << a2 << " " 
-	     <<  CurrentTh->Number(t2->ns[VerticesOfTriangularEdge[a2][0]])
-	     << " " << CurrentTh->Number(t2->ns[VerticesOfTriangularEdge[a2][1]]) <<std::endl;
-      assert(0); 
-    } 
-  if (t2)   assert(t1->aa[a1]/4 == t2->aa[a2]/4); // lock compatibite
-}
-
-
-void inline  Triangle::check() {
-  Icoor2 det2=0;
-  //  std::cout << " check " << this << std::endl;
-  int  infv=ns[0] ?  ((  ns[1] ? ( ns[2] ? -1 : 2) : 1  )) : 0;
-  if (det<0) {
-      if (infv<0 )
-	{  if (CurrentTh) std::cerr << " In Triangles " << CurrentTh->Number(this) << std::endl;
-	std::cerr << " det = " <<  det << " and " << infv << std::endl;
-	MeshError(5);
-	}}
-  else  if (infv>=0 )
- 	{  if (CurrentTh) std::cerr << " In Triangles " << CurrentTh->Number(this) << std::endl;
-	std::cerr << " det = " << det << " and " << infv << std::endl;
-	MeshError(5);
-	}  
-  
-  if (det >=0) 
-    if( det != (det2=bamg::det(*ns[0],*ns[1],*ns[2])))
-	{ // penthickness(4);Draw();
-	  if (CurrentTh) std::cerr << " In Triangles" << CurrentTh->Number(this) 
-			 << std::endl;
-      std::cerr << *ns[0] << *ns[1] << " " << *ns[2]  << " " << std::endl;
-	   std::cerr << " Bug in triangle " << this 
-		<< ":" << det << " !=  " << det2 << std::endl;
-	   MeshError(5);
-	}
-  checka(0);
-  checka(1);
-  checka(2);
-//  if (ns[0]) assert( ns[0] - Meshbegin  >= 0 );
-//  if (ns[0]) assert( Meshend  - ns[0] >= 0 );
-//  if (ns[1]) assert( ns[1] - Meshbegin  >= 0 );
-//  if (ns[1]) assert( Meshend  - ns[1] >= 0 );
-//  if (ns[2]) assert( ns[2] - Meshbegin  >= 0 );
-//  if (ns[2]) assert( Meshend  - ns[2] >= 0 );
-  assert(ns[0] != ns[2]);
-  assert(ns[1] != ns[2]);
-  assert(ns[0] != ns[1]);
-}
-
-
+}
 #endif
-
-}
-#endif
Index: /issm/trunk/src/c/Bamgx/MeshGeom.cpp
===================================================================
--- /issm/trunk/src/c/Bamgx/MeshGeom.cpp	(revision 2801)
+++ /issm/trunk/src/c/Bamgx/MeshGeom.cpp	(revision 2802)
@@ -577,25 +577,4 @@
     if (OppositeSens)
       s=1-s,Exchange(vg0,vg1),Exchange(V0,V1);
-    // find all the discretisation of the egde 
-#ifdef DEBUG
-    // we supposee  edge on=[Ag,Bg]  intersect edge [V0,V1];
-    // =>   V0Ag.V0V1 > 0 ||  V0Bg.V0V1 >0
-    // =>   V1Ag.V0V1 < 0 ||  V0Bg.V0V1 <0
-    R2 V0V1 = V1-V0;
-    Real8 cos0A = ((Ag-V0),V0V1);
-    Real8 cos0B = ((Bg-V0),V0V1);
-    Real8 cos1A = ((Ag-V1),V0V1);
-    Real8 cos1B = ((Bg-V1),V0V1);
-    if ( (cos0A < 0 && cos0B <0) || (cos1A> 0 && cos1B >0))
-      {
-	cerr << "  Bug on pointer edge  [" << V0 << " , " << V1 << " ] "
-	     << "  on geometrical edge " << Number(on) << " = [" << Ag << " , " << Bg << " ] " << endl;
-	cerr << cos0A << "> 0  ||  " << cos0B <<  " >  0  and  ";
-	cerr << cos1A << "< 0  ||  " << cos1B <<  " <  0  " << endl;
-	
-	exit (1);
-	}
-    
-#endif    
     if(NbTry) cout << "bug: edge = " << v0.r << " -> " << v1.r << endl 
 		   << "sg 0 = " << vg0 
Index: /issm/trunk/src/c/Bamgx/MeshQuad.cpp
===================================================================
--- /issm/trunk/src/c/Bamgx/MeshQuad.cpp	(revision 2801)
+++ /issm/trunk/src/c/Bamgx/MeshQuad.cpp	(revision 2802)
@@ -178,16 +178,4 @@
 // 1 first find a back ground edge contening the vertex A
 // 2 walk n back gound boundary to find the final vertex B
-
-
-#ifdef DEBUG
-// we suppose if the vertex A is on a background edge and
-// the abcisse is 0 or 1 when the related point is not
-// a end of curve <=>  !IsRequiredVertex
-    if (vA.vint == IsVertexOnEdge)
-      if (tA<=0)
-	assert(! (*vA.onbe->be)[0].on->IsRequiredVertex());
-      else if (tA>=1) 
-      	assert(!(*vA.onbe->be)[1].on->IsRequiredVertex());
-#endif
 
      if( vA.vint == IsVertexOnEdge) 
@@ -419,8 +407,4 @@
   //  memcpy(newedges,edges,sizeof(Edge)*nbe);
   SetOfEdges4 * edge4= new SetOfEdges4(nbe,nbv);
-#ifdef DEBUG
-  for (i=0;i<nbt;i++)
-    triangles[i].check();
-#endif
   Int4 k=nbv;
   Int4 kk=0;
@@ -512,15 +496,4 @@
       k++;
     }
-#ifdef DEBUG
-  assert(kvb ==  newNbVertexOnBThEdge);
-  // verif edge 
-  { Vertex *v0 = vertices, *v1 = vertices+ k;
-    for (Int4  i=0;i<ie;i++)
-     {
-       assert( &newedges[i][0] >= v0 &&  &newedges[i][0] < v1);
-       assert( &newedges[i][1] >= v0 &&  &newedges[i][1] < v1);
-     }
-  }
-#endif
   if (edgesGtoB) delete [] edgesGtoB;
   edgesGtoB=0;
@@ -897,9 +870,4 @@
   FillHoleInMesh();
 
-#ifdef DEBUG
-  for (i=0;i<nbt;i++)
-    triangles[i].check();
-#endif
-  
  if (verbosity>2)
    cout << "    (out) Nb of Quadrilaterals = " << NbOfQuad 
Index: /issm/trunk/src/c/Bamgx/Metric.cpp
===================================================================
--- /issm/trunk/src/c/Bamgx/Metric.cpp	(revision 2801)
+++ /issm/trunk/src/c/Bamgx/Metric.cpp	(revision 2802)
@@ -97,8 +97,5 @@
       else
 	s1=sqrt(s1),vp2x=v2/s1,vp2y=-v1/s1;
-#ifdef DEBUG
-      assert(Abs(vp1y)+Abs(vp2y)>0);
-#endif
-      V=D2xD2(vp1x,vp2x,vp1y,vp2y);
+		V=D2xD2(vp1x,vp2x,vp1y,vp2y);
   }
   return;