Searched refs:isLeftOf (Results 1 – 3 of 3) sorted by relevance
552 if (prev->isLeftOf(v)) { in FindEnclosingEdges()635 ((top->fLeftEnclosingEdge && !top->fLeftEnclosingEdge->isLeftOf(e->fTop)) || in rewind()654 if (c.sweep_lt(leftTop->fPoint, top->fPoint) && !edge->fLeft->isLeftOf(top)) { in rewind_if_necessary()659 !edge->fLeft->isLeftOf(bottom)) { in rewind_if_necessary()670 } else if (c.sweep_lt(top->fPoint, rightTop->fPoint) && !edge->isLeftOf(rightTop)) { in rewind_if_necessary()676 !edge->isLeftOf(rightBottom)) { 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()828 if (!left->isLeftOf(right->fTop)) { in intersectEdgePair()839 if (!left->isLeftOf(right->fBottom)) { in intersectEdgePair()[all …]
418 bool isLeftOf(Vertex* v) const { return fLine.dist(v->fPoint) > 0.0; } in isLeftOf() function
392 bool isLeftOf(Vertex* v) const { in isLeftOf() function854 if (prev->isLeftOf(v)) { in find_enclosing_edges()952 if (c.sweep_lt(leftTop->fPoint, top->fPoint) && !edge->fLeft->isLeftOf(top)) { in rewind_if_necessary()957 !edge->fLeft->isLeftOf(bottom)) { in rewind_if_necessary()968 } else if (c.sweep_lt(top->fPoint, rightTop->fPoint) && !edge->isLeftOf(rightTop)) { in rewind_if_necessary()974 !edge->isLeftOf(rightBottom)) { 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()1115 if (!left->isLeftOf(right->fTop)) { in intersect_edge_pair()1126 if (!left->isLeftOf(right->fBottom)) { in intersect_edge_pair()[all …]