path ops work in progress

src/pathops/SkQuarticRoot.cpp

 // from http://tog.acm.org/resources/GraphicsGems/gems/Roots3And4.c
 /*
  *  Roots3And4.c
  *
  *  Utility functions to find cubic and quartic roots,
  *  coefficients are passed like this:
  *
  *      c[0] + c[1]*x + c[2]*x^2 + c[3]*x^3 + c[4]*x^4 = 0
  *
  *  The functions return the number of non-complex roots and
@@ skipping 22 matching lines @@
         const double t0, const bool oneHint, double roots[4]) {
 #ifdef SK_DEBUG
     // create a string mathematica understands
     // GDB set print repe 15 # if repeated digits is a bother
     //     set print elements 400 # if line doesn't fit
     char str[1024];
     sk_bzero(str, sizeof(str));
     SK_SNPRINTF(str, sizeof(str),
             "Solve[%1.19g x^4 + %1.19g x^3 + %1.19g x^2 + %1.19g x + %1.19g == 0, x]",
             t4, t3, t2, t1, t0);
-    mathematica_ize(str, sizeof(str));
+    SkPathOpsDebug::MathematicaIze(str, sizeof(str));
 #if ONE_OFF_DEBUG && ONE_OFF_DEBUG_MATHEMATICA
     SkDebugf("%s\n", str);
 #endif
 #endif
     if (approximately_zero_when_compared_to(t4, t0)  // 0 is one root
             && approximately_zero_when_compared_to(t4, t1)
             && approximately_zero_when_compared_to(t4, t2)) {
         if (approximately_zero_when_compared_to(t3, t0)
             && approximately_zero_when_compared_to(t3, t1)
             && approximately_zero_when_compared_to(t3, t2)) {
@@ skipping 102 matching lines @@
                 if (j < --num) {
                     s[j] = s[num];
                 }
             } else {
                 ++j;
             }
         }
     }
     return num;
 }