path ops; remove obsolete reduce

src/pathops/SkReduceOrder.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 "SkReduceOrder.h"
 
 int SkReduceOrder::reduce(const SkDLine& line) {
     fLine[0] = line[0];
@@ skipping 18 matching lines @@
 }
 
 static int horizontal_line(const SkDQuad& quad, SkDQuad& reduction) {
     reduction[0] = quad[0];
     reduction[1] = quad[2];
     return reductionLineCount(reduction);
 }
 
 static int check_linear(const SkDQuad& quad,
         int minX, int maxX, int minY, int maxY, SkDQuad& reduction) {
-    int startIndex = 0;
-    int endIndex = 2;
-    while (quad[startIndex].approximatelyEqual(quad[endIndex])) {
-        --endIndex;
-        if (endIndex == 0) {
-            SkDebugf("%s shouldn't get here if all four points are about equal", __FUNCTION__);
-            SkASSERT(0);
-        }
-    }
-    if (!quad.isLinear(startIndex, endIndex)) {
+    if (!quad.isLinear(0, 2)) {
         return 0;
     }
     // four are colinear: return line formed by outside
     reduction[0] = quad[0];
     reduction[1] = quad[2];
     return reductionLineCount(reduction);
 }
 
 // reduce to a quadratic or smaller
 // look for identical points
@@ skipping 90 matching lines @@
     }
     reduction[0] = cubic[0];
     reduction[1].fX = midX;
     reduction[1].fY = midY;
     reduction[2] = cubic[3];
     return 3;
 }
 
 static int check_linear(const SkDCubic& cubic,
         int minX, int maxX, int minY, int maxY, SkDCubic& reduction) {
-    int startIndex = 0;
-    int endIndex = 3;
-    while (cubic[startIndex].approximatelyEqual(cubic[endIndex])) {
-        --endIndex;
-        if (endIndex == 0) {
-            endIndex = 3;
-            break;
-        }
-    }
-    if (!cubic.isLinear(startIndex, endIndex)) {
+    if (!cubic.isLinear(0, 3)) {
         return 0;
     }
     // four are colinear: return line formed by outside
     reduction[0] = cubic[0];
     reduction[1] = cubic[3];
     return reductionLineCount(reduction);
 }
 
 /* food for thought:
 http://objectmix.com/graphics/132906-fast-precision-driven-cubic-quadratic-piecewise-degree-reduction-algos-2-a.html
@@ skipping 110 matching lines @@
     cubic.set(a);
     SkReduceOrder reducer;
     int order = reducer.reduce(cubic, kAllow_Quadratics);
     if (order == 2 || order == 3) {  // cubic became line or quad
         for (int index = 0; index < order; ++index) {
             *reducePts++ = reducer.fQuad[index].asSkPoint();
         }
     }
     return SkPathOpsPointsToVerb(order - 1);
 }