path ops work in progress

src/pathops/SkPathOpsLine.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 "SkPathOpsLine.h"
 
 SkDLine SkDLine::subDivide(double t1, double t2) const {
     SkDVector delta = tangent();
@@ skipping 134 matching lines @@
     double realPtX = (1 - t) * left + t * right;
     SkDVector distU = {xy.fY - y, xy.fX - realPtX};
     double distSq = distU.fX * distU.fX + distU.fY * distU.fY;
     double dist = sqrt(distSq); // OPTIMIZATION: can we compare against distSq instead ?
     double tiniest = SkTMin(SkTMin(y, left), right);
     double largest = SkTMax(SkTMax(y, left), right);
     largest = SkTMax(largest, -tiniest);
     if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance?
         return -1;
     }
-    t = SkPinT(t);
-    SkASSERT(between(0, t, 1));
     return t;
 }
 
 double SkDLine::ExactPointV(const SkDPoint& xy, double top, double bottom, double x) {
     if (xy.fX == x) {
         if (xy.fY == top) {
             return 0;
         }
         if (xy.fY == bottom) {
             return 1;
@@ skipping 15 matching lines @@
     double realPtY = (1 - t) * top + t * bottom;
     SkDVector distU = {xy.fX - x, xy.fY - realPtY};
     double distSq = distU.fX * distU.fX + distU.fY * distU.fY;
     double dist = sqrt(distSq); // OPTIMIZATION: can we compare against distSq instead ?
     double tiniest = SkTMin(SkTMin(x, top), bottom);
     double largest = SkTMax(SkTMax(x, top), bottom);
     largest = SkTMax(largest, -tiniest);
     if (!AlmostEqualUlps(largest, largest + dist)) { // is the dist within ULPS tolerance?
         return -1;
     }
-    t = SkPinT(t);
-    SkASSERT(between(0, t, 1));
     return t;
 }
 
 #ifdef SK_DEBUG
 void SkDLine::dump() {
     SkDebugf("{{");
     fPts[0].dump();
     SkDebugf(", ");
     fPts[1].dump();
     SkDebugf("}}\n");
 }
 #endif