Lines Matching refs:Point
83 mpPointAry = (Point*)new char[(sal_uIntPtr)nInitSize*sizeof(Point)]; in ImplPolygon()
84 memset( mpPointAry, 0, (sal_uIntPtr)nInitSize*sizeof(Point) ); in ImplPolygon()
107 mpPointAry = (Point*)new char[(sal_uIntPtr)rImpPoly.mnPoints*sizeof(Point)]; in ImplPolygon()
108 memcpy( mpPointAry, rImpPoly.mpPointAry, (sal_uIntPtr)rImpPoly.mnPoints*sizeof(Point) ); in ImplPolygon()
130 ImplPolygon::ImplPolygon( sal_uInt16 nInitSize, const Point* pInitAry, const sal_uInt8* pInitFlags ) in ImplPolygon()
134 mpPointAry = (Point*)new char[(sal_uIntPtr)nInitSize*sizeof(Point)]; in ImplPolygon()
135 memcpy( mpPointAry, pInitAry, (sal_uIntPtr)nInitSize*sizeof( Point ) ); in ImplPolygon()
175 Point* pNewAry; in ImplSetSize()
179 pNewAry = (Point*)new char[(sal_uIntPtr)nNewSize*sizeof(Point)]; in ImplSetSize()
187 memset( pNewAry+mnPoints, 0, (sal_uIntPtr)(nNewSize-mnPoints)*sizeof(Point) ); in ImplSetSize()
189 memcpy( pNewAry, mpPointAry, mnPoints*sizeof(Point) ); in ImplSetSize()
194 memcpy( pNewAry, mpPointAry, (sal_uIntPtr)nNewSize*sizeof(Point) ); in ImplSetSize()
241 const sal_uIntPtr nSpaceSize = nSpace * sizeof( Point ); in ImplSplit()
269 Point* pNewAry = (Point*) new char[ (sal_uIntPtr) nNewSize * sizeof( Point ) ]; in ImplSplit()
271 memcpy( pNewAry, mpPointAry, nPos * sizeof( Point ) ); in ImplSplit()
278 memcpy( pNewAry + nSecPos, mpPointAry + nPos, nRest * sizeof( Point ) ); in ImplSplit()
315 Point* pNewAry = (Point*) new char[ (sal_uIntPtr) nNewSize * sizeof( Point ) ]; in ImplRemove()
317 memcpy( pNewAry, mpPointAry, nPos * sizeof( Point ) ); in ImplRemove()
318 memcpy( pNewAry + nPos, mpPointAry + nSecPos, nRest * sizeof( Point ) ); in ImplRemove()
364 inline double ImplGetAngle( const Point& rCenter, const Point& rPt ) in ImplGetAngle()
392 Polygon::Polygon( sal_uInt16 nPoints, const Point* pPtAry, const sal_uInt8* pFlagAry ) in Polygon()
461 const Point aTL( aRect.Left() + nHorzRound, aRect.Top() + nVertRound ); in Polygon()
462 const Point aTR( aRect.Right() - nHorzRound, aRect.Top() + nVertRound ); in Polygon()
463 const Point aBR( aRect.Right() - nHorzRound, aRect.Bottom() - nVertRound ); in Polygon()
464 const Point aBL( aRect.Left() + nHorzRound, aRect.Bottom() - nVertRound ); in Polygon()
465 Polygon* pEllipsePoly = new Polygon( Point(), nHorzRound, nVertRound ); in Polygon()
470 const Point* pSrcAry = pEllipsePoly->GetConstPointAry(); in Polygon()
471 Point* pDstAry = mpImplPolygon->mpPointAry; in Polygon()
493 Polygon::Polygon( const Point& rCenter, long nRadX, long nRadY, sal_uInt16 nPoints ) in Polygon()
514 Point* pPt; in Polygon()
547 const Point& rStart, const Point& rEnd, PolyStyle eStyle ) in Polygon()
556 const Point aCenter( rBound.Center() ); in Polygon()
592 const Point aCenter2( FRound( fCenterX ), FRound( fCenterY ) ); in Polygon()
609 Point& rPt = mpImplPolygon->mpPointAry[ nStart ]; in Polygon()
624 Polygon::Polygon( const Point& rBezPt1, const Point& rCtrlPt1, in Polygon()
625 const Point& rBezPt2, const Point& rCtrlPt2, in Polygon()
648 Point& rPt = mpImplPolygon->mpPointAry[ i ]; in Polygon()
678 Point* Polygon::ImplGetPointAry() in ImplGetPointAry()
683 return (Point*)mpImplPolygon->mpPointAry; in ImplGetPointAry()
699 const Point* Polygon::GetConstPointAry() const in GetConstPointAry()
702 return (Point*)mpImplPolygon->mpPointAry; in GetConstPointAry()
715 void Polygon::SetPoint( const Point& rPt, sal_uInt16 nPos ) in SetPoint()
745 const Point& Polygon::GetPoint( sal_uInt16 nPos ) const in GetPoint()
867 const Point& rP1 = mpImplPolygon->mpPointAry[ nP1 ]; in CalcDistance()
868 const Point& rP2 = mpImplPolygon->mpPointAry[ nP2 ]; in CalcDistance()
898 const Point& rFirst = mpImplPolygon->mpPointAry[ 0 ]; in Optimize()
947 const Point& rFirst = mpImplPolygon->mpPointAry[ 0 ]; in Optimize()
976 static void ImplAdaptiveSubdivide( ::std::back_insert_iterator< ::std::vector< Point > >& rPointIte… in ImplAdaptiveSubdivide()
1036 *rPointIter++ = Point( FRound(P1x), FRound(P1y) ); in ImplAdaptiveSubdivide()
1052 ::std::vector< Point > aPoints; in AdaptiveSubdivide()
1054 ::std::back_insert_iterator< ::std::vector< Point > > aPointIter( aPoints ); in AdaptiveSubdivide()
1249 Point* pPt = &(mpImplPolygon->mpPointAry[i]); in Move()
1257 void Polygon::Translate(const Point& rTrans) in Translate()
1275 Point& rPnt = mpImplPolygon->mpPointAry[i]; in Scale()
1283 void Polygon::Rotate( const Point& rCenter, sal_uInt16 nAngle10 ) in Rotate()
1297 void Polygon::Rotate( const Point& rCenter, double fSin, double fCos ) in Rotate()
1308 Point& rPt = mpImplPolygon->mpPointAry[ i ]; in Rotate()
1326 Point& rPnt = mpImplPolygon->mpPointAry[ i ]; in SlantX()
1343 Point& rPnt = mpImplPolygon->mpPointAry[ i ]; in SlantY()
1382 Point& rPnt = mpImplPolygon->mpPointAry[ i ]; in Distort()
1401 virtual void Input( const Point& rPoint ) = 0;
1417 virtual void Input( const Point& rPoint );
1420 void ImplPolygonPointFilter::Input( const Point& rPoint ) in Input()
1439 Point maFirstPoint;
1440 Point maLastPoint;
1459 Point EdgeSection( const Point& rPoint, int nEdge ) const;
1460 int VisibleSide( const Point& rPoint ) const;
1464 virtual void Input( const Point& rPoint );
1468 inline int ImplEdgePointFilter::VisibleSide( const Point& rPoint ) const in VisibleSide()
1482 Point ImplEdgePointFilter::EdgeSection( const Point& rPoint, int nEdge ) const in EdgeSection()
1544 return Point( nNewX, nNewY ); in EdgeSection()
1547 void ImplEdgePointFilter::Input( const Point& rPoint ) in Input()
1646 const Point* pPt = &(mpImplPolygon->mpPointAry[0]); in GetBoundRect()
1690 const Point& rPt = mpImplPolygon->mpPointAry[ i ]; in GetSignedArea()
1691 const Point& rPt1 = mpImplPolygon->mpPointAry[ ++i ]; in GetSignedArea()
1695 const Point& rPt = mpImplPolygon->mpPointAry[ nCount1 ]; in GetSignedArea()
1696 const Point& rPt0 = mpImplPolygon->mpPointAry[ 0 ]; in GetSignedArea()
1705 sal_Bool Polygon::IsInside( const Point& rPoint ) const in IsInside()
1711 const Line aLine( rPoint, Point( aBound.Right() + 100L, rPoint.Y() ) ); in IsInside()
1717 Point aPt1( mpImplPolygon->mpPointAry[ 0 ] ); in IsInside()
1718 Point aIntersection; in IsInside()
1719 Point aLastIntersection; in IsInside()
1726 const Point& rPt2 = mpImplPolygon->mpPointAry[ ( i < nCount ) ? i : 0 ]; in IsInside()
1765 void Polygon::Insert( sal_uInt16 nPos, const Point& rPt, PolyFlags eFlags ) in Insert()
1818 Point& Polygon::operator[]( sal_uInt16 nPos ) in operator []()
1966 rIStream.Read( rPoly.mpImplPolygon->mpPointAry, nPoints*sizeof(Point) ); in operator >>()
2068 rOStream.Write( rPoly.mpImplPolygon->mpPointAry, nPoints*sizeof(Point) ); in operator <<()
2192 const Point aStartPoint(mpImplPolygon->mpPointAry[0]); in getB2DPolygon()
2195 Point aControlA, aControlB; in getB2DPolygon()
2219 const Point aEndPoint(mpImplPolygon->mpPointAry[a]); in getB2DPolygon()
2257 const Point aPoint(mpImplPolygon->mpPointAry[a]); in getB2DPolygon()
2311 …const Point aStartPoint(FRound(aBezier.getStartPoint().getX()), FRound(aBezier.getStartPoint().get… in Polygon()
2326 …mpImplPolygon->mpPointAry[nArrayInsert] = Point(FRound(aBezier.getControlPointA().getX()), FRound(… in Polygon()
2330 …mpImplPolygon->mpPointAry[nArrayInsert] = Point(FRound(aBezier.getControlPointB().getX()), FRound(… in Polygon()
2365 const Point aEnd(FRound(aClosingPoint.getX()), FRound(aClosingPoint.getY())); in Polygon()
2398 Point aPoint(FRound(aB2DPoint.getX()), FRound(aB2DPoint.getY())); in Polygon()