remove libtess.sweepDebugEvent

only used in the original when FOR_TRITE_TEST_PROGRAM was defined, and even then, was externally defined
brendankenny · Nov 24, 2014 · 787cce3 · 787cce3
1 parent fd63bc3
commit 787cce3
Show file tree

Hide file tree

Showing 4 changed files with 0 additions and 39 deletions.
diff --git a/libtess.cat.js b/libtess.cat.js
@@ -57,15 +57,6 @@ libtess.assert = function(condition, opt_message) {
   }
 };
 
-/**
- * [sweepDebugEvent description]
- * @param {libtess.GluTesselator} tess
- */
-libtess.sweepDebugEvent = function(tess) {
-  // TODO(bckenny): closure debug flag/debugger support
-  // sweep event updated
-};
-
 /**
  * The maximum vertex coordinate size, 1e150. Anything larger will trigger a
  * GLU_TESS_COORD_TOO_LARGE error callback and the vertex will be clamped to
@@ -1600,7 +1591,6 @@ libtess.sweep.computeInterior = function(tess) {
   // Set tess.event for debugging purposes
   var minRegion = tess.dict.getMin().getKey();
   tess.event = minRegion.eUp.org;
-  libtess.sweepDebugEvent(tess);
   libtess.sweep.doneEdgeDict_(tess);
   libtess.sweep.donePriorityQ_(tess);
 
@@ -2272,8 +2262,6 @@ libtess.sweep.checkForIntersect_ = function(tess, regUp) {
   }
 
   // At this point the edges intersect, at least marginally
-  libtess.sweepDebugEvent(tess);
-
   libtess.geom.edgeIntersect(dstUp, orgUp, dstLo, orgLo, isect);
 
   // The following properties are guaranteed:
@@ -2720,7 +2708,6 @@ libtess.sweep.connectLeftVertex_ = function(tess, vEvent) {
  */
 libtess.sweep.sweepEvent_ = function(tess, vEvent) {
   tess.event = vEvent; // for access in edgeLeq_ // TODO(bckenny): wuh?
-  libtess.sweepDebugEvent(tess);
 
   /* Check if this vertex is the right endpoint of an edge that is
    * already in the dictionary.  In this case we don't need to waste

diff --git a/libtess.debug.js b/libtess.debug.js
@@ -57,15 +57,6 @@ libtess.assert = function(condition, opt_message) {
   }
 };
 
-/**
- * [sweepDebugEvent description]
- * @param {libtess.GluTesselator} tess
- */
-libtess.sweepDebugEvent = function(tess) {
-  // TODO(bckenny): closure debug flag/debugger support
-  // sweep event updated
-};
-
 /**
  * The maximum vertex coordinate size, 1e150. Anything larger will trigger a
  * GLU_TESS_COORD_TOO_LARGE error callback and the vertex will be clamped to
@@ -1607,7 +1598,6 @@ libtess.sweep.computeInterior = function(tess) {
   // Set tess.event for debugging purposes
   var minRegion = tess.dict.getMin().getKey();
   tess.event = minRegion.eUp.org;
-  libtess.sweepDebugEvent(tess);
   libtess.sweep.doneEdgeDict_(tess);
   libtess.sweep.donePriorityQ_(tess);
 
@@ -2292,8 +2282,6 @@ libtess.sweep.checkForIntersect_ = function(tess, regUp) {
   }
 
   // At this point the edges intersect, at least marginally
-  libtess.sweepDebugEvent(tess);
-
   libtess.geom.edgeIntersect(dstUp, orgUp, dstLo, orgLo, isect);
 
   // The following properties are guaranteed:
@@ -2747,7 +2735,6 @@ libtess.sweep.connectLeftVertex_ = function(tess, vEvent) {
  */
 libtess.sweep.sweepEvent_ = function(tess, vEvent) {
   tess.event = vEvent; // for access in edgeLeq_ // TODO(bckenny): wuh?
-  libtess.sweepDebugEvent(tess);
 
   /* Check if this vertex is the right endpoint of an edge that is
    * already in the dictionary.  In this case we don't need to waste

diff --git a/src/libtess.js b/src/libtess.js
@@ -57,15 +57,6 @@ libtess.assert = function(condition, opt_message) {
   }
 };
 
-/**
- * [sweepDebugEvent description]
- * @param {libtess.GluTesselator} tess
- */
-libtess.sweepDebugEvent = function(tess) {
-  // TODO(bckenny): closure debug flag/debugger support
-  // sweep event updated
-};
-
 /**
  * The maximum vertex coordinate size, 1e150. Anything larger will trigger a
  * GLU_TESS_COORD_TOO_LARGE error callback and the vertex will be clamped to

diff --git a/src/sweep.js b/src/sweep.js
@@ -143,7 +143,6 @@ libtess.sweep.computeInterior = function(tess) {
   // Set tess.event for debugging purposes
   var minRegion = tess.dict.getMin().getKey();
   tess.event = minRegion.eUp.org;
-  libtess.sweepDebugEvent(tess);
   libtess.sweep.doneEdgeDict_(tess);
   libtess.sweep.donePriorityQ_(tess);
 
@@ -828,8 +827,6 @@ libtess.sweep.checkForIntersect_ = function(tess, regUp) {
   }
 
   // At this point the edges intersect, at least marginally
-  libtess.sweepDebugEvent(tess);
-
   libtess.geom.edgeIntersect(dstUp, orgUp, dstLo, orgLo, isect);
 
   // The following properties are guaranteed:
@@ -1283,7 +1280,6 @@ libtess.sweep.connectLeftVertex_ = function(tess, vEvent) {
  */
 libtess.sweep.sweepEvent_ = function(tess, vEvent) {
   tess.event = vEvent; // for access in edgeLeq_ // TODO(bckenny): wuh?
-  libtess.sweepDebugEvent(tess);
 
   /* Check if this vertex is the right endpoint of an edge that is
    * already in the dictionary.  In this case we don't need to waste