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

src/pathops/SkDQuadIntersection.cpp

 // Another approach is to start with the implicit form of one curve and solve
 // (seek implicit coefficients in QuadraticParameter.cpp
 // by substituting in the parametric form of the other.
 // The downside of this approach is that early rejects are difficult to come by.
 // http://planetmath.org/encyclopedia/GaloisTheoreticDerivationOfTheQuarticFormula.html#step
 
 
 #include "SkDQuadImplicit.h"
 #include "SkIntersections.h"
 #include "SkPathOpsLine.h"
@@ skipping 225 matching lines @@
         return false;
     }
     return is_linear_inner(q1, 0, 1, q2, 0, 1, i, NULL);
 }
 
 // FIXME: if flat measure is sufficiently large, then probably the quartic solution failed
 static void relaxed_is_linear(const SkDQuad& q1, const SkDQuad& q2, SkIntersections* i) {
     double m1 = flat_measure(q1);
     double m2 = flat_measure(q2);
 #if DEBUG_FLAT_QUADS
-    double min = SkTMin<double>(m1, m2);
+    double min = SkTMin(m1, m2);
     if (min > 5) {
         SkDebugf("%s maybe not flat enough.. %1.9g\n", __FUNCTION__, min);
     }
 #endif
     i->reset();
     const SkDQuad& rounder = m2 < m1 ? q1 : q2;
     const SkDQuad& flatter = m2 < m1 ? q2 : q1;
     bool subDivide = false;
     is_linear_inner(flatter, 0, 1, rounder, 0, 1, i, &subDivide);
     if (subDivide) {
@@ skipping 232 matching lines @@
         }
         if (lowestIndex < 0) {
             break;
         }
         insert(roots1Copy[lowestIndex], roots2Copy[closest[lowestIndex]],
                 pts1[lowestIndex]);
         closest[lowestIndex] = -1;
     } while (++used < r1Count);
     return fUsed;
 }