path ops work in progress

tests/PathOpsCubicIntersectionTest.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 "PathOpsCubicIntersectionTestData.h"
 #include "PathOpsTestCommon.h"
 #include "SkIntersections.h"
 #include "SkPathOpsRect.h"
@@ skipping 472 matching lines @@
     for (size_t index = firstFail; index < selfSetCount; ++index) {
         const SkDCubic& cubic = selfSet[index];
     #if ONE_OFF_DEBUG
         int idx2;
         double max[3];
         int ts = cubic.findMaxCurvature(max);
         for (idx2 = 0; idx2 < ts; ++idx2) {
             SkDebugf("%s max[%d]=%1.9g (%1.9g, %1.9g)\n", __FUNCTION__, idx2,
                     max[idx2], cubic.xyAtT(max[idx2]).fX, cubic.xyAtT(max[idx2]).fY);
         }
-        SkTDArray<double> ts1;
-        SkTDArray<SkDQuad> quads1;
+        SkTArray<double, true> ts1;
+        SkTArray<SkDQuad, true> quads1;
         cubic.toQuadraticTs(cubic.calcPrecision(), &ts1);
         for (idx2 = 0; idx2 < ts1.count(); ++idx2) {
             SkDebugf("%s t[%d]=%1.9g\n", __FUNCTION__, idx2, ts1[idx2]);
         }
         CubicToQuads(cubic, cubic.calcPrecision(), quads1);
         for (idx2 = 0; idx2 < quads1.count(); ++idx2) {
             const SkDQuad& q = quads1[idx2];
             SkDebugf("  {{{%1.9g,%1.9g}, {%1.9g,%1.9g}, {%1.9g,%1.9g}}},\n",
                     q[0].fX, q[0].fY,  q[1].fX, q[1].fY,  q[2].fX, q[2].fY);
         }
@@ skipping 14 matching lines @@
     oneOffTest(reporter);
     oneOffTests(reporter);
     cubicIntersectionSelfTest(reporter);
     standardTestCases(reporter);
     if (false) CubicIntersection_IntersectionFinder();
     if (false) CubicIntersection_RandTest(reporter);
 }
 
 #include "TestClassDef.h"
 DEFINE_TESTCLASS_SHORT(PathOpsCubicIntersectionTest)