Lines Matching defs:right
31 // negative is to the right, 0 is collinear.
309 // remove any invalid inset edges by detecting right-hand turns. In a ccw polygon,
315 // In this case, one edge will lie to the right of the other and should be discarded along with
414 // if prev to right side of curr
513 // a point is "right" to another if its x-coord is greater, or if equal, its y-coord is less
514 static bool right(const SkPoint& p0, const SkPoint& p1) {
609 if (right(p0, q0)) {
1014 const ActiveEdge* right = tree->fChild[1];
1017 if (IsRed(tree) && (IsRed(left) || IsRed(right))) {
1033 if ((left && tree->lessThan(left)) || (right && right->lessThan(tree))) {
1039 int rightCount = VerifyTree(right);
1062 // We first insert the vertices into a priority queue sorting horizontally from left to right.
1107 // both to the right -- insert both
1123 // one to left and right -- replace one with another