Lines Matching refs:aCandidate

399 …const B2DPolygon aCandidate(rCandidate.areControlPointsUsed() ? rCandidate.getDefaultAdaptiveSubdi…  in isInside()  local
401 if(bWithBorder && isPointOnPolygon(aCandidate, rPoint, true)) in isInside()
408 const sal_uInt32 nPointCount(aCandidate.count()); in isInside()
412 B2DPoint aCurrentPoint(aCandidate.getB2DPoint(nPointCount - 1L)); in isInside()
417 aCurrentPoint = aCandidate.getB2DPoint(a); in isInside()
458 …const B2DPolygon aCandidate(rCandidate.areControlPointsUsed() ? rCandidate.getDefaultAdaptiveSubdi… in isInside() local
466 if(!isInside(aCandidate, aTestPoint, bWithBorder)) in isInside()
507 …const B2DPolygon aCandidate(rCandidate.areControlPointsUsed() ? rCandidate.getDefaultAdaptiveSubdi… in getSignedArea() local
509 const sal_uInt32 nPointCount(aCandidate.count()); in getSignedArea()
515 const B2DPoint aPreviousPoint(aCandidate.getB2DPoint((!a) ? nPointCount - 1L : a - 1L)); in getSignedArea()
516 const B2DPoint aCurrentPoint(aCandidate.getB2DPoint(a)); in getSignedArea()
1634 const B2DPolygon aCandidate(rCandidate.getDefaultAdaptiveSubdivision()); in isInEpsilonRange() local
1635 const sal_uInt32 nPointCount(aCandidate.count()); in isInEpsilonRange()
1639 const sal_uInt32 nEdgeCount(aCandidate.isClosed() ? nPointCount : nPointCount - 1L); in isInEpsilonRange()
1640 B2DPoint aCurrent(aCandidate.getB2DPoint(0)); in isInEpsilonRange()
1648 const B2DPoint aNext(aCandidate.getB2DPoint(nNextIndex)); in isInEpsilonRange()
2265 …const B2DPolygon aCandidate(rCandidate.areControlPointsUsed() ? rCandidate.getDefaultAdaptiveSubdi… in isPointOnPolygon() local
2266 const sal_uInt32 nPointCount(aCandidate.count()); in isPointOnPolygon()
2270 const sal_uInt32 nLoopCount(aCandidate.isClosed() ? nPointCount : nPointCount - 1L); in isPointOnPolygon()
2271 B2DPoint aCurrentPoint(aCandidate.getB2DPoint(0L)); in isPointOnPolygon()
2275 const B2DPoint aNextPoint(aCandidate.getB2DPoint((a + 1L) % nPointCount)); in isPointOnPolygon()
2287 return rPoint.equal(aCandidate.getB2DPoint(0L)); in isPointOnPolygon()
2470 const B2DPolygon aCandidate(adaptiveSubdivideByAngle(rCandidate)); in createB3DPolygonFromB2DPolygon() local
2471 return createB3DPolygonFromB2DPolygon(aCandidate, fZCoordinate); in createB3DPolygonFromB2DPolygon()
2498 B3DPoint aCandidate(rCandidate.getB3DPoint(a)); in createB2DPolygonFromB3DPolygon() local
2502 aCandidate *= rMat; in createB2DPolygonFromB3DPolygon()
2505 aRetval.append(B2DPoint(aCandidate.getX(), aCandidate.getY())); in createB2DPolygonFromB3DPolygon()
2952 const B2DPolygon aCandidate(adaptiveSubdivideByAngle(rCandidate)); in growInNormalDirection() local
2953 return growInNormalDirection(aCandidate, fValue); in growInNormalDirection()
3385 …const B2DPolygon aCandidate(rCandidate.areControlPointsUsed() ? rCandidate.getDefaultAdaptiveSubdi… in createEdgesOfGivenLength() local
3386 const sal_uInt32 nPointCount(aCandidate.count()); in createEdgesOfGivenLength()
3391 const sal_uInt32 nEdgeCount(aCandidate.isClosed() ? nPointCount : nPointCount - 1); in createEdgesOfGivenLength()
3392 B2DPoint aCurrent(aCandidate.getB2DPoint(0)); in createEdgesOfGivenLength()
3399 const B2DPoint aNext(aCandidate.getB2DPoint(nNextIndex)); in createEdgesOfGivenLength()
3437 aRetval.setClosed(aCandidate.isClosed()); in createEdgesOfGivenLength()
3442 aRetval = aCandidate; in createEdgesOfGivenLength()