Lines Matching refs:a
137 for(sal_uInt32 a(0); a < nCount; a++) in impAddPolygon() local
139 const B2DPoint aPoint(rGeometry.getB2DPoint(a)); in impAddPolygon()
141 aNewPN.mnI = aPos + a; in impAddPolygon()
142 aNewPN.mnIP = aPos + ((a != 0) ? a - 1 : nCount - 1); in impAddPolygon()
143 aNewPN.mnIN = aPos + ((a + 1 == nCount) ? 0 : a + 1); in impAddPolygon()
148 aNewVN.maPrev = rGeometry.getPrevControlPoint(a) - aPoint; in impAddPolygon()
149 aNewVN.maNext = rGeometry.getNextControlPoint(a) - aPoint; in impAddPolygon()
475 sal_uInt32 a(0); in impSolve() local
482 for(a = 1; a < nNodeCount; a++) in impSolve()
484 basegfx::B2DPoint* pCurrent(&maSNV[a].mpPN->maPoint); in impSolve()
507 for(a = 0; a < nNodeCount - 1; a++) in impSolve()
510 PN& rPNb = *(maSNV[a].mpPN); in impSolve()
512 … for(sal_uInt32 b(a + 1); b < nNodeCount && rPNb.maPoint.equal(maSNV[b].mpPN->maPoint); b++) in impSolve()
573 sal_uInt32 a(0); in solver() local
576 for(a = 0; a < nOriginalCount; a++) in solver()
578 const B2DPolygon aCandidate(aGeometry.getB2DPolygon(a)); in solver()
602 for(a = 0; a < nOriginalCount; a++) in solver()
604 const B2DPolygon aCandidate(aGeometry.getB2DPolygon(a)); in solver()
631 for(sal_uInt32 a(0); nCountdown && a < nCount; a++) in getB2DPolyPolygon() local
633 PN& rPN = maPNV[a]; in getB2DPolyPolygon()
689 for(sal_uInt32 a(0); a < nPolygonCount; a++) in getB2DPolyPolygon() local
691 basegfx::B2DPolygon aTemp(aRetval.getB2DPolygon(a)); in getB2DPolyPolygon()
711 aRetval.setB2DPolygon(a, aTemp); in getB2DPolyPolygon()
760 for(sal_uInt32 a(0L); a < rCandidate.count(); a++) in stripNeutralPolygons() local
762 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in stripNeutralPolygons()
797 sal_uInt32 a, b; in createNonzeroConform() local
801 for(a = 0; a < nCount; a++) in createNonzeroConform()
803 const B2DPolygon aCand(aCandidate.getB2DPolygon(a)); in createNonzeroConform()
804 StripHelper* pNewHelper = &(aHelpers[a]); in createNonzeroConform()
812 for(a = 0; a < nCount - 1; a++) in createNonzeroConform()
814 const B2DPolygon aCandA(aCandidate.getB2DPolygon(a)); in createNonzeroConform()
815 StripHelper& rHelperA = aHelpers[a]; in createNonzeroConform()
817 for(b = a + 1; b < nCount; b++) in createNonzeroConform()
842 for(a = 0L; a < nCount; a++) in createNonzeroConform()
844 const StripHelper& rHelper = aHelpers[a]; in createNonzeroConform()
853 aCandidate.append(aSource.getB2DPolygon(a)); in createNonzeroConform()
879 sal_uInt32 a, b; in stripDispensablePolygons() local
883 for(a = 0L; a < nCount; a++) in stripDispensablePolygons()
885 const B2DPolygon aCandidate(rCandidate.getB2DPolygon(a)); in stripDispensablePolygons()
886 StripHelper* pNewHelper = &(aHelpers[a]); in stripDispensablePolygons()
892 for(a = 0L; a < nCount - 1L; a++) in stripDispensablePolygons()
894 const B2DPolygon aCandA(rCandidate.getB2DPolygon(a)); in stripDispensablePolygons()
895 StripHelper& rHelperA = aHelpers[a]; in stripDispensablePolygons()
897 for(b = a + 1L; b < nCount; b++) in stripDispensablePolygons()
949 for(a = 0L; a < nCount; a++) in stripDispensablePolygons()
951 const StripHelper& rHelper = aHelpers[a]; in stripDispensablePolygons()
956 aRetval.append(rCandidate.getB2DPolygon(a)); in stripDispensablePolygons()
1095 for(sal_uInt32 a(0); a < aInput.size(); a++) in mergeToSinglePolyPolygon() local
1097 const basegfx::B2DPolyPolygon aCandidate(prepareForPolygonOperation(aInput[a])); in mergeToSinglePolyPolygon()
1137 for(sal_uInt32 a(0); a < aInput.size(); a += 2) in mergeToSinglePolyPolygon() local
1139 if(a + 1 < aInput.size()) in mergeToSinglePolyPolygon()
1142 aResult.push_back(solvePolygonOperationOr(aInput[a], aInput[a + 1])); in mergeToSinglePolyPolygon()
1147 aResult.push_back(aInput[a]); in mergeToSinglePolyPolygon()