path ops -- use standard max, min, double-is-nan

src/pathops/SkPathOpsQuad.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 "SkLineParameters.h"
 #include "SkPathOpsCubic.h"
 #include "SkPathOpsQuad.h"
 #include "SkPathOpsTriangle.h"
 
 // from http://blog.gludion.com/2009/08/distance-to-quadratic-bezier-curve.html
 // (currently only used by testing)
 double SkDQuad::nearestT(const SkDPoint& pt) const {
     SkDVector pos = fPts[0] - pt;
     // search points P of bezier curve with PM.(dP / dt) = 0
     // a calculus leads to a 3d degree equation :
     SkDVector A = fPts[1] - fPts[0];
     SkDVector B = fPts[2] - fPts[1];
     B -= A;
     double a = B.dot(B);
     double b = 3 * A.dot(B);
     double c = 2 * A.dot(A) + pos.dot(B);
     double d = pos.dot(A);
     double ts[3];
     int roots = SkDCubic::RootsValidT(a, b, c, d, ts);
     double d0 = pt.distanceSquared(fPts[0]);
     double d2 = pt.distanceSquared(fPts[2]);
-    double distMin = SkTMin<double>(d0, d2);
+    double distMin = SkTMin(d0, d2);
     int bestIndex = -1;
     for (int index = 0; index < roots; ++index) {
         SkDPoint onQuad = xyAtT(ts[index]);
         double dist = pt.distanceSquared(onQuad);
         if (distMin > dist) {
             distMin = dist;
             bestIndex = index;
         }
     }
     if (bestIndex >= 0) {
@@ skipping 244 matching lines @@
  * c =             C
  */
 void SkDQuad::SetABC(const double* quad, double* a, double* b, double* c) {
     *a = quad[0];      // a = A
     *b = 2 * quad[2];  // b =     2*B
     *c = quad[4];      // c =             C
     *b -= *c;          // b =     2*B -   C
     *a -= *b;          // a = A - 2*B +   C
     *b -= *c;          // b =     2*B - 2*C
 }