From d6941fb507705757e795219a9864462854437070 Mon Sep 17 00:00:00 2001 From: Armin Weiss Date: Tue, 15 Apr 2003 15:02:54 +0000 Subject: Extended the Polygon implementation Splitted the Polygon tooling into PolygonTools and own namespace Changed names of local include files for templates --- basegfx/source/inc/hommatrixtemplate.hxx | 665 +++++++++++++++++++++++++++++++ basegfx/source/inc/polygontemplate.hxx | 572 ++++++++++++++++++++++++++ 2 files changed, 1237 insertions(+) create mode 100644 basegfx/source/inc/hommatrixtemplate.hxx create mode 100644 basegfx/source/inc/polygontemplate.hxx (limited to 'basegfx/source/inc') diff --git a/basegfx/source/inc/hommatrixtemplate.hxx b/basegfx/source/inc/hommatrixtemplate.hxx new file mode 100644 index 000000000000..a431701e6da5 --- /dev/null +++ b/basegfx/source/inc/hommatrixtemplate.hxx @@ -0,0 +1,665 @@ +/************************************************************************* + * + * $RCSfile: hommatrixtemplate.hxx,v $ + * + * $Revision: 1.1 $ + * + * last change: $Author: aw $ $Date: 2003-04-15 16:02:53 $ + * + * 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 _HOMMATRIX_TEMPLATE_HXX +#define _HOMMATRIX_TEMPLATE_HXX + +#ifndef _SAL_TYPES_H_ +#include +#endif + +#include +#include + +inline double ImplGetDefaultValue(sal_uInt16 nRow, sal_uInt16 nColumn) +{ + if(nRow == nColumn) + return 1.0; + return 0.0; +} + +template < int _RowSize > class ImplMatLine +{ + enum { RowSize = _RowSize }; + + double mfValue[RowSize]; + +public: + ImplMatLine(sal_uInt16 nRow = 0L, ImplMatLine< RowSize >* pToBeCopied = 0L) + { + if(pToBeCopied) + { + memcpy(&mfValue, pToBeCopied, sizeof(double) * RowSize); + } + else + { + for(sal_uInt16 a(0); a < RowSize; a++) + { + mfValue[a] = ImplGetDefaultValue(nRow, a); + } + } + } + + double Get(sal_uInt16 nColumn) const + { + return mfValue[nColumn]; + } + + void Set(sal_uInt16 nColumn, const double& rValue) + { + mfValue[nColumn] = rValue; + } +}; + +template < int _RowSize > class ImplHomMatrixTemplate +{ + enum { RowSize = _RowSize }; + + sal_uInt32 mnRefCount; + + ImplMatLine< RowSize > maLine[RowSize - 1]; + ImplMatLine< RowSize >* mpLine; + +public: + // Is last line used? + sal_Bool IsLastLineDefault() const + { + if(!mpLine) + return sal_True; + + for(sal_uInt16 a(0); a < RowSize; a++) + { + if(ImplGetDefaultValue((RowSize - 1), a) != mpLine->Get(a)) + { + return sal_False; + } + } + + // reset last line, it equals default + delete ((ImplHomMatrixTemplate< RowSize >*)this)->mpLine; + ((ImplHomMatrixTemplate< RowSize >*)this)->mpLine = 0L; + + return sal_True; + } + + // This constructor is only used form the static identity matrix, thus + // the RefCount is set to 1 to never 'delete' this static incarnation. + ImplHomMatrixTemplate() + : mnRefCount(1), + mpLine(0L) + { + // complete initialization with identity matrix, all lines + // were initialized with a trailing 1 followed by 0's. + for(sal_uInt16 a(1); a < (RowSize - 1); a++) + { + maLine[a].Set(0, 0.0); + maLine[a].Set(a, 1.0); + } + } + + ImplHomMatrixTemplate(const ImplHomMatrixTemplate& rToBeCopied) + : mnRefCount(0), + mpLine(0L) + { + // complete initialization using copy + for(sal_uInt16 a(0); a < (RowSize - 1); a++) + { + memcpy(&maLine[a], &rToBeCopied.maLine[a], sizeof(ImplMatLine< RowSize >)); + } + + if(rToBeCopied.mpLine) + { + mpLine = new ImplMatLine< RowSize >((RowSize - 1), rToBeCopied.mpLine); + } + } + + ~ImplHomMatrixTemplate() + { + if(mpLine) + { + delete mpLine; + } + } + + const sal_uInt32 GetRefCount() const { return mnRefCount; } + void IncRefCount() { mnRefCount++; } + void DecRefCount() { mnRefCount--; } + + sal_uInt16 GetEdgeLength() const { return RowSize; } + + double Get(sal_uInt16 nRow, sal_uInt16 nColumn) const + { + if(nRow < (RowSize - 1)) + return maLine[nRow].Get(nColumn); + if(mpLine) + return mpLine->Get(nColumn); + return ImplGetDefaultValue((RowSize - 1), nColumn); + } + + void Set(sal_uInt16 nRow, sal_uInt16 nColumn, const double& rValue) + { + if(nRow < (RowSize - 1)) + { + maLine[nRow].Set(nColumn, rValue); + } + else if(mpLine) + { + mpLine->Set(nColumn, rValue); + } + else + { + if(ImplGetDefaultValue((RowSize - 1), nColumn) != rValue) + { + mpLine = new ImplMatLine< RowSize >((RowSize - 1), 0L); + mpLine->Set(nColumn, rValue); + } + } + } + + void TestLastLine() + { + if(mpLine) + { + sal_Bool bNecessary(sal_False); + + for(sal_uInt16 a(0);!bNecessary && a < RowSize; a++) + { + if(ImplGetDefaultValue((RowSize - 1), a) != mpLine->Get(a)) + { + bNecessary = sal_True; + } + } + + if(!bNecessary) + { + delete mpLine; + mpLine = 0L; + } + } + } + + // Left-upper decompositon + sal_Bool Ludcmp(sal_uInt16 nIndex[], sal_Int16& nParity) + { + double fBig, fSum, fDum; + double fStorage[RowSize]; + sal_uInt16 a, b, c, nAMax; + + nParity = 1; + + // Calc the max of each line. If a line is empty, + // stop immediately since matrix is not invertible then. + for(a = 0; a < RowSize; a++) + { + fBig = 0.0; + + for(b = 0; b < RowSize; b++) + { + double fTemp(fabs(Get(a, b))); + + if(fTemp > fBig) + fBig = fTemp; + } + + if(0.0 == fBig) + return sal_False; + + fStorage[a] = 1.0 / fBig; + } + + // start normalizing + for(b = 0; b < RowSize; b++) + { + for(a = 0; a < b; a++) + { + fSum = Get(a, b); + + for(c = 0; c < a; c++) + { + fSum -= Get(a, c) * Get(c, b); + } + + Set(a, b, fSum); + } + + fBig = 0.0; + + for(a = b; a < RowSize; a++) + { + fSum = Get(a, b); + + for(c = 0; c < b; c++) + { + fSum -= Get(a, c) * Get(c, b); + } + + Set(a, b, fSum); + fDum = fStorage[a] * fabs(fSum); + + if(fDum >= fBig) + { + fBig = fDum; + nAMax = a; + } + } + + if(b != nAMax) + { + for(c = 0; c < RowSize; c++) + { + fDum = Get(nAMax, c); + Set(nAMax, c, Get(b, c)); + Set(b, c, fDum); + } + + nParity = -nParity; + fStorage[nAMax] = fStorage[b]; + } + + nIndex[b] = nAMax; + + // here the failure of precision occurs + if(0.0 == fabs(Get(b, b))) + return sal_False; + + if(b != (RowSize - 1)) + { + fDum = 1.0 / Get(b, b); + + for(a = b + 1; a < RowSize; a++) + { + Set(a, b, Get(a, b) * fDum); + } + } + } + + return sal_True; + } + + void Lubksb(const sal_uInt16 nIndex[], double fRow[]) const + { + sal_uInt16 b, ip; + sal_Int16 a, a2 = -1; + double fSum; + + for(a = 0; a < RowSize; a++) + { + ip = nIndex[a]; + fSum = fRow[ip]; + fRow[ip] = fRow[a]; + + if(a2 >= 0) + { + for(b = a2; b < a; b++) + { + fSum -= Get(a, b) * fRow[b]; + } + } + else if(0.0 != fSum) + { + a2 = a; + } + + fRow[a] = fSum; + } + + for(a = (RowSize - 1); a >= 0; a--) + { + fSum = fRow[a]; + + for(b = a + 1; b < RowSize; b++) + { + fSum -= Get(a, b) * fRow[b]; + } + + if(0.0 != Get(a, a)) + { + fRow[a] = fSum / Get(a, a); + } + } + } + + sal_Bool IsIdentity() const + { + // last line needs no testing if not existing + const sal_uInt16 nMaxLine = (mpLine) ? RowSize : (RowSize - 1); + + for(sal_uInt16 a(0); a < nMaxLine; a++) + { + for(sal_uInt16 b(0); b < RowSize; b++) + { + if(Get(a, b) != ImplGetDefaultValue(a, b)) + return sal_False; + } + } + + return sal_True; + } + + sal_Bool IsInvertible() const + { + ImplHomMatrixTemplate aWork(*this); + sal_uInt16 nIndex[RowSize]; + sal_Int16 nParity; + + return aWork.Ludcmp(nIndex, nParity); + } + + sal_Bool IsNormalized() const + { + if(!mpLine) + return sal_True; + + const double fHomValue(Get((RowSize - 1), (RowSize - 1))); + + if(1.0 != fHomValue && 0.0 != fHomValue) + return sal_False; + + return sal_True; + } + + void DoInvert(const ImplHomMatrixTemplate& rWork, const sal_uInt16 nIndex[]) + { + double fArray[RowSize]; + + for(sal_uInt16 a(0); a < RowSize; a++) + { + // prepare line + for(sal_uInt16 b(0); b < RowSize; b++) + fArray[b] = ImplGetDefaultValue(a, b); + + // expand line + rWork.Lubksb(nIndex, fArray); + + // copy line transposed to this matrix + for(b = 0; b < RowSize; b++) + Set(b, a, fArray[b]); + } + + // evtl. get rid of last matrix line + TestLastLine(); + } + + void DoNormalize() + { + if(mpLine) + { + const double fHomValue(Get((RowSize - 1), (RowSize - 1))); + + for(sal_uInt16 a(0); a < RowSize; a++) + { + for(sal_uInt16 b(0); b < RowSize; b++) + { + Set(a, b, Get(a, b) / fHomValue); + } + } + + // evtl. get rid of last matrix line + TestLastLine(); + } + } + + double DoDeterminant() const + { + ImplHomMatrixTemplate aWork(*this); + sal_uInt16 nIndex[RowSize]; + sal_Int16 nParity; + double fRetval(0.0); + + if(aWork.Ludcmp(nIndex, nParity)) + { + fRetval = (double)nParity; + + // last line needs no multiply if not existing; default value would be 1. + const sal_uInt16 nMaxLine = (aWork.mpLine) ? RowSize : (RowSize - 1); + + for(sal_uInt16 a(0); a < nMaxLine; a++) + { + fRetval *= aWork.Get(a, a); + } + } + + return fRetval; + } + + double DoTrace() const + { + double fTrace = (mpLine) ? 0.0 : 1.0; + const sal_uInt16 nMaxLine = (mpLine) ? RowSize : (RowSize - 1); + + for(sal_uInt16 a(0); a < nMaxLine; a++) + { + fTrace += Get(a, a); + } + + return fTrace; + } + + void DoTranspose() + { + for(sal_uInt16 a(0); a < (RowSize - 1); a++) + { + for(sal_uInt16 b(a + 1); b < RowSize; b++) + { + const double fTemp(Get(a, b)); + Set(a, b, Get(b, a)); + Set(b, a, fTemp); + } + } + + TestLastLine(); + } + + void DoAddMatrix(const ImplHomMatrixTemplate& rMat) + { + for(sal_uInt16 a(0); a < RowSize; a++) + { + for(sal_uInt16 b(0); b < RowSize; b++) + { + Set(a, b, Get(a, b) + rMat.Get(a, b)); + } + } + + TestLastLine(); + } + + void DoSubMatrix(const ImplHomMatrixTemplate& rMat) + { + for(sal_uInt16 a(0); a < RowSize; a++) + { + for(sal_uInt16 b(0); b < RowSize; b++) + { + Set(a, b, Get(a, b) - rMat.Get(a, b)); + } + } + + TestLastLine(); + } + + void DoMulMatrix(const double& rfValue) + { + for(sal_uInt16 a(0); a < RowSize; a++) + { + for(sal_uInt16 b(0); b < RowSize; b++) + { + Set(a, b, Get(a, b) * rfValue); + } + } + + TestLastLine(); + } + + void DoMulMatrix(const ImplHomMatrixTemplate& rMat) + { + // create a copy as source for the original values + const ImplHomMatrixTemplate aCopy(*this); + + if(rMat.mpLine) + { + // complex first lines + for(sal_uInt16 a(0); a < (RowSize - 1); a++) + { + for(sal_uInt16 b(0); b < RowSize; b++) + { + double fValue(0.0); + + for(sal_uInt16 c(0); c < RowSize; c++) + { + fValue += aCopy.Get(c, b) * rMat.Get(a, c); + } + + Set(a, b, fValue); + } + } + + if(mpLine) + { + // complex last line + for(sal_uInt16 b(0); b < RowSize; b++) + { + double fValue(0.0); + + for(sal_uInt16 c(0); c < RowSize; c++) + { + fValue += aCopy.Get(c, b) * rMat.Get((RowSize - 1), c); + } + + Set((RowSize - 1), b, fValue); + } + + TestLastLine(); + } + else + { + // last line is rMat line, copy + mpLine = new ImplMatLine< RowSize >((RowSize - 1), rMat.mpLine); + } + } + else + { + // simplified first lines + for(sal_uInt16 a(0); a < (RowSize - 1); a++) + { + for(sal_uInt16 b(0); b < RowSize; b++) + { + double fValue(0.0); + + for(sal_uInt16 c(0); c < (RowSize - 1); c++) + { + fValue += aCopy.Get(c, b) * rMat.Get(a, c); + } + + if(b == (RowSize -1)) + { + fValue += aCopy.Get(a, (RowSize - 1)); + } + + Set(a, b, fValue); + } + } + + if(mpLine) + { + // simplified last line + for(sal_uInt16 b(0); b < RowSize; b++) + { + double fValue(0.0); + + for(sal_uInt16 c(0); c < (RowSize - 1); c++) + { + fValue += aCopy.Get(c, b) * rMat.Get((RowSize - 1), c); + } + + if(b == (RowSize -1)) + { + fValue += aCopy.Get((RowSize - 1), (RowSize - 1)); + } + + Set((RowSize - 1), b, fValue); + } + + TestLastLine(); + } + else + { + // no last line + } + } + } + + sal_Bool IsEqual(const ImplHomMatrixTemplate& rMat) + { + const sal_uInt16 nMaxLine = (mpLine || rMat.mpLine) ? RowSize : (RowSize - 1); + + for(sal_uInt16 a(0); a < nMaxLine; a++) + { + for(sal_uInt16 b(0); b < RowSize; b++) + { + if(Get(a, b) != rMat.Get(a, b)) + return sal_False; + } + } + + return sal_True; + } +}; + +#endif // _HOMMATRIX_TEMPLATE_HXX diff --git a/basegfx/source/inc/polygontemplate.hxx b/basegfx/source/inc/polygontemplate.hxx new file mode 100644 index 000000000000..d95dc4db90eb --- /dev/null +++ b/basegfx/source/inc/polygontemplate.hxx @@ -0,0 +1,572 @@ +/************************************************************************* + * + * $RCSfile: polygontemplate.hxx,v $ + * + * $Revision: 1.1 $ + * + * last change: $Author: aw $ $Date: 2003-04-15 16:02:54 $ + * + * 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 _POLYGON_TEMPLATE_HXX +#define _POLYGON_TEMPLATE_HXX + +#include + +////////////////////////////////////////////////////////////////////////////// + +template < class Point > class ImplSimplePointEntry +{ + Point maPoint; + +public: + ImplSimplePointEntry() + : maPoint(Point::GetEmptyPoint()) + { + } + + ImplSimplePointEntry(const Point& rInitPoint) + : maPoint(rInitPoint) + { + } + + const Point& GetPoint() const + { + return maPoint; + } + + void SetPoint(const Point& rValue) + { + maPoint = rValue; + } + + sal_Bool operator==(const ImplSimplePointEntry& rEntry) const + { + return (maPoint == rEntry.maPoint); + } +}; + +////////////////////////////////////////////////////////////////////////////// + +template < class Vector > class ImplSimpleBezierEntry +{ + Vector maBackward; + Vector maForward; + +public: + ImplSimpleBezierEntry() + : maBackward(Vector::GetEmptyVector()), + maForward(Vector::GetEmptyVector()) + { + } + + ImplSimpleBezierEntry(const Vector& rInitBackward, const Vector& rInitForward) + : maBackward(rInitBackward), + maForward(rInitForward) + { + } + + const Vector& GetBackwardVector() const + { + return maBackward; + } + + void SetBackwardVector(const Vector& rValue) + { + maBackward = rValue; + } + + const Vector& GetForwardVector() const + { + return maForward; + } + + void SetForwardVector(const Vector& rValue) + { + maForward = rValue; + } + + sal_Bool IsBezierNeeded() + { + if(maBackward != Vector::GetEmptyVector() || maForward != Vector::GetEmptyVector()) + return sal_True; + return sal_False; + } + + sal_Bool operator==(const ImplSimpleBezierEntry& rEntry) const + { + return ((maBackward == rEntry.maBackward) && (maForward == rEntry.maForward)); + } + + void DoInvertForFlip() + { + maBackward = -maBackward; + maForward = -maForward; + } +}; + +////////////////////////////////////////////////////////////////////////////// + +template < class Point, class Vector > class ImplPolygonTemplate +{ + typedef ImplSimplePointEntry< Point > LocalImplSimplePointEntry; + typedef ImplSimpleBezierEntry< Vector > LocalImplSimpleBezierEntry; + typedef ::std::vector< LocalImplSimplePointEntry > SimplePointVector; + typedef ::std::vector< LocalImplSimpleBezierEntry > SimpleBezierVector; + + sal_uInt32 mnBezierCount; + SimplePointVector maPoints; + SimpleBezierVector* mpVectors; + + unsigned mbIsClosed : 1; + + void ImplTryToReduceToPointVector() + { + if(!mnBezierCount && mpVectors) + { + delete mpVectors; + mpVectors = 0L; + } + } + +public: + sal_Bool IsBezier() const + { + return sal_Bool(mnBezierCount); + } + + sal_Bool IsClosed() const + { + return sal_Bool(mbIsClosed); + } + + void SetClosed(sal_Bool bNew) + { + mbIsClosed = bNew; + } + + sal_uInt32 Count() const + { + return maPoints.size(); + } + + ImplPolygonTemplate() + : mnBezierCount(0L), + mpVectors(0L), + mbIsClosed(sal_False) + { + // complete initialization with defaults + } + + ImplPolygonTemplate(const ImplPolygonTemplate& rSource) + : mnBezierCount(0L), + maPoints(rSource.maPoints), + mpVectors(0L), + mbIsClosed(rSource.mbIsClosed) + { + // complete initialization using copy + if(rSource.mpVectors && rSource.mnBezierCount) + { + mpVectors = new SimpleBezierVector(*rSource.mpVectors); + mnBezierCount = rSource.mnBezierCount; + } + } + + ImplPolygonTemplate(const ImplPolygonTemplate& rSource, sal_uInt32 nIndex, sal_uInt32 nCount) + : mnBezierCount(0L), + maPoints(nCount), + mpVectors(0L), + mbIsClosed(rSource.mbIsClosed) + { + // complete initialization using partly copy + if(nCount) + { + // copy point data + { + SimplePointVector::const_iterator aStart(rSource.maPoints.begin()); + aStart += nIndex; + SimplePointVector::const_iterator aEnd(aStart); + aEnd += nCount; + maPoints.insert(0L, aStart, aEnd); + } + + // copy bezier data + if(rSource.mpVectors && rSource.mnBezierCount) + { + mpVectors = new SimpleBezierVector(); + mpVectors->reserve(nCount); + + SimpleBezierVector::iterator aStart(mpVectors->begin()); + aStart += nIndex; + SimpleBezierVector::iterator aEnd(aStart); + aEnd += nCount; + + for( ; aStart != aEnd; ++aStart ) + { + if(aStart->IsBezierNeeded()) + { + mnBezierCount++; + } + + mpVectors->push_back(*aStart); + } + + // maybe vectors are not needed anymore, try to reduce memory footprint + ImplTryToReduceToPointVector(); + } + } + } + + ~ImplPolygonTemplate() + { + if(mpVectors) + { + delete mpVectors; + } + } + + sal_Bool IsEqual(const ImplPolygonTemplate& rPointList) const + { + // same point count? + if(maPoints.size() != rPointList.maPoints.size()) + return sal_False; + + // if zero points the polys are equal + if(!maPoints.size()) + return sal_True; + + // if bezier count used it needs to be equal + if(mnBezierCount != rPointList.mnBezierCount) + return sal_False; + + // compare point content + if(maPoints != rPointList.maPoints) + return sal_False; + + // beziercounts are equal: if it's zero, we are done + if(!mnBezierCount) + return sal_True; + + // beziercounts are equal and not zero; compare them + DBG_ASSERT(0L != mpVectors, "Error: Bezier list needs to exist here(!)"); + DBG_ASSERT(0L != rPointList.mpVectors, "Error: Bezier list needs to exist here(!)"); + + return (*mpVectors == *rPointList.mpVectors); + } + + const Point& GetPoint(sal_uInt32 nIndex) const + { + return maPoints[nIndex].GetPoint(); + } + + void SetPoint(sal_uInt32 nIndex, const Point& rValue) + { + maPoints[nIndex].SetPoint(rValue); + } + + const Vector& GetBackwardVector(sal_uInt32 nIndex) const + { + if(mpVectors) + return ((*mpVectors)[nIndex]).GetBackwardVector(); + else + return Vector::GetEmptyVector(); + } + + void SetBackwardVector(sal_uInt32 nIndex, const Vector& rValue) + { + if(mpVectors) + { + LocalImplSimpleBezierEntry& rDest = (*mpVectors)[nIndex]; + sal_Bool bBezierNeededBefore(rDest.IsBezierNeeded()); + ((*mpVectors)[nIndex]).SetBackwardVector(rValue); + sal_Bool bBezierNeededAfter(rDest.IsBezierNeeded()); + + if(bBezierNeededBefore != bBezierNeededAfter) + { + if(bBezierNeededAfter) + mnBezierCount++; + else + mnBezierCount--; + } + } + else + { + sal_Bool bEmptyVector(rValue == Vector::GetEmptyVector()); + + if(bEmptyVector) + return; + + mpVectors = new SimpleBezierVector(maPoints.size()); + ((*mpVectors)[nIndex]).SetBackwardVector(rValue); + mnBezierCount++; + } + } + + const Vector& GetForwardVector(sal_uInt32 nIndex) const + { + if(mpVectors) + return ((*mpVectors)[nIndex]).GetForwardVector(); + else + return Vector::GetEmptyVector(); + } + + void SetForwardVector(sal_uInt32 nIndex, const Vector& rValue) + { + if(mpVectors) + { + LocalImplSimpleBezierEntry& rDest = (*mpVectors)[nIndex]; + sal_Bool bBezierNeededBefore(rDest.IsBezierNeeded()); + ((*mpVectors)[nIndex]).SetForwardVector(rValue); + sal_Bool bBezierNeededAfter(rDest.IsBezierNeeded()); + + if(bBezierNeededBefore != bBezierNeededAfter) + { + if(bBezierNeededAfter) + mnBezierCount++; + else + mnBezierCount--; + } + } + else + { + sal_Bool bEmptyVector(rValue == Vector::GetEmptyVector()); + + if(bEmptyVector) + return; + + mpVectors = new SimpleBezierVector(maPoints.size()); + ((*mpVectors)[nIndex]).SetForwardVector(rValue); + mnBezierCount++; + } + } + + void Insert(sal_uInt32 nIndex, const Point& rPoint, sal_uInt32 nCount) + { + if(nCount) + { + // maybe vectors are not needed anymore, try to reduce memory footprint + ImplTryToReduceToPointVector(); + + // add nCount copies of rPoint + { + LocalImplSimplePointEntry aNode(rPoint); + SimplePointVector::iterator aIndex(maPoints.begin()); + aIndex += nIndex; + maPoints.insert(aIndex, nCount, aNode); + } + + // add nCount empty entries to keep indices synchronized + if(mpVectors) + { + LocalImplSimpleBezierEntry aNode; + SimpleBezierVector::iterator aIndex(mpVectors->begin()); + aIndex += nIndex; + mpVectors->insert(aIndex, nCount, aNode); + } + } + } + + void Insert(sal_uInt32 nIndex, const ImplPolygonTemplate& rSource) + { + const sal_uInt32 nCount(rSource.maPoints.size()); + + if(nCount) + { + // instert point data + { + SimplePointVector::iterator aIndex(maPoints.begin()); + aIndex += nIndex; + + SimplePointVector::const_iterator aStart(rSource.maPoints.begin()); + SimplePointVector::const_iterator aEnd(rSource.maPoints.end()); + + maPoints.insert(aIndex, aStart, aEnd); + } + + // insert bezier data + if(rSource.mpVectors && rSource.mnBezierCount) + { + SimpleBezierVector::iterator aIndex(mpVectors->begin()); + aIndex += nIndex; + + SimpleBezierVector::iterator aStart(rSource.mpVectors->begin()); + SimpleBezierVector::iterator aEnd(rSource.mpVectors->end()); + + if(!mpVectors) + { + mpVectors = new SimpleBezierVector(maPoints.size() - nCount); + } + + mpVectors->insert(aIndex, aStart, aEnd); + + mnBezierCount += rSource.mnBezierCount; + } + else + { + // maybe vectors are not needed anymore, try to reduce memory footprint + ImplTryToReduceToPointVector(); + + // add nCount empty entries to keep indices synchronized + if(mpVectors) + { + LocalImplSimpleBezierEntry aNode; + SimpleBezierVector::iterator aIndex(mpVectors->begin()); + aIndex += nIndex; + mpVectors->insert(aIndex, nCount, aNode); + } + } + } + } + + void Remove(sal_uInt32 nIndex, sal_uInt32 nCount) + { + if(nCount) + { + // maybe vectors are not needed anymore, try to reduce memory footprint + ImplTryToReduceToPointVector(); + + // remove point data + { + SimplePointVector::iterator aStart(maPoints.begin()); + aStart += nIndex; + const SimplePointVector::iterator aEnd(aStart + nCount); + + maPoints.erase(aStart, aEnd); + } + + // remove bezier data + if(mpVectors) + { + SimpleBezierVector::iterator aStart(mpVectors->begin()); + aStart += nIndex; + const SimpleBezierVector::iterator aEnd(aStart + nCount); + + // take care for correct mnBezierCount BEFORE erase + if(mnBezierCount) + { + SimpleBezierVector::iterator aTestIter(aStart); + + for( ; mnBezierCount && aTestIter != aEnd; ++aTestIter) + { + if(aTestIter->IsBezierNeeded()) + mnBezierCount--; + } + } + + if(mnBezierCount) + { + // erase nodes + mpVectors->erase(aStart, aEnd); + } + else + { + // try to reduce, maybe 0L == mnBezierCount + ImplTryToReduceToPointVector(); + } + } + } + } + + void Flip() + { + if(maPoints.size() > 1) + { + // maybe vectors are not needed anymore, try to reduce memory footprint + ImplTryToReduceToPointVector(); + + // calculate half size + const sal_uInt32 nHalfSize(maPoints.size() >> 1L); + + // flip point data + { + SimplePointVector::iterator aStart(maPoints.begin()); + SimplePointVector::iterator aEnd(maPoints.end()); + + for(sal_uInt32 a(0); a < nHalfSize; a++) + { + LocalImplSimplePointEntry aTemp = *aStart; + *aStart++ = *aEnd; + *aEnd-- = aTemp; + } + } + + // flip bezier data + if(mpVectors) + { + SimpleBezierVector::iterator aStart(mpVectors->begin()); + SimpleBezierVector::iterator aEnd(mpVectors->end()); + + for(sal_uInt32 a(0); a < nHalfSize; a++) + { + LocalImplSimpleBezierEntry aTemp = *aStart; + aTemp.DoInvertForFlip(); + *aStart = *aEnd; + aStart->DoInvertForFlip(); + aStart++; + *aEnd-- = aTemp; + } + + // also flip vectors of middle point (if existing) + if(maPoints.size() % 2) + { + (*mpVectors)[nHalfSize].DoInvertForFlip(); + } + } + } + } +}; + +////////////////////////////////////////////////////////////////////////////// + +#endif _POLYGON_TEMPLATE_HXX -- cgit v1.2.3