Lines Matching refs:nCount
112 const sal_uInt32 nCount(rCandidate.count()); in mergeTemporaryPointsAndPolygon() local
114 if(nCount) in mergeTemporaryPointsAndPolygon()
126 for(sal_uInt32 a(0L); a < nCount; a++) in mergeTemporaryPointsAndPolygon()
925 const sal_uInt32 nCount(rCandidate.count()); in addPointsAtCutsAndTouches() local
927 if(nCount) in addPointsAtCutsAndTouches()
931 if(1L == nCount) in addPointsAtCutsAndTouches()
947 temporaryPolygonData *pTempData = new temporaryPolygonData[nCount]; in addPointsAtCutsAndTouches()
950 for(a = 0L; a < nCount; a++) in addPointsAtCutsAndTouches()
965 for(a = 0L; a < nCount; a++) in addPointsAtCutsAndTouches()
967 for(b = 0L; b < nCount; b++) in addPointsAtCutsAndTouches()
990 for(a = 0L; a < nCount; a++) in addPointsAtCutsAndTouches()
1049 const sal_uInt32 nCount(rCandidate.count()); in addPointsAtCuts() local
1051 if(nCount && !rStart.equal(rEnd)) in addPointsAtCuts()
1058 const sal_uInt32 nEdgeCount(rCandidate.isClosed() ? nCount : nCount - 1); in addPointsAtCuts()
1219 const sal_uInt32 nCount(rCandidate.count()); in addPointsAtCuts() local
1221 if(nCount) in addPointsAtCuts()
1225 if(1 == nCount) in addPointsAtCuts()
1241 temporaryPolygonData *pTempData = new temporaryPolygonData[nCount]; in addPointsAtCuts()
1244 for(a = 0; a < nCount; a++) in addPointsAtCuts()
1259 for(a = 0; a < nCount; a++) in addPointsAtCuts()
1261 for(b = 0; b < nCount; b++) in addPointsAtCuts()
1275 for(a = 0L; a < nCount; a++) in addPointsAtCuts()