align top and bounds computations

src/pathops/SkPathOpsConic.h

 /*
  * Copyright 2015 Google Inc.
  *
  * Use of this source code is governed by a BSD-style license that can be
  * found in the LICENSE file.
  */
 
 #ifndef SkPathOpsConic_DEFINED
 #define SkPathOpsConic_DEFINED
 
@@ skipping 54 matching lines @@
     bool hullIntersects(const SkDConic& conic, bool* isLinear) const {
         return fPts.hullIntersects(conic.fPts, isLinear);
     }
 
     bool hullIntersects(const SkDCubic& cubic, bool* isLinear) const;
 
     bool isLinear(int startIndex, int endIndex) const {
         return fPts.isLinear(startIndex, endIndex);
     }
 
+    bool monotonicInX() const {
+        return fPts.monotonicInX();
+    }
+
     bool monotonicInY() const {
         return fPts.monotonicInY();
     }
 
     void otherPts(int oddMan, const SkDPoint* endPt[2]) const {
         fPts.otherPts(oddMan, endPt);
     }
 
     SkDPoint ptAtT(double t) const;
 
@@ skipping 17 matching lines @@
             SkScalar* weight) const;
 
     static SkDPoint SubDivide(const SkPoint pts[kPointCount], SkScalar weight,
                               const SkDPoint& a, const SkDPoint& c,
                               double t1, double t2, SkScalar* newWeight) {
         SkDConic conic;
         conic.set(pts, weight);
         return conic.subDivide(a, c, t1, t2, newWeight);
     }
 
-    SkDPoint top(double startT, double endT, double* topT) const;
-
     // utilities callable by the user from the debugger when the implementation code is linked in
     void dump() const;
     void dumpID(int id) const;
     void dumpInner() const;
 };
 
 
 #endif