Searched refs:isRightOf (Results 1 – 3 of 3) sorted by relevance
570 if (next->isRightOf(fTop)) { in insertAbove()588 if (next->isRightOf(fBottom)) { in insertBelow()636 (top->fRightEnclosingEdge && !top->fRightEnclosingEdge->isRightOf(e->fTop)))) { in rewind()656 } else if (c.sweep_lt(top->fPoint, leftTop->fPoint) && !edge->isRightOf(leftTop)) { in rewind_if_necessary()661 } else if (c.sweep_lt(leftBottom->fPoint, bottom->fPoint) && !edge->isRightOf(leftBottom)) { in rewind_if_necessary()668 if (c.sweep_lt(rightTop->fPoint, top->fPoint) && !edge->fRight->isRightOf(top)) { in rewind_if_necessary()673 !edge->fRight->isRightOf(bottom)) { in rewind_if_necessary()757 !left->isLeftOf(right->fTop) || !right->isRightOf(left->fTop); in top_collinear()765 !left->isLeftOf(right->fBottom) || !right->isRightOf(left->fBottom); in bottom_collinear()833 if (!right->isRightOf(left->fTop)) { in intersectEdgePair()[all …]
417 bool isRightOf(Vertex* v) const { return fLine.dist(v->fPoint) < 0.0; } in isRightOf() function
389 bool isRightOf(Vertex* v) const { in isRightOf() function872 if (next->isRightOf(edge->fTop)) { in insert_edge_above()890 if (next->isRightOf(edge->fBottom)) { in insert_edge_below()954 } else if (c.sweep_lt(top->fPoint, leftTop->fPoint) && !edge->isRightOf(leftTop)) { in rewind_if_necessary()959 } else if (c.sweep_lt(leftBottom->fPoint, bottom->fPoint) && !edge->isRightOf(leftBottom)) { in rewind_if_necessary()966 if (c.sweep_lt(rightTop->fPoint, top->fPoint) && !edge->fRight->isRightOf(top)) { in rewind_if_necessary()971 !edge->fRight->isRightOf(bottom)) { in rewind_if_necessary()1045 !left->isLeftOf(right->fTop) || !right->isRightOf(left->fTop); in top_collinear()1053 !left->isLeftOf(right->fBottom) || !right->isRightOf(left->fBottom); in bottom_collinear()1120 if (!right->isRightOf(left->fTop)) { in intersect_edge_pair()[all …]