Lines Matching refs:i
466 sal_uInt16 i, nEnd, nSize4 = pEllipsePoly->GetSize() >> 2; in Polygon() local
473 for( i = 0, nEnd = nSize4; i < nEnd; i++ ) in Polygon()
474 ( pDstAry[ i ] = pSrcAry[ i ] ) += aTR; in Polygon()
476 for( nEnd = nEnd + nSize4; i < nEnd; i++ ) in Polygon()
477 ( pDstAry[ i ] = pSrcAry[ i ] ) += aTL; in Polygon()
479 for( nEnd = nEnd + nSize4; i < nEnd; i++ ) in Polygon()
480 ( pDstAry[ i ] = pSrcAry[ i ] ) += aBL; in Polygon()
482 for( nEnd = nEnd + nSize4; i < nEnd; i++ ) in Polygon()
483 ( pDstAry[ i ] = pSrcAry[ i ] ) += aBR; in Polygon()
515 sal_uInt16 i; in Polygon() local
521 for( i=0, nAngle = 0.0; i < nPoints4; i++, nAngle += nAngleStep ) in Polygon()
526 pPt = &(mpImplPolygon->mpPointAry[i]); in Polygon()
529 pPt = &(mpImplPolygon->mpPointAry[nPoints2-i-1]); in Polygon()
532 pPt = &(mpImplPolygon->mpPointAry[i+nPoints2]); in Polygon()
535 pPt = &(mpImplPolygon->mpPointAry[nPoints-i-1]); in Polygon()
646 for( sal_uInt16 i = 0; i < nPoints; i++, fK_1 += fInc, fK1_1 -= fInc ) in Polygon() local
648 Point& rPt = mpImplPolygon->mpPointAry[ i ]; in Polygon()
916 for( sal_uInt16 i = 1; i < nSize; i++ ) in Optimize() local
918 if( ( mpImplPolygon->mpPointAry[ i ] != mpImplPolygon->mpPointAry[ nLast ] ) && in Optimize()
919 ( !nReduce || ( nReduce < (sal_uIntPtr) FRound( CalcDistance( nLast, i ) ) ) ) ) in Optimize()
921 aNewPoly[ nNewCount++ ] = mpImplPolygon->mpPointAry[ nLast = i ]; in Optimize()
1050 sal_uInt16 i; in AdaptiveSubdivide() local
1056 for(i=0; i<nPts;) in AdaptiveSubdivide()
1058 if( ( i + 3 ) < nPts ) in AdaptiveSubdivide()
1060 sal_uInt8 P1( mpImplPolygon->mpFlagAry[ i ] ); in AdaptiveSubdivide()
1061 sal_uInt8 P4( mpImplPolygon->mpFlagAry[ i + 3 ] ); in AdaptiveSubdivide()
1064 ( POLY_CONTROL == mpImplPolygon->mpFlagAry[ i + 1 ] ) && in AdaptiveSubdivide()
1065 ( POLY_CONTROL == mpImplPolygon->mpFlagAry[ i + 2 ] ) && in AdaptiveSubdivide()
1069 … mpImplPolygon->mpPointAry[ i ].X(), mpImplPolygon->mpPointAry[ i ].Y(), in AdaptiveSubdivide()
1070 … mpImplPolygon->mpPointAry[ i+1 ].X(), mpImplPolygon->mpPointAry[ i+1 ].Y(), in AdaptiveSubdivide()
1071 … mpImplPolygon->mpPointAry[ i+2 ].X(), mpImplPolygon->mpPointAry[ i+2 ].Y(), in AdaptiveSubdivide()
1072 … mpImplPolygon->mpPointAry[ i+3 ].X(), mpImplPolygon->mpPointAry[ i+3 ].Y() ); in AdaptiveSubdivide()
1073 i += 3; in AdaptiveSubdivide()
1078 *aPointIter++ = mpImplPolygon->mpPointAry[ i++ ]; in AdaptiveSubdivide()
1247 for ( sal_uInt16 i = 0; i < nCount; i++ ) in Move() local
1249 Point* pPt = &(mpImplPolygon->mpPointAry[i]); in Move()
1262 for ( sal_uInt16 i = 0, nCount = mpImplPolygon->mnPoints; i < nCount; i++ ) in Translate() local
1263 mpImplPolygon->mpPointAry[ i ] += rTrans; in Translate()
1273 for ( sal_uInt16 i = 0, nCount = mpImplPolygon->mnPoints; i < nCount; i++ ) in Scale() local
1275 Point& rPnt = mpImplPolygon->mpPointAry[i]; in Scale()
1306 for( sal_uInt16 i = 0, nCount = mpImplPolygon->mnPoints; i < nCount; i++ ) in Rotate() local
1308 Point& rPt = mpImplPolygon->mpPointAry[ i ]; in Rotate()
1324 for( sal_uInt16 i = 0, nCount = mpImplPolygon->mnPoints; i < nCount; i++ ) in SlantX() local
1326 Point& rPnt = mpImplPolygon->mpPointAry[ i ]; in SlantX()
1341 for( sal_uInt16 i = 0, nCount = mpImplPolygon->mnPoints; i < nCount; i++ ) in SlantY() local
1343 Point& rPnt = mpImplPolygon->mpPointAry[ i ]; in SlantY()
1380 for( sal_uInt16 i = 0, nCount = mpImplPolygon->mnPoints; i < nCount; i++ ) in Distort() local
1382 Point& rPnt = mpImplPolygon->mpPointAry[ i ]; in Distort()
1605 for ( sal_uInt16 i = 0; i < nSourceSize; i++ ) in Clip() local
1606 aVertFilter.Input( mpImplPolygon->mpPointAry[i] ); in Clip()
1650 for ( sal_uInt16 i = 0; i < nCount; i++ ) in GetBoundRect() local
1652 pPt = &(mpImplPolygon->mpPointAry[i]); in GetBoundRect()
1688 for( sal_uInt16 i = 0; i < nCount1; ) in GetSignedArea() local
1690 const Point& rPt = mpImplPolygon->mpPointAry[ i ]; in GetSignedArea()
1691 const Point& rPt1 = mpImplPolygon->mpPointAry[ ++i ]; in GetSignedArea()
1724 for ( sal_uInt16 i = 1; i <= nCount; i++ ) in IsInside() local
1726 const Point& rPt2 = mpImplPolygon->mpPointAry[ ( i < nCount ) ? i : 0 ]; in IsInside()
1872 sal_uInt16 i; in IsEqual() local
1877 for ( i = 0; i < GetSize(); i++ ) in IsEqual()
1879 if ( ( GetPoint( i ) != rPoly.GetPoint( i ) ) || in IsEqual()
1880 ( GetFlags( i ) != rPoly.GetFlags( i ) ) ) in IsEqual()
1897 sal_uInt16 i; in operator >>() local
1921 i = 0; in operator >>()
1922 while ( i < nPoints ) in operator >>()
1928 for ( nStart = i; i < nStart+nCurPoints; i++ ) in operator >>()
1931 rPoly.mpImplPolygon->mpPointAry[i].X() = nShortX; in operator >>()
1932 rPoly.mpImplPolygon->mpPointAry[i].Y() = nShortY; in operator >>()
1937 for ( nStart = i; i < nStart+nCurPoints; i++ ) in operator >>()
1940 rPoly.mpImplPolygon->mpPointAry[i].X() = nLongX; in operator >>()
1941 rPoly.mpImplPolygon->mpPointAry[i].Y() = nLongY; in operator >>()
1959 for( i = 0; i < nPoints; i++ ) in operator >>()
1961 rIStream >> rPoly.mpImplPolygon->mpPointAry[i].X() in operator >>()
1962 >> rPoly.mpImplPolygon->mpPointAry[i].Y(); in operator >>()
1982 sal_uInt16 i; in operator <<() local
1991 i = 0; in operator <<()
1992 while ( i < nPoints ) in operator <<()
1994 nStart = i; in operator <<()
2004 while ( i < nPoints ) in operator <<()
2023 i++; in operator <<()
2026 rOStream << bShort << (sal_uInt16)(i-nStart); in operator <<()
2030 for( ; nStart < i; nStart++ ) in operator <<()
2038 for( ; nStart < i; nStart++ ) in operator <<()
2059 for( i = 0; i < nPoints; i++ ) in operator <<()
2061 rOStream << rPoly.mpImplPolygon->mpPointAry[i].X() in operator <<()
2062 << rPoly.mpImplPolygon->mpPointAry[i].Y(); in operator <<()