Lines Matching defs:left
30 // A positive value means the point is to the left of the segment,
310 // we should only be making left-hand turns (for cw polygons, we use the winding
508 // a point is "left" to another if its x-coord is less, or if equal, its y-coord is greater
509 static bool left(const SkPoint& p0, const SkPoint& p1) {
520 return left(qv0.fPosition, qv1.fPosition);
549 // Returns true if "this" is above "that", assuming this->p0 is to the left of that->p0
1013 const ActiveEdge* left = tree->fChild[0];
1017 if (IsRed(tree) && (IsRed(left) || IsRed(right))) {
1033 if ((left && tree->lessThan(left)) || (right && right->lessThan(tree))) {
1038 int leftCount = VerifyTree(left);
1062 // We first insert the vertices into a priority queue sorting horizontally from left to right.
1092 if (left(polygon[newVertex.fPrevIndex], polygon[i])) {
1095 if (left(polygon[newVertex.fNextIndex], polygon[i])) {
1115 // both to the left -- remove both
1123 // one to left and right -- replace one with another