split tight quads and cubics

src/pathops/SkAddIntersections.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 "SkAddIntersections.h"
 #include "SkOpCoincidence.h"
 #include "SkPathOpsBounds.h"
 
@@ skipping 524 matching lines @@
                     continue;
                 }
                 if (coinPtT[1]->span() == nextTAt->span()) {
                     coinIndex = -1;  // coincidence span collapsed
                     continue;
                 }
                 if (swap) {
                     SkTSwap(coinPtT[0], coinPtT[1]);
                     SkTSwap(testTAt, nextTAt);
                 }
-                SkASSERT(coinPtT[0]->span()->t() < testTAt->span()->t());
+                SkASSERT(coincidence->globalState()->debugSkipAssert()
+                        || coinPtT[0]->span()->t() < testTAt->span()->t());
                 if (coinPtT[0]->span()->deleted()) {
                     coinIndex = -1;
                     continue;
                 }
                 if (testTAt->span()->deleted()) {
                     coinIndex = -1;
                     continue;
                 }
                 coincidence->add(coinPtT[0], testTAt, coinPtT[1], nextTAt);
                 wt.segment()->debugValidate();
                 wn.segment()->debugValidate();
                 coinIndex = -1;
             }
             SkASSERT(coinIndex < 0);  // expect coincidence to be paired
         } while (wn.advance());
     } while (wt.advance());
     return true;
 }