optimize pathops coverage

src/pathops/SkIntersectionHelper.h

 /*
  * Copyright 2012 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "SkOpContour.h"
 #include "SkPath.h"
 
 #ifdef SK_DEBUG
@@ skipping 24 matching lines @@
             bool swap) {
         return fContour->addPartialCoincident(fIndex, other.fContour, other.fIndex, ts, index,
                 swap);
     }
 
     // Avoid collapsing t values that are close to the same since
     // we walk ts to describe consecutive intersections. Since a pair of ts can
     // be nearly equal, any problems caused by this should be taken care
     // of later.
     // On the edge or out of range values are negative; add 2 to get end
-    int addT(const SkIntersectionHelper& other, const SkPoint& pt, double newT, bool isNear) {
-        return fContour->addT(fIndex, other.fContour, other.fIndex, pt, newT, isNear);
+    int addT(const SkIntersectionHelper& other, const SkPoint& pt, double newT) {
+        return fContour->addT(fIndex, other.fContour, other.fIndex, pt, newT);
     }
 
     int addSelfT(const SkIntersectionHelper& other, const SkPoint& pt, double newT) {
         return fContour->addSelfT(fIndex, other.fContour, other.fIndex, pt, newT);
     }
 
     bool advance() {
         return ++fIndex < fLast;
     }
 
@@ skipping 13 matching lines @@
 
     bool isAdjacent(const SkIntersectionHelper& next) {
         return fContour == next.fContour && fIndex + 1 == next.fIndex;
     }
 
     bool isFirstLast(const SkIntersectionHelper& next) {
         return fContour == next.fContour && fIndex == 0
                 && next.fIndex == fLast - 1;
     }
 
-    bool isNear(double t1, double t2, const SkDPoint& pt1, const SkDPoint& pt2) const {
-        const SkOpSegment& segment = fContour->segments()[fIndex];
-        double mid = (t1 + t2) / 2;
-        SkDPoint midPtByT = segment.dPtAtT(mid);
-        SkDPoint midPtByAvg = SkDPoint::Mid(pt1, pt2);
-        return midPtByT.approximatelyEqual(midPtByAvg);
-    }
-
     bool isPartial(double t1, double t2, const SkDPoint& pt1, const SkDPoint& pt2) const {
         const SkOpSegment& segment = fContour->segments()[fIndex];
         double mid = (t1 + t2) / 2;
         SkDPoint midPtByT = segment.dPtAtT(mid);
         SkDPoint midPtByAvg = SkDPoint::Mid(pt1, pt2);
         return midPtByT.approximatelyPEqual(midPtByAvg);
     }
 
     SkScalar left() const {
         return bounds().fLeft;
@@ skipping 62 matching lines @@
             SkDPoint::dump(pts()[3]);
         }
     }
 #endif
 
 private:
     SkOpContour* fContour;
     int fIndex;
     int fLast;
 };