diff --git a/src/path/Curve.js b/src/path/Curve.js
index e0b80985..e3461efd 100644
--- a/src/path/Curve.js
+++ b/src/path/Curve.js
@@ -1383,8 +1383,6 @@ new function() { // Scope for intersection using bezier fat-line clipping
                 t2 = Curve.getParameterOf(v2, p2);
             if (t2 !== null && t2 >= (endConnected ? tMin : 0) &&
                 t2 <= (startConnected ? tMax : 1)) {
-                // TODO: Don't we need to check the range of t2 as well? Does it
-                // also need startConnected / endConnected values?
                 var renormalize = param.renormalize;
                 if (renormalize) {
                     var res = renormalize(t1, t2);
@@ -1405,8 +1403,6 @@ new function() { // Scope for intersection using bezier fat-line clipping
                 // Link the two locations to each other.
                 loc1._intersection = loc2;
                 loc2._intersection = loc1;
-                // TODO: Remove this once debug logging is removed.
-                (flip ? loc1 : loc2)._other = true;
                 if (!include || include(loc)) {
                     CurveLocation.insert(locations, loc, true);
                 }
diff --git a/src/path/PathItem.Boolean.js b/src/path/PathItem.Boolean.js
index c485a6d8..4ee0c53d 100644
--- a/src/path/PathItem.Boolean.js
+++ b/src/path/PathItem.Boolean.js
@@ -384,7 +384,7 @@ PathItem.inject(new function() {
         // winding than equally dividing the curve chain, with the same
         // (amortised) time.
         for (var i = 0; i < 3; i++) {
-            // Try the points at 1/4, 2/4 and 3/4 of the total length:
+            // Sample the points at 1/4, 2/4 and 3/4 of the total length:
             var length = totalLength * (i + 1) / 4;
             for (var k = 0, m = chain.length; k < m; k++) {
                 var node = chain[k],