remove unused code

src/pathops/SkPathOpsLine.cpp

Index: src/pathops/SkPathOpsLine.cpp
diff --git a/src/pathops/SkPathOpsLine.cpp b/src/pathops/SkPathOpsLine.cpp
index 70f2e12472b401240a1875cb1d8b2023571805cf..cad54eb263ad3b90351c96daf4da8a7e9b266887 100644
--- a/src/pathops/SkPathOpsLine.cpp
+++ b/src/pathops/SkPathOpsLine.cpp
@@ -6,34 +6,6 @@
  */
 #include "SkPathOpsLine.h"
 
-// may have this below somewhere else already:
-// copying here because I thought it was clever
-
-// Copyright 2001, softSurfer (www.softsurfer.com)
-// This code may be freely used and modified for any purpose
-// providing that this copyright notice is included with it.
-// SoftSurfer makes no warranty for this code, and cannot be held
-// liable for any real or imagined damage resulting from its use.
-// Users of this code must verify correctness for their application.
-
-// Assume that a class is already given for the object:
-//    Point with coordinates {float x, y;}
-//===================================================================
-
-// (only used by testing)
-// isLeft(): tests if a point is Left|On|Right of an infinite line.
-//    Input:  three points P0, P1, and P2
-//    Return: >0 for P2 left of the line through P0 and P1
-//            =0 for P2 on the line
-//            <0 for P2 right of the line
-//    See: the January 2001 Algorithm on Area of Triangles
-//    return (float) ((P1.x - P0.x)*(P2.y - P0.y) - (P2.x - P0.x)*(P1.y - P0.y));
-double SkDLine::isLeft(const SkDPoint& pt) const {
-    SkDVector p0 = fPts[1] - fPts[0];
-    SkDVector p2 = pt - fPts[0];
-    return p0.cross(p2);
-}
-
 SkDPoint SkDLine::ptAtT(double t) const {
     if (0 == t) {
         return fPts[0];