Revert of fix destructor order to fix build

src/pathops/SkOpContour.h

 /*
  * Copyright 2013 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 #ifndef SkOpContour_DEFINED
 #define SkOpContour_DEFINED
 
 #include "SkOpSegment.h"
 #include "SkTDArray.h"
 #include "SkTSort.h"
 
 class SkChunkAlloc;
 class SkPathWriter;
 
 class SkOpContour {
 public:
     SkOpContour() {
         reset();
     }
 
-    ~SkOpContour() {
-        if (fNext) {
-            fNext->~SkOpContour();
-        }
-    }
-
     bool operator<(const SkOpContour& rh) const {
         return fBounds.fTop == rh.fBounds.fTop
                 ? fBounds.fLeft < rh.fBounds.fLeft
                 : fBounds.fTop < rh.fBounds.fTop;
     }
 
     void addCubic(SkPoint pts[4], SkChunkAlloc* allocator) {
         appendSegment(allocator).addCubic(pts, this);
     }
 
@@ skipping 21 matching lines @@
         result->setPrev(fTail);
         if (fTail) {
             fTail->setNext(result);
         }
         fTail = result;
         return *result;
     }
 
     SkOpContour* appendContour(SkChunkAlloc* allocator) {
         SkOpContour* contour = SkOpTAllocator<SkOpContour>::New(allocator);
-        contour->setNext(NULL);
+        
         SkOpContour* prev = this;
         SkOpContour* next;
         while ((next = prev->next())) {
             prev = next;
         }
         prev->setNext(contour);
         return contour;
     }
     
     const SkPathOpsBounds& bounds() const {
@@ skipping 191 matching lines @@
         while ((segment = segment->next())) {
             fBounds.add(segment->bounds());
         }
     }
 
     void setGlobalState(SkOpGlobalState* state) {
         fState = state;
     }
 
     void setNext(SkOpContour* contour) {
-//        SkASSERT(!fNext == !!contour);
+        SkASSERT(!fNext == !!contour);
         fNext = contour;
     }
 
     void setOperand(bool isOp) {
         fOperand = isOp;
     }
 
     void setOppXor(bool isOppXor) {
         fOppXor = isOppXor;
     }
@@ skipping 54 matching lines @@
     int fFirstSorted;
     bool fDone;  // set by find top segment
     bool fOperand;  // true for the second argument to a binary operator
     bool fXor;  // set if original path had even-odd fill
     bool fOppXor;  // set if opposite path had even-odd fill
     PATH_OPS_DEBUG_CODE(int fID);
     PATH_OPS_DEBUG_CODE(int fIndent);
 };
 
 #endif