465 lines
12 KiB
C++
465 lines
12 KiB
C++
/*************************************************************************
|
|
*
|
|
* $RCSfile: b2dpolypolygon.cxx,v $
|
|
*
|
|
* $Revision: 1.10 $
|
|
*
|
|
* last change: $Author: aw $ $Date: 2004-02-12 17:33:43 $
|
|
*
|
|
* The Contents of this file are made available subject to the terms of
|
|
* either of the following licenses
|
|
*
|
|
* - GNU Lesser General Public License Version 2.1
|
|
* - Sun Industry Standards Source License Version 1.1
|
|
*
|
|
* Sun Microsystems Inc., October, 2000
|
|
*
|
|
* GNU Lesser General Public License Version 2.1
|
|
* =============================================
|
|
* Copyright 2000 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
|
|
*
|
|
*
|
|
* Sun Industry Standards Source License Version 1.1
|
|
* =================================================
|
|
* The contents of this file are subject to the Sun Industry Standards
|
|
* Source License Version 1.1 (the "License"); You may not use this file
|
|
* except in compliance with the License. You may obtain a copy of the
|
|
* License at http://www.openoffice.org/license.html.
|
|
*
|
|
* Software provided under this License is provided on an "AS IS" basis,
|
|
* WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING,
|
|
* WITHOUT LIMITATION, WARRANTIES THAT THE SOFTWARE IS FREE OF DEFECTS,
|
|
* MERCHANTABLE, FIT FOR A PARTICULAR PURPOSE, OR NON-INFRINGING.
|
|
* See the License for the specific provisions governing your rights and
|
|
* obligations concerning the Software.
|
|
*
|
|
* The Initial Developer of the Original Code is: Sun Microsystems, Inc.
|
|
*
|
|
* Copyright: 2000 by Sun Microsystems, Inc.
|
|
*
|
|
* All Rights Reserved.
|
|
*
|
|
* Contributor(s): _______________________________________
|
|
*
|
|
*
|
|
************************************************************************/
|
|
|
|
#ifndef _BGFX_POLYGON_B2DPOLYPOLYGON_HXX
|
|
#include <basegfx/polygon/b2dpolypolygon.hxx>
|
|
#endif
|
|
|
|
#ifndef _OSL_DIAGNOSE_H_
|
|
#include <osl/diagnose.h>
|
|
#endif
|
|
|
|
#ifndef _BGFX_POLYGON_B2DPOLYGON_HXX
|
|
#include <basegfx/polygon/b2dpolygon.hxx>
|
|
#endif
|
|
|
|
#ifndef _BGFX_POLYPOLYGON_B2DPOLYGONTOOLS_HXX
|
|
#include <basegfx/polygon/b2dpolypolygontools.hxx>
|
|
#endif
|
|
|
|
#include <vector>
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
class ImplB2DPolyPolygon
|
|
{
|
|
typedef ::std::vector< ::basegfx::B2DPolygon > PolygonVector;
|
|
|
|
PolygonVector maPolygons;
|
|
sal_uInt32 mnRefCount;
|
|
|
|
public:
|
|
// This constructor is only used from the static identity polygon, thus
|
|
// the RefCount is set to 1 to never 'delete' this static incarnation.
|
|
ImplB2DPolyPolygon()
|
|
: mnRefCount(1)
|
|
{
|
|
// complete initialization with defaults
|
|
}
|
|
|
|
ImplB2DPolyPolygon(const ImplB2DPolyPolygon& rToBeCopied)
|
|
: mnRefCount(0)
|
|
{
|
|
// complete initialization using copy
|
|
maPolygons = rToBeCopied.maPolygons;
|
|
}
|
|
|
|
~ImplB2DPolyPolygon()
|
|
{
|
|
}
|
|
|
|
const sal_uInt32 getRefCount() const { return mnRefCount; }
|
|
void incRefCount() { mnRefCount++; }
|
|
void decRefCount() { mnRefCount--; }
|
|
|
|
bool isEqual(const ImplB2DPolyPolygon& rPolygonList) const
|
|
{
|
|
// same polygon count?
|
|
if(maPolygons.size() != rPolygonList.maPolygons.size())
|
|
return false;
|
|
|
|
// if zero polygons the polys are equal
|
|
if(!maPolygons.size())
|
|
return true;
|
|
|
|
// compare polygon content
|
|
if(maPolygons != rPolygonList.maPolygons)
|
|
return false;
|
|
|
|
return true;
|
|
}
|
|
|
|
const ::basegfx::B2DPolygon& getB2DPolygon(sal_uInt32 nIndex) const
|
|
{
|
|
return maPolygons[nIndex];
|
|
}
|
|
|
|
void setB2DPolygon(sal_uInt32 nIndex, const ::basegfx::B2DPolygon& rPolygon)
|
|
{
|
|
maPolygons[nIndex] = rPolygon;
|
|
}
|
|
|
|
void insert(sal_uInt32 nIndex, const ::basegfx::B2DPolygon& rPolygon, sal_uInt32 nCount)
|
|
{
|
|
if(nCount)
|
|
{
|
|
// add nCount copies of rPolygon
|
|
PolygonVector::iterator aIndex(maPolygons.begin());
|
|
aIndex += nIndex;
|
|
maPolygons.insert(aIndex, nCount, rPolygon);
|
|
}
|
|
}
|
|
|
|
void insert(sal_uInt32 nIndex, const ::basegfx::B2DPolyPolygon& rPolyPolygon)
|
|
{
|
|
const sal_uInt32 nCount = rPolyPolygon.count();
|
|
|
|
if(nCount)
|
|
{
|
|
// add nCount polygons from rPolyPolygon
|
|
maPolygons.reserve(maPolygons.size() + nCount);
|
|
PolygonVector::iterator aIndex(maPolygons.begin());
|
|
aIndex += nIndex;
|
|
|
|
for(sal_uInt32 a(0L); a < nCount; a++)
|
|
{
|
|
maPolygons.insert(aIndex, rPolyPolygon.getB2DPolygon(a));
|
|
aIndex++;
|
|
}
|
|
}
|
|
}
|
|
|
|
void remove(sal_uInt32 nIndex, sal_uInt32 nCount)
|
|
{
|
|
if(nCount)
|
|
{
|
|
// remove polygon data
|
|
PolygonVector::iterator aStart(maPolygons.begin());
|
|
aStart += nIndex;
|
|
const PolygonVector::iterator aEnd(aStart + nCount);
|
|
|
|
maPolygons.erase(aStart, aEnd);
|
|
}
|
|
}
|
|
|
|
sal_uInt32 count() const
|
|
{
|
|
return maPolygons.size();
|
|
}
|
|
|
|
void setClosed(bool bNew)
|
|
{
|
|
for(sal_uInt32 a(0L); a < maPolygons.size(); a++)
|
|
{
|
|
maPolygons[a].setClosed(bNew);
|
|
}
|
|
}
|
|
|
|
void flip()
|
|
{
|
|
for(sal_uInt32 a(0L); a < maPolygons.size(); a++)
|
|
{
|
|
maPolygons[a].flip();
|
|
}
|
|
}
|
|
|
|
void removeDoublePoints()
|
|
{
|
|
for(sal_uInt32 a(0L); a < maPolygons.size(); a++)
|
|
{
|
|
maPolygons[a].removeDoublePoints();
|
|
}
|
|
}
|
|
|
|
void transform(const ::basegfx::B2DHomMatrix& rMatrix)
|
|
{
|
|
for(sal_uInt32 a(0L); a < maPolygons.size(); a++)
|
|
{
|
|
maPolygons[a].transform(rMatrix);
|
|
}
|
|
}
|
|
};
|
|
|
|
//////////////////////////////////////////////////////////////////////////////
|
|
|
|
namespace basegfx
|
|
{
|
|
// init static default Polygon
|
|
static ImplB2DPolyPolygon maStaticDefaultPolyPolygon;
|
|
|
|
void B2DPolyPolygon::implForceUniqueCopy()
|
|
{
|
|
if(mpPolyPolygon->getRefCount())
|
|
{
|
|
mpPolyPolygon->decRefCount();
|
|
mpPolyPolygon = new ImplB2DPolyPolygon(*mpPolyPolygon);
|
|
}
|
|
}
|
|
|
|
B2DPolyPolygon::B2DPolyPolygon()
|
|
: mpPolyPolygon(&maStaticDefaultPolyPolygon)
|
|
{
|
|
mpPolyPolygon->incRefCount();
|
|
}
|
|
|
|
B2DPolyPolygon::B2DPolyPolygon(const B2DPolyPolygon& rPolyPolygon)
|
|
: mpPolyPolygon(rPolyPolygon.mpPolyPolygon)
|
|
{
|
|
mpPolyPolygon->incRefCount();
|
|
}
|
|
|
|
B2DPolyPolygon::~B2DPolyPolygon()
|
|
{
|
|
if(mpPolyPolygon->getRefCount())
|
|
{
|
|
mpPolyPolygon->decRefCount();
|
|
}
|
|
else
|
|
{
|
|
delete mpPolyPolygon;
|
|
}
|
|
}
|
|
|
|
B2DPolyPolygon& B2DPolyPolygon::operator=(const B2DPolyPolygon& rPolyPolygon)
|
|
{
|
|
if(mpPolyPolygon->getRefCount())
|
|
{
|
|
mpPolyPolygon->decRefCount();
|
|
}
|
|
else
|
|
{
|
|
delete mpPolyPolygon;
|
|
}
|
|
|
|
mpPolyPolygon = rPolyPolygon.mpPolyPolygon;
|
|
mpPolyPolygon->incRefCount();
|
|
|
|
return *this;
|
|
}
|
|
|
|
bool B2DPolyPolygon::operator==(const B2DPolyPolygon& rPolyPolygon) const
|
|
{
|
|
if(mpPolyPolygon == rPolyPolygon.mpPolyPolygon)
|
|
{
|
|
return true;
|
|
}
|
|
|
|
return mpPolyPolygon->isEqual(*(rPolyPolygon.mpPolyPolygon));
|
|
}
|
|
|
|
bool B2DPolyPolygon::operator!=(const B2DPolyPolygon& rPolyPolygon) const
|
|
{
|
|
if(mpPolyPolygon == rPolyPolygon.mpPolyPolygon)
|
|
{
|
|
return false;
|
|
}
|
|
|
|
return !mpPolyPolygon->isEqual(*(rPolyPolygon.mpPolyPolygon));
|
|
}
|
|
|
|
sal_uInt32 B2DPolyPolygon::count() const
|
|
{
|
|
return mpPolyPolygon->count();
|
|
}
|
|
|
|
B2DPolygon B2DPolyPolygon::getB2DPolygon(sal_uInt32 nIndex) const
|
|
{
|
|
OSL_ENSURE(nIndex < mpPolyPolygon->count(), "B2DPolyPolygon access outside range (!)");
|
|
|
|
return mpPolyPolygon->getB2DPolygon(nIndex);
|
|
}
|
|
|
|
void B2DPolyPolygon::setB2DPolygon(sal_uInt32 nIndex, const B2DPolygon& rPolygon)
|
|
{
|
|
OSL_ENSURE(nIndex < mpPolyPolygon->count(), "B2DPolyPolygon access outside range (!)");
|
|
|
|
if(mpPolyPolygon->getB2DPolygon(nIndex) != rPolygon)
|
|
{
|
|
implForceUniqueCopy();
|
|
mpPolyPolygon->setB2DPolygon(nIndex, rPolygon);
|
|
}
|
|
}
|
|
|
|
bool B2DPolyPolygon::areControlVectorsUsed() const
|
|
{
|
|
for(sal_uInt32 a(0L); a < mpPolyPolygon->count(); a++)
|
|
{
|
|
const ::basegfx::B2DPolygon& rPolygon = mpPolyPolygon->getB2DPolygon(a);
|
|
|
|
if(rPolygon.areControlVectorsUsed())
|
|
{
|
|
return true;
|
|
}
|
|
}
|
|
|
|
return false;
|
|
}
|
|
|
|
void B2DPolyPolygon::insert(sal_uInt32 nIndex, const B2DPolygon& rPolygon, sal_uInt32 nCount)
|
|
{
|
|
OSL_ENSURE(nIndex <= mpPolyPolygon->count(), "B2DPolyPolygon Insert outside range (!)");
|
|
|
|
if(nCount)
|
|
{
|
|
implForceUniqueCopy();
|
|
mpPolyPolygon->insert(nIndex, rPolygon, nCount);
|
|
}
|
|
}
|
|
|
|
void B2DPolyPolygon::append(const B2DPolygon& rPolygon, sal_uInt32 nCount)
|
|
{
|
|
if(nCount)
|
|
{
|
|
implForceUniqueCopy();
|
|
mpPolyPolygon->insert(mpPolyPolygon->count(), rPolygon, nCount);
|
|
}
|
|
}
|
|
|
|
void B2DPolyPolygon::insert(sal_uInt32 nIndex, const B2DPolyPolygon& rPolyPolygon)
|
|
{
|
|
OSL_ENSURE(nIndex <= mpPolyPolygon->count(), "B2DPolyPolygon Insert outside range (!)");
|
|
|
|
if(rPolyPolygon.count())
|
|
{
|
|
implForceUniqueCopy();
|
|
mpPolyPolygon->insert(nIndex, rPolyPolygon);
|
|
}
|
|
}
|
|
|
|
void B2DPolyPolygon::append(const B2DPolyPolygon& rPolyPolygon)
|
|
{
|
|
if(rPolyPolygon.count())
|
|
{
|
|
implForceUniqueCopy();
|
|
mpPolyPolygon->insert(mpPolyPolygon->count(), rPolyPolygon);
|
|
}
|
|
}
|
|
|
|
void B2DPolyPolygon::remove(sal_uInt32 nIndex, sal_uInt32 nCount)
|
|
{
|
|
OSL_ENSURE(nIndex + nCount <= mpPolyPolygon->count(), "B2DPolyPolygon Remove outside range (!)");
|
|
|
|
if(nCount)
|
|
{
|
|
implForceUniqueCopy();
|
|
mpPolyPolygon->remove(nIndex, nCount);
|
|
}
|
|
}
|
|
|
|
void B2DPolyPolygon::clear()
|
|
{
|
|
if(mpPolyPolygon->getRefCount())
|
|
{
|
|
mpPolyPolygon->decRefCount();
|
|
}
|
|
else
|
|
{
|
|
delete mpPolyPolygon;
|
|
}
|
|
|
|
mpPolyPolygon = &maStaticDefaultPolyPolygon;
|
|
mpPolyPolygon->incRefCount();
|
|
}
|
|
|
|
bool B2DPolyPolygon::isClosed() const
|
|
{
|
|
bool bRetval(true);
|
|
|
|
// PolyPOlygon is closed when all contained Polygons are closed or
|
|
// no Polygon exists.
|
|
for(sal_uInt32 a(0L); bRetval && a < mpPolyPolygon->count(); a++)
|
|
{
|
|
if(!(mpPolyPolygon->getB2DPolygon(a)).isClosed())
|
|
{
|
|
bRetval = false;
|
|
}
|
|
}
|
|
|
|
return bRetval;
|
|
}
|
|
|
|
void B2DPolyPolygon::setClosed(bool bNew)
|
|
{
|
|
if(bNew != isClosed())
|
|
{
|
|
implForceUniqueCopy();
|
|
mpPolyPolygon->setClosed(bNew);
|
|
}
|
|
}
|
|
|
|
void B2DPolyPolygon::flip()
|
|
{
|
|
implForceUniqueCopy();
|
|
mpPolyPolygon->flip();
|
|
}
|
|
|
|
bool B2DPolyPolygon::hasDoublePoints() const
|
|
{
|
|
bool bRetval(false);
|
|
|
|
for(sal_uInt32 a(0L); !bRetval && a < mpPolyPolygon->count(); a++)
|
|
{
|
|
if((mpPolyPolygon->getB2DPolygon(a)).hasDoublePoints())
|
|
{
|
|
bRetval = true;
|
|
}
|
|
}
|
|
|
|
return bRetval;
|
|
}
|
|
|
|
void B2DPolyPolygon::removeDoublePoints()
|
|
{
|
|
if(hasDoublePoints())
|
|
{
|
|
implForceUniqueCopy();
|
|
mpPolyPolygon->removeDoublePoints();
|
|
}
|
|
}
|
|
|
|
void B2DPolyPolygon::transform(const ::basegfx::B2DHomMatrix& rMatrix)
|
|
{
|
|
implForceUniqueCopy();
|
|
mpPolyPolygon->transform(rMatrix);
|
|
}
|
|
} // end of namespace basegfx
|
|
|
|
// eof
|