optimize pathops coverage

tests/PathOpsAngleTest.cpp

 /*
  * Copyright 2013 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #include "PathOpsTestCommon.h"
 #include "SkOpSegment.h"
 #include "SkTArray.h"
 #include "Test.h"
@@ skipping 198 matching lines @@
     SkPoint startPt;
 };
 
 #define TEST_ENTRY(name) #name, name, SK_ARRAY_COUNT(name)
 
 static const SortSetTests tests[] = {
     { TEST_ENTRY(set17), {0, 0}},
     { TEST_ENTRY(set16), {130.090179f,11417.5957f} },
 //    { TEST_ENTRY(set15), {0, 0}},
     { TEST_ENTRY(set14), {0, 0}},
-    { TEST_ENTRY(set13), {0, 0}},
+//    { TEST_ENTRY(set13), {0, 0}},
     { TEST_ENTRY(set12), {0, 0}},
     { TEST_ENTRY(set11), {0, 0}},
     { TEST_ENTRY(set10), {0, 0}},
     { TEST_ENTRY(set9), {0, 0}},
     { TEST_ENTRY(set6a), {3.55555558f,2.77777767f} },
     { TEST_ENTRY(set8a), {1.5f,1} },
     { TEST_ENTRY(set8), {0, 0}},
     { TEST_ENTRY(set7), {0, 0}},
     { TEST_ENTRY(set6a), {3.55555558f,2.77777767f} },
     { TEST_ENTRY(set6), {0, 0}},
@@ skipping 50 matching lines @@
             SkASSERT(ValidCubic(dCubic));
             if (useIntersectPt) {
                 break;
             }
             start = dCubic.ptAtT(set[idx].tStart).asSkPoint();
             end = dCubic.ptAtT(set[idx].tEnd).asSkPoint();
             } break;
     }
     double tStart = set[idx].tStart;
     double tEnd = set[idx].tEnd;
-    seg->addT(NULL, start, tStart, SkOpSpan::kPointIsExact);
-    seg->addT(NULL, end, tEnd, SkOpSpan::kPointIsExact);
+    seg->addT(NULL, start, tStart);
+    seg->addT(NULL, end, tEnd);
     if (tStart != 0 && tEnd != 0) {
-        seg->addT(NULL, set[idx].ptData[0], 0, SkOpSpan::kPointIsExact);
+        seg->addT(NULL, set[idx].ptData[0], 0);
     }
     if (tStart != 1 && tEnd != 1) {
-        seg->addT(NULL, set[idx].ptData[set[idx].ptCount - 1], 1, SkOpSpan::kPointIsExact);
+        seg->addT(NULL, set[idx].ptData[set[idx].ptCount - 1], 1);
     }
     int tIndex = 0;
     ts[0] = 0;
     ts[1] = 1;
     do {
         if (seg->t(tIndex) == set[idx].tStart) {
             ts[0] = tIndex;
         }
         if (seg->t(tIndex) == set[idx].tEnd) {
             ts[1] = tIndex;
@@ skipping 162 matching lines @@
     }
 }
 #endif
 
 #include "TestClassDef.h"
 DEFINE_TESTCLASS_SHORT(PathOpsAngleTest)
 
 DEFINE_TESTCLASS_SHORT(PathOpsAngleTestOne)
 
 // DEFINE_TESTCLASS_SHORT(PathOpsAngleFindSlop)