INTEGRATION: CWS hedaburemove01 (1.1.2); FILE ADDED

2006/12/12 16:24:49 vg 1.1.2.1: #i72503# gathered global includes in one place

3 files changed, 594 insertions, 0 deletions

diff --git a/tools/inc/tools/multisel.hxx b/tools/inc/tools/multisel.hxx
new file mode 100644
index 000000000000..67c499fc9fd4
--- /dev/null
+++ b/tools/inc/tools/multisel.hxx
@@ -0,0 +1,129 @@
+/*************************************************************************
+ *
+ *  OpenOffice.org - a multi-platform office productivity suite
+ *
+ *  $RCSfile: multisel.hxx,v $
+ *
+ *  $Revision: 1.2 $
+ *
+ *  last change: $Author: vg $ $Date: 2007-04-11 20:14:17 $
+ *
+ *  The Contents of this file are made available subject to
+ *  the terms of GNU Lesser General Public License Version 2.1.
+ *
+ *
+ *    GNU Lesser General Public License Version 2.1
+ *    =============================================
+ *    Copyright 2005 by Sun Microsystems, Inc.
+ *    901 San Antonio Road, Palo Alto, CA 94303, USA
+ *
+ *    This library is free software; you can redistribute it and/or
+ *    modify it under the terms of the GNU Lesser General Public
+ *    License version 2.1, as published by the Free Software Foundation.
+ *
+ *    This library is distributed in the hope that it will be useful,
+ *    but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ *    Lesser General Public License for more details.
+ *
+ *    You should have received a copy of the GNU Lesser General Public
+ *    License along with this library; if not, write to the Free Software
+ *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,
+ *    MA  02111-1307  USA
+ *
+ ************************************************************************/
+#ifndef _SV_MULTISEL_HXX
+#define _SV_MULTISEL_HXX
+
+#ifndef INCLUDED_TOOLSDLLAPI_H
+#include "tools/toolsdllapi.h"
+#endif
+
+#ifndef _GEN_HXX
+#include <tools/gen.hxx>
+#endif
+#ifndef _LIST_HXX
+#include <tools/list.hxx>
+#endif
+#ifndef _STRING_HXX
+#include <tools/string.hxx>
+#endif
+
+//------------------------------------------------------------------
+
+#ifdef _SV_MULTISEL_CXX
+DECLARE_LIST( ImpSelList, Range* )
+#else
+#define ImpSelList List
+#endif
+
+#define SFX_ENDOFSELECTION      CONTAINER_ENTRY_NOTFOUND
+
+//------------------------------------------------------------------
+
+// ------------------
+// - MultiSelection -
+// ------------------
+
+class TOOLS_DLLPUBLIC MultiSelection
+{
+private:
+    ImpSelList      aSels;      // array of SV-selections
+    Range           aTotRange;  // total range of indexes
+    ULONG           nCurSubSel; // index in aSels of current selected index
+    long            nCurIndex;  // current selected entry
+    ULONG           nSelCount;  // number of selected indexes
+    BOOL            bInverseCur;// inverse cursor
+    BOOL            bCurValid;  // are nCurIndex and nCurSubSel valid
+    BOOL            bSelectNew; // auto-select newly inserted indexes
+
+#ifdef _SV_MULTISEL_CXX
+    TOOLS_DLLPRIVATE void           ImplClear();
+    TOOLS_DLLPRIVATE ULONG          ImplFindSubSelection( long nIndex ) const;
+    TOOLS_DLLPRIVATE BOOL           ImplMergeSubSelections( ULONG nPos1, ULONG nPos2 );
+    TOOLS_DLLPRIVATE long           ImplFwdUnselected();
+    TOOLS_DLLPRIVATE long           ImplBwdUnselected();
+#endif
+
+public:
+                    MultiSelection();
+                    MultiSelection( const MultiSelection& rOrig );
+                    MultiSelection( const Range& rRange );
+                    MultiSelection( const UniString& rString,
+                                    sal_Unicode cRange = '-',
+                                    sal_Unicode cSep = ';' );
+                    ~MultiSelection();
+
+    MultiSelection& operator= ( const MultiSelection& rOrig );
+    BOOL            operator== ( MultiSelection& rOrig );
+    BOOL            operator!= ( MultiSelection& rOrig )
+                        { return !operator==( rOrig ); }
+    BOOL            operator !() const
+                        { return nSelCount == 0; }
+
+    void            SelectAll( BOOL bSelect = TRUE );
+    BOOL            Select( long nIndex, BOOL bSelect = TRUE );
+    void            Select( const Range& rIndexRange, BOOL bSelect = TRUE );
+    BOOL            IsSelected( long nIndex ) const;
+    BOOL            IsAllSelected() const
+                        { return nSelCount == ULONG(aTotRange.Len()); }
+    long            GetSelectCount() const { return nSelCount; }
+
+    void            SetTotalRange( const Range& rTotRange );
+    void            Insert( long nIndex, long nCount = 1 );
+    void            Remove( long nIndex );
+    void            Append( long nCount = 1 );
+
+    const Range&    GetTotalRange() const { return aTotRange; }
+    BOOL            IsCurValid() const { return bCurValid; }
+    long            GetCurSelected() const { return nCurIndex; }
+    long            FirstSelected( BOOL bInverse = FALSE );
+    long            LastSelected();
+    long            NextSelected();
+    long            PrevSelected();
+
+    ULONG           GetRangeCount() const { return aSels.Count(); }
+    const Range&    GetRange( ULONG nRange ) const { return *(const Range*)aSels.GetObject(nRange); }
+};
+
+#endif  // _SV_MULTISEL_HXX
diff --git a/tools/inc/tools/ownlist.hxx b/tools/inc/tools/ownlist.hxx
new file mode 100644
index 000000000000..0b28b36b6af4
--- /dev/null
+++ b/tools/inc/tools/ownlist.hxx
@@ -0,0 +1,102 @@
+/*************************************************************************
+ *
+ *  OpenOffice.org - a multi-platform office productivity suite
+ *
+ *  $RCSfile: ownlist.hxx,v $
+ *
+ *  $Revision: 1.2 $
+ *
+ *  last change: $Author: vg $ $Date: 2007-04-11 20:14:27 $
+ *
+ *  The Contents of this file are made available subject to
+ *  the terms of GNU Lesser General Public License Version 2.1.
+ *
+ *
+ *    GNU Lesser General Public License Version 2.1
+ *    =============================================
+ *    Copyright 2005 by Sun Microsystems, Inc.
+ *    901 San Antonio Road, Palo Alto, CA 94303, USA
+ *
+ *    This library is free software; you can redistribute it and/or
+ *    modify it under the terms of the GNU Lesser General Public
+ *    License version 2.1, as published by the Free Software Foundation.
+ *
+ *    This library is distributed in the hope that it will be useful,
+ *    but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ *    Lesser General Public License for more details.
+ *
+ *    You should have received a copy of the GNU Lesser General Public
+ *    License along with this library; if not, write to the Free Software
+ *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,
+ *    MA  02111-1307  USA
+ *
+ ************************************************************************/
+
+#ifndef _TOOLS_OWNLIST_HXX
+#define _TOOLS_OWNLIST_HXX
+
+#ifndef _TOOLS_LIST_HXX //autogen
+#include <tools/list.hxx>
+#endif
+/*************************************************************************
+*************************************************************************/
+
+#define PRV_SV_DECL_OWNER_LIST(ClassName,Type)                            \
+    List  aTypes;                                                         \
+public:                                                                   \
+                        ClassName( USHORT nInitSize = 16,                 \
+                                   USHORT nReSize = 16 )                  \
+                            : aTypes( nInitSize, nReSize ) {}             \
+                        ClassName( const ClassName & rObj )               \
+                        { *this = rObj; }                                 \
+    ClassName &         operator = ( const ClassName & );                 \
+                        ~ClassName()                                      \
+                        { Clear(); }                                      \
+    void                Clear();                                          \
+    void                Remove()                                          \
+                        { delete (Type *)aTypes.Remove(); }               \
+    void                Remove( Type * pObj )                             \
+                        { delete (Type *)aTypes.Remove( pObj ); }         \
+    void                Remove( ULONG nPos )                              \
+                        { delete (Type *)aTypes.Remove( nPos ); }         \
+    Type &              Insert( const Type &, ULONG nPos );               \
+    Type &              Insert( const Type & rType )                      \
+                        { return Insert( rType, aTypes.GetCurPos() ); }   \
+    Type &              Append( const Type & rType )                      \
+                        { return Insert( rType, LIST_APPEND ); }          \
+    Type &              GetObject( ULONG nPos ) const                     \
+                        { return *(Type *)aTypes.GetObject( nPos ); }     \
+    Type &              operator []( ULONG nPos ) const                   \
+                        { return *(Type *)aTypes.GetObject( nPos ); }     \
+    ULONG               Count() const { return aTypes.Count(); }
+
+#define PRV_SV_IMPL_OWNER_LIST(ClassName,Type)                          \
+ClassName & ClassName::operator = ( const ClassName & rObj )            \
+{                                                                       \
+    if( this != &rObj )                                                 \
+    {                                                                   \
+        Clear();                                                        \
+        for( ULONG i = 0; i < rObj.Count(); i++ )                       \
+            Append( rObj.GetObject( i ) );                              \
+    }                                                                   \
+    return *this;                                                       \
+}                                                                       \
+void ClassName::Clear()                                                 \
+{                                                                       \
+    Type * p = (Type *)aTypes.First();                                  \
+    while( p )                                                          \
+    {                                                                   \
+        delete p;                                                       \
+        p = (Type *)aTypes.Next();                                      \
+    }                                                                   \
+    aTypes.Clear();                                                     \
+}                                                                       \
+Type & ClassName::Insert( const Type & rType, ULONG nPos )              \
+{                                                                       \
+    Type * pType = new Type( rType );                                   \
+    aTypes.Insert( pType, nPos );                                       \
+    return *pType;                                                      \
+}
+
+#endif // _TOOLS_OWNLIST_HXX
diff --git a/tools/inc/tools/poly.hxx b/tools/inc/tools/poly.hxx
new file mode 100644
index 000000000000..67c96d27a2b3
--- /dev/null
+++ b/tools/inc/tools/poly.hxx
@@ -0,0 +1,363 @@
+/*************************************************************************
+ *
+ *  OpenOffice.org - a multi-platform office productivity suite
+ *
+ *  $RCSfile: poly.hxx,v $
+ *
+ *  $Revision: 1.2 $
+ *
+ *  last change: $Author: vg $ $Date: 2007-04-11 20:14:35 $
+ *
+ *  The Contents of this file are made available subject to
+ *  the terms of GNU Lesser General Public License Version 2.1.
+ *
+ *
+ *    GNU Lesser General Public License Version 2.1
+ *    =============================================
+ *    Copyright 2005 by Sun Microsystems, Inc.
+ *    901 San Antonio Road, Palo Alto, CA 94303, USA
+ *
+ *    This library is free software; you can redistribute it and/or
+ *    modify it under the terms of the GNU Lesser General Public
+ *    License version 2.1, as published by the Free Software Foundation.
+ *
+ *    This library is distributed in the hope that it will be useful,
+ *    but WITHOUT ANY WARRANTY; without even the implied warranty of
+ *    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+ *    Lesser General Public License for more details.
+ *
+ *    You should have received a copy of the GNU Lesser General Public
+ *    License along with this library; if not, write to the Free Software
+ *    Foundation, Inc., 59 Temple Place, Suite 330, Boston,
+ *    MA  02111-1307  USA
+ *
+ ************************************************************************/
+#ifndef _TL_POLY_HXX
+#define _TL_POLY_HXX
+
+#ifndef INCLUDED_TOOLSDLLAPI_H
+#include "tools/toolsdllapi.h"
+#endif
+
+#ifndef _GEN_HXX
+#include <tools/gen.hxx>
+#endif
+#ifndef _DEBUG_HXX
+#include <tools/debug.hxx>
+#endif
+
+#include <vector>
+
+// -----------
+// - Defines -
+// -----------
+
+#define POLY_APPEND             (0xFFFF)
+#define POLYPOLY_APPEND         (0xFFFF)
+
+// ------------------------------------------------------------------------
+
+#define POLY_OPTIMIZE_NONE      0x00000000UL
+#define POLY_OPTIMIZE_OPEN      0x00000001UL
+#define POLY_OPTIMIZE_CLOSE     0x00000002UL
+#define POLY_OPTIMIZE_NO_SAME   0x00000004UL
+#define POLY_OPTIMIZE_REDUCE    0x00000008UL
+#define POLY_OPTIMIZE_EDGES     0x00000010UL
+
+// -------------
+// - PolyStyle -
+// -------------
+
+enum PolyStyle
+{
+    POLY_ARC = 1,
+    POLY_PIE = 2,
+    POLY_CHORD = 3
+};
+
+// -------------
+// - PolyFlags -
+// -------------
+
+#ifndef ENUM_POLYFLAGS_DECLARED
+#define ENUM_POLYFLAGS_DECLARED
+enum PolyFlags
+{
+    POLY_NORMAL,
+    POLY_SMOOTH,
+    POLY_CONTROL,
+    POLY_SYMMTR
+};
+#endif
+
+// ----------------
+// - PolyOptimize -
+// ----------------
+
+class PolyOptimizeData
+{
+private:
+
+    enum DataType   { DATA_NONE = 0, DATA_ABSOLUT = 1, DATA_PERCENT = 2 };
+    DataType        eType;
+    union           { ULONG mnAbsolut; USHORT mnPercent; };
+
+public:
+
+                    PolyOptimizeData() : eType( DATA_NONE ) {}
+                    PolyOptimizeData( ULONG nAbsolut ) : eType( DATA_ABSOLUT ), mnAbsolut( nAbsolut ) {}
+                    PolyOptimizeData( USHORT nPercent ) : eType( DATA_PERCENT ), mnPercent( nPercent ) {}
+
+    ULONG           GetAbsValue() const { DBG_ASSERT( eType == DATA_ABSOLUT, "Wrong data type" ); return mnAbsolut; }
+    USHORT          GetPercentValue() const { DBG_ASSERT( eType == DATA_PERCENT, "Wrong data type" ); return mnPercent; }
+};
+
+// -----------
+// - Polygon -
+// -----------
+
+class SvStream;
+class ImplPolygon;
+class ImplPolyPolygon;
+class PolyPolygon;
+
+namespace basegfx
+{
+    class B2DPolygon;
+    class B2DPolyPolygon;
+} // end of namespace basegfx
+
+class TOOLS_DLLPUBLIC Polygon
+{
+private:
+
+    ImplPolygon*        mpImplPolygon;
+
+    TOOLS_DLLPRIVATE inline void ImplMakeUnique();
+
+//#if 0 // _SOLAR__PRIVATE
+
+public:
+
+    Point*              ImplGetPointAry();
+    BYTE*               ImplGetFlagAry();
+
+    static void         ImplReduceEdges( Polygon& rPoly, const double& rArea, USHORT nPercent );
+    void                ImplRead( SvStream& rIStream );
+    void                ImplWrite( SvStream& rOStream ) const;
+
+//#endif // __PRIVATE
+
+public:
+                        Polygon();
+                        Polygon( USHORT nSize );
+                        Polygon( USHORT nPoints, const Point* pPtAry,
+                                 const BYTE* pFlagAry = NULL );
+                        Polygon( const Rectangle& rRect );
+                        Polygon( const Rectangle& rRect,
+                                 ULONG nHorzRound, ULONG nVertRound );
+                        Polygon( const Point& rCenter,
+                                 long nRadX, long nRadY,
+                                 USHORT nPoints = 0 );
+                        Polygon( const Rectangle& rBound,
+                                 const Point& rStart, const Point& rEnd,
+                                 PolyStyle ePolyStyle = POLY_ARC );
+                        Polygon( const Point& rBezPt1, const Point& rCtrlPt1,
+                                 const Point& rBezPt2, const Point& rCtrlPt2,
+                                 USHORT nPoints = 0 );
+
+                        Polygon( const Polygon& rPoly );
+                        ~Polygon();
+
+    void                SetPoint( const Point& rPt, USHORT nPos );
+    const Point&        GetPoint( USHORT nPos ) const;
+
+    void                SetFlags( USHORT nPos, PolyFlags eFlags );
+    PolyFlags           GetFlags( USHORT nPos ) const;
+    sal_Bool            HasFlags() const;
+
+    BOOL                IsControl( USHORT nPos ) const;
+    BOOL                IsSmooth( USHORT nPos ) const;
+    BOOL                IsRect() const;
+
+    void                SetSize( USHORT nNewSize );
+    USHORT              GetSize() const;
+
+    void                Clear();
+
+    Rectangle           GetBoundRect() const;
+    double              GetArea() const;
+    double              GetSignedArea() const;
+    BOOL                IsInside( const Point& rPt ) const;
+    BOOL                IsRightOrientated() const;
+    double              CalcDistance( USHORT nPt1, USHORT nPt2 );
+    void                Clip( const Rectangle& rRect, BOOL bPolygon = TRUE );
+    void                Optimize( ULONG nOptimizeFlags, const PolyOptimizeData* pData = NULL );
+
+    void                GetSimple( Polygon& rResult ) const;
+    /** Adaptive subdivision of polygons with curves
+
+        This method adaptively subdivides bezier arcs within the
+        polygon to straight line segments and returns the resulting
+        polygon.
+
+        @param rResult
+        The resulting subdivided polygon
+
+        @param d
+        This parameter controls the amount of subdivision. The
+        original curve is guaranteed to not differ by more than this
+        amount per bezier segment from the subdivided
+        lines. Concretely, if the polygon is in device coordinates and
+        d equals 1.0, then the difference between the subdivided and
+        the original polygon is guaranteed to be smaller than one
+        pixel.
+     */
+    void                AdaptiveSubdivide( Polygon& rResult, const double d = 1.0 ) const;
+
+    void                GetIntersection( const PolyPolygon& rPolyPoly, PolyPolygon& rResult ) const;
+    void                GetUnion( const PolyPolygon& rPolyPoly, PolyPolygon& rResult ) const;
+    void                GetDifference( const PolyPolygon& rPolyPoly, PolyPolygon& rResult ) const;
+    void                GetXOR( const PolyPolygon& rPolyPoly, PolyPolygon& rResult ) const;
+
+    void                Move( long nHorzMove, long nVertMove );
+    void                Translate( const Point& rTrans );
+    void                Scale( double fScaleX, double fScaleY );
+    void                Rotate( const Point& rCenter, double fSin, double fCos );
+    void                Rotate( const Point& rCenter, USHORT nAngle10 );
+    void                SlantX( long nYRef, double fSin, double fCos );
+    void                SlantY( long nXRef, double fSin, double fCos );
+    void                Distort( const Rectangle& rRefRect, const Polygon& rDistortedRect );
+
+    void                Insert( USHORT nPos, const Point& rPt, PolyFlags eFlags = POLY_NORMAL );
+    void                Insert( USHORT nPos, const Polygon& rPoly );
+    void                Remove( USHORT nPos, USHORT nCount );
+
+    const Point&        operator[]( USHORT nPos ) const { return GetPoint( nPos ); }
+    Point&              operator[]( USHORT nPos );
+
+    Polygon&            operator=( const Polygon& rPoly );
+    BOOL                operator==( const Polygon& rPoly ) const;
+    BOOL                operator!=( const Polygon& rPoly ) const
+                            { return !(Polygon::operator==( rPoly )); }
+    sal_Bool            IsEqual( const Polygon& rPoly ) const;
+
+    // streaming a Polygon does ignore PolyFlags, so use the Write Or Read
+    // method to take care of PolyFlags
+    TOOLS_DLLPUBLIC friend SvStream&    operator>>( SvStream& rIStream, Polygon& rPoly );
+    TOOLS_DLLPUBLIC friend SvStream&    operator<<( SvStream& rOStream, const Polygon& rPoly );
+
+    void                Read( SvStream& rIStream );
+    void                Write( SvStream& rOStream ) const;
+
+    const Point*        GetConstPointAry() const;
+    const BYTE*         GetConstFlagAry() const;
+
+    // convert to ::basegfx::B2DPolygon and return
+    ::basegfx::B2DPolygon getB2DPolygon() const;
+
+    // constructor to convert from ::basegfx::B2DPolygon
+    Polygon(const ::basegfx::B2DPolygon& rPolygon);
+};
+
+// ---------------
+// - PolyPolygon -
+// ---------------
+
+class TOOLS_DLLPUBLIC PolyPolygon
+{
+private:
+
+    ImplPolyPolygon*    mpImplPolyPolygon;
+
+//#if 0 // _SOLAR__PRIVATE
+    TOOLS_DLLPRIVATE void *ImplCreateGPCPolygon() const;
+    TOOLS_DLLPRIVATE void  ImplDoOperation( const PolyPolygon& rPolyPoly, PolyPolygon& rResult, ULONG nOperation ) const;
+    TOOLS_DLLPRIVATE void *ImplCreateArtVpath() const;
+    TOOLS_DLLPRIVATE void  ImplSetFromArtVpath( void *pVpath );
+//#endif // __PRIVATE
+
+public:
+
+                        PolyPolygon( USHORT nInitSize = 16, USHORT nResize = 16 );
+                        PolyPolygon( const Polygon& rPoly );
+                        PolyPolygon( USHORT nPoly, const USHORT* pPointCountAry,
+                                     const Point* pPtAry );
+                        PolyPolygon( const PolyPolygon& rPolyPoly );
+                        ~PolyPolygon();
+
+    void                Insert( const Polygon& rPoly, USHORT nPos = POLYPOLY_APPEND );
+    void                Remove( USHORT nPos );
+    void                Replace( const Polygon& rPoly, USHORT nPos );
+    const Polygon&      GetObject( USHORT nPos ) const;
+
+    BOOL                IsRect() const;
+
+    void                Clear();
+
+    USHORT              Count() const;
+    Rectangle           GetBoundRect() const;
+    void                Clip( const Rectangle& rRect );
+    void                Optimize( ULONG nOptimizeFlags, const PolyOptimizeData* pData = NULL );
+
+    void                GetSimple( PolyPolygon& rResult ) const;
+    /** Adaptive subdivision of polygons with curves
+
+        This method adaptively subdivides bezier arcs within the
+        polygon to straight line segments and returns the resulting
+        polygon.
+
+        @param rResult
+        The resulting subdivided polygon
+
+        @param d
+        This parameter controls the amount of subdivision. The
+        original curve is guaranteed to not differ by more than this
+        amount per bezier segment from the subdivided
+        lines. Concretely, if the polygon is in device coordinates and
+        d equals 1.0, then the difference between the subdivided and
+        the original polygon is guaranteed to be smaller than one
+        pixel.
+     */
+    void                AdaptiveSubdivide( PolyPolygon& rResult, const double d = 1.0 ) const;
+
+    void                GetIntersection( const PolyPolygon& rPolyPoly, PolyPolygon& rResult ) const;
+    void                GetUnion( const PolyPolygon& rPolyPoly, PolyPolygon& rResult ) const;
+    void                GetDifference( const PolyPolygon& rPolyPoly, PolyPolygon& rResult ) const;
+    void                GetXOR( const PolyPolygon& rPolyPoly, PolyPolygon& rResult ) const;
+
+    void                Move( long nHorzMove, long nVertMove );
+    void                Translate( const Point& rTrans );
+    void                Scale( double fScaleX, double fScaleY );
+    void                Rotate( const Point& rCenter, double fSin, double fCos );
+    void                Rotate( const Point& rCenter, USHORT nAngle10 );
+    void                SlantX( long nYRef, double fSin, double fCos );
+    void                SlantY( long nXRef, double fSin, double fCos );
+    void                Distort( const Rectangle& rRefRect, const Polygon& rDistortedRect );
+
+    const Polygon&      operator[]( USHORT nPos ) const { return GetObject( nPos ); }
+    Polygon&            operator[]( USHORT nPos );
+
+    PolyPolygon&        operator=( const PolyPolygon& rPolyPoly );
+    BOOL                operator==( const PolyPolygon& rPolyPoly ) const;
+    BOOL                operator!=( const PolyPolygon& rPolyPoly ) const
+                            { return !(PolyPolygon::operator==( rPolyPoly )); }
+
+    sal_Bool            IsEqual( const PolyPolygon& rPolyPoly ) const;
+
+    TOOLS_DLLPUBLIC friend SvStream&    operator>>( SvStream& rIStream, PolyPolygon& rPolyPoly );
+    TOOLS_DLLPUBLIC friend SvStream&    operator<<( SvStream& rOStream, const PolyPolygon& rPolyPoly );
+
+    void                Read( SvStream& rIStream );
+    void                Write( SvStream& rOStream ) const;
+
+    // convert to ::basegfx::B2DPolyPolygon and return
+    ::basegfx::B2DPolyPolygon getB2DPolyPolygon() const;
+
+    // constructor to convert from ::basegfx::B2DPolyPolygon
+    PolyPolygon(const ::basegfx::B2DPolyPolygon& rPolyPolygon);
+};
+
+typedef std::vector< PolyPolygon > PolyPolyVector;
+
+#endif  // _SV_POLY_HXX