convert pathops to use SkSTArray where possible.

src/pathops/SkOpContour.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 "SkIntersections.h"
 #include "SkOpContour.h"
 #include "SkPathWriter.h"
 #include "SkTSort.h"
 
 void SkOpContour::addCoincident(int index, SkOpContour* other, int otherIndex,
         const SkIntersections& ts, bool swap) {
-    SkCoincidence& coincidence = *fCoincidences.append();
+    SkCoincidence& coincidence = fCoincidences.push_back();
     coincidence.fContours[0] = this;  // FIXME: no need to store
     coincidence.fContours[1] = other;
     coincidence.fSegments[0] = index;
     coincidence.fSegments[1] = otherIndex;
     coincidence.fTs[swap][0] = ts[0][0];
     coincidence.fTs[swap][1] = ts[0][1];
     coincidence.fTs[!swap][0] = ts[1][0];
     coincidence.fTs[!swap][1] = ts[1][1];
     coincidence.fPts[0] = ts.pt(0).asSkPoint();
     coincidence.fPts[1] = ts.pt(1).asSkPoint();
@@ skipping 120 matching lines @@
         }
     #if DEBUG_CONCIDENT
         thisOne.debugShowTs();
         other.debugShowTs();
     #endif
     }
 }
 
 void SkOpContour::sortSegments() {
     int segmentCount = fSegments.count();
-    fSortedSegments.setReserve(segmentCount);
+    fSortedSegments.push_back_n(segmentCount);
     for (int test = 0; test < segmentCount; ++test) {
-        *fSortedSegments.append() = &fSegments[test];
+        fSortedSegments[test] = &fSegments[test];
     }
     SkTQSort<SkOpSegment>(fSortedSegments.begin(), fSortedSegments.end() - 1);
     fFirstSorted = 0;
 }
 
 void SkOpContour::toPath(SkPathWriter* path) const {
     int segmentCount = fSegments.count();
     const SkPoint& pt = fSegments.front().pts()[0];
     path->deferredMove(pt);
     for (int test = 0; test < segmentCount; ++test) {
@@ skipping 54 matching lines @@
 int SkOpContour::debugShowWindingValues(int totalSegments, int ofInterest) {
     int count = fSegments.count();
     int sum = 0;
     for (int index = 0; index < count; ++index) {
         sum += fSegments[index].debugShowWindingValues(totalSegments, ofInterest);
     }
 //      SkDebugf("%s sum=%d\n", __FUNCTION__, sum);
     return sum;
 }
 
-static void SkOpContour::debugShowWindingValues(const SkTDArray<SkOpContour*>& contourList) {
+static void SkOpContour::debugShowWindingValues(const SkTArray<SkOpContour*, true>& contourList) {
 //     int ofInterest = 1 << 1 | 1 << 5 | 1 << 9 | 1 << 13;
 //    int ofInterest = 1 << 4 | 1 << 8 | 1 << 12 | 1 << 16;
     int ofInterest = 1 << 5 | 1 << 8;
     int total = 0;
     int index;
     for (index = 0; index < contourList.count(); ++index) {
         total += contourList[index]->segments().count();
     }
     int sum = 0;
     for (index = 0; index < contourList.count(); ++index) {
         sum += contourList[index]->debugShowWindingValues(total, ofInterest);
     }
 //       SkDebugf("%s total=%d\n", __FUNCTION__, sum);
 }
 #endif
 
 void SkOpContour::setBounds() {
     int count = fSegments.count();
     if (count == 0) {
         SkDebugf("%s empty contour\n", __FUNCTION__);
         SkASSERT(0);
         // FIXME: delete empty contour?
         return;
     }
     fBounds = fSegments.front().bounds();
     for (int index = 1; index < count; ++index) {
         fBounds.add(fSegments[index].bounds());
     }
 }