optimize pathops coverage

src/pathops/SkIntersections.cpp

Index: src/pathops/SkIntersections.cpp
diff --git a/src/pathops/SkIntersections.cpp b/src/pathops/SkIntersections.cpp
index 35846f6cc9f54c3cf2759b45664261e71f2ca4cf..53cd6feb433098c0cd12db5f38d66b19105c0809 100644
--- a/src/pathops/SkIntersections.cpp
+++ b/src/pathops/SkIntersections.cpp
@@ -108,7 +108,6 @@ int SkIntersections::insert(double one, double two, const SkDPoint& pt) {
         int clearMask = ~((1 << index) - 1);
         fIsCoincident[0] += fIsCoincident[0] & clearMask;
         fIsCoincident[1] += fIsCoincident[1] & clearMask;
-        fIsNear += fIsNear & clearMask;
     }
     fPt[index] = pt;
     fT[0][index] = one;
@@ -117,14 +116,6 @@ int SkIntersections::insert(double one, double two, const SkDPoint& pt) {
     return index;
 }
 
-void SkIntersections::insertNear(double one, double two, const SkDPoint& pt) {
-    int index = insert(one, two, pt);
-    if (index < 0) {
-        return;
-    }
-    fIsNear |= 1 << index;
-}
-
 void SkIntersections::insertCoincident(double one, double two, const SkDPoint& pt) {
     int index = insertSwap(one, two, pt);
     int bit = 1 << index;
@@ -188,7 +179,6 @@ void SkIntersections::removeOne(int index) {
     fIsCoincident[0] -= ((fIsCoincident[0] >> 1) & ~((1 << index) - 1)) + coBit;
     SkASSERT(!(coBit ^ (fIsCoincident[1] & (1 << index))));
     fIsCoincident[1] -= ((fIsCoincident[1] >> 1) & ~((1 << index) - 1)) + coBit;
-    fIsNear -= ((fIsNear >> 1) & ~((1 << index) - 1)) + (fIsNear & (1 << index));
 }
 
 void SkIntersections::swapPts() {