[prev in list] [next in list] [prev in thread] [next in thread] 

List:       kde-commits
Subject:    KDE/kdeedu/kstars/kstars/htmesh
From:       Alexey Khudyakov <alexey.skladnoy () gmail ! com>
Date:       2011-02-20 18:03:10
Message-ID: 20110220180310.9E439AC8CE () svn ! kde ! org
[Download RAW message or body]

SVN commit 1221837 by khudyakov:

Remove debugging code in RangeConvex. It's all nice but it get in the way

 M  +1 -53     RangeConvex.cpp  


--- trunk/KDE/kdeedu/kstars/kstars/htmesh/RangeConvex.cpp #1221836:1221837
@@ -3,7 +3,7 @@
 //# # Date: October 23, 1998 # # Copyright (C) 2000 Peter Z. Kunszt,
 //Alex S. Szalay, Aniruddha R. Thakar # The Johns Hopkins University #
 //# Modification History: # # Oct 18, 2001 : Dennis C. Dinge --
-//Replaced ValVec with std::vector # #define DIAGNOSE
+//Replaced ValVec with std::vector
 
 
 #include "SpatialGeneral.h"
@@ -390,13 +390,7 @@
 	  if(boundingCircle_.d_ > d) boundingCircle_ = SpatialConstraint(v,d);
 	}
   }
-
-#ifdef DIAGNOSE
-  for(i = 0; i < corners_.size(); i++) {
-    cout << corners_[i].ra() << "," << corners_[i].dec() << ":" << corners_[i] << endl;
   }
-#endif
-}
 
 /////////////SIMPLIFY/////////////////////////////////////
 // simplify: We have the following decision tree for the
@@ -783,32 +777,9 @@
 
   int vsum = testVertex(v0) + testVertex(v1) + testVertex(v2);
 
-#ifdef DIAGNOSE
-  char name[10];
-  SpatialVector v = v0 + v1 + v2;
-  cout << index_->nameById(index_->idByPoint(v),name)
-       << " " << vsum << " " << endl;
-#endif
-
   SpatialMarkup mark =
     testTriangle( *v0, *v1, *v2, vsum);
 
-
-#ifdef DIAGNOSE
-  cout << ( mark == pARTIAL ? " partial " :
-	    ( mark ==  fULL ? " full " :
-	      ( mark == rEJECT ? " reject " :
-		" dontknow " ) ) ) << name << endl;
-    /*
-       << v0 << "," << v1 << "," << v2 << " " << endl;
-       << V(NV(0)) << " , " << V(NV(1)) << " , " << V(NV(2)) << endl
-       << " (" << V(NV(0)).ra() << "," << V(NV(0)).dec() << ")"
-       << " (" << V(NV(1)).ra() << "," << V(NV(1)).dec() << ")"
-       << " (" << V(NV(2)).ra() << "," << V(NV(2)).dec() << ")"
-       << endl;
-    */
-#endif
-
   // since we cannot play games using the on-the-fly triangles,
   // substitute dontknow with partial.
   if (mark == dONTKNOW)
@@ -824,32 +795,9 @@
 
   int vsum = testVertex(v0) + testVertex(v1) + testVertex(v2);
 
-#ifdef DIAGNOSE
-  char name[10];
-  SpatialVector v = v0 + v1 + v2;
-  cout << index_->nameById(index_->idByPoint(v),name)
-       << " " << vsum << " " << endl;
-#endif
-
   SpatialMarkup mark =
     testTriangle( v0, v1, v2, vsum);
 
-
-#ifdef DIAGNOSE
-  cout << ( mark == pARTIAL ? " partial " :
-	    ( mark ==  fULL ? " full " :
-	      ( mark == rEJECT ? " reject " :
-		" dontknow " ) ) ) << name << endl;
-    /*
-       << v0 << "," << v1 << "," << v2 << " " << endl;
-       << V(NV(0)) << " , " << V(NV(1)) << " , " << V(NV(2)) << endl
-       << " (" << V(NV(0)).ra() << "," << V(NV(0)).dec() << ")"
-       << " (" << V(NV(1)).ra() << "," << V(NV(1)).dec() << ")"
-       << " (" << V(NV(2)).ra() << "," << V(NV(2)).dec() << ")"
-       << endl;
-    */
-#endif
-
   // since we cannot play games using the on-the-fly triangles,
   // substitute dontknow with partial.
   if (mark == dONTKNOW)
[prev in list] [next in list] [prev in thread] [next in thread]