deal more consistently with unsortable edges

tests/PathOpsSimplifyTest.cpp

 /*
  * 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 "PathOpsExtendedTest.h"
 
 #define TEST(name) { name, #name }
 
@@ skipping 4734 matching lines @@
     path.lineTo(1, 0);
     path.lineTo(0, 1);
     path.close();
     path.moveTo(2, 0);
     path.lineTo(0, 2);
     path.lineTo(2, 2);
     path.close();
     testSimplify(reporter, path, filename);
 }
 
+static void testArc(skiatest::Reporter* reporter,const char* filename) {
+    SkRect r = SkRect::MakeWH(150, 100);
+    SkPath path;
+    path.arcTo(r, 0, 0.0025f, false);
+    testSimplify(reporter, path, filename);
+}
+
 static void (*skipTest)(skiatest::Reporter* , const char* filename) = 0;
 static void (*firstTest)(skiatest::Reporter* , const char* filename) = 0;
 static void (*stopTest)(skiatest::Reporter* , const char* filename) = 0;
 
 static TestDesc tests[] = {
+    TEST(testArc),
     TEST(testTriangle2),
     TEST(testTriangle1),
     TEST(testQuads64),
     TEST(testQuads63),
     TEST(testQuads62),
     TEST(testRect4),
     TEST(testRect3),
     TEST(testQuadralateral10),
     TEST(testQuads61),
     TEST(testQuads60),
@@ skipping 425 matching lines @@
 
 DEF_TEST(PathOpsSimplify, reporter) {
     if (runSubTests && runSubTestsFirst) {
         RunTestSet(reporter, subTests, subTestCount, firstSubTest, NULL, stopTest, runReverse);
     }
     RunTestSet(reporter, tests, testCount, firstTest, skipTest, stopTest, runReverse);
     if (runSubTests && !runSubTestsFirst) {
         RunTestSet(reporter, subTests, subTestCount, firstSubTest, NULL, stopTest, runReverse);
     }
 }