mir/libreoffice
2
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
Files
07d85c44998f42545175ee77c192b901b52a30ca
libreoffice/svx/source/svdraw/svdoedge.cxx
Stephan Bergmann bc2becdf1a loplugin:cstylecast: deal with remaining pointer casts 
Change-Id: I94b2fbbb00e9772b668128f31cf08115bdfb16b5
2015-06-08 16:28:40 +02:00

2605 lines
95 KiB
C++
Raw Blame History

/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
/*
* This file is part of the LibreOffice project.
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
*
* This file incorporates work covered by the following license notice:
*
* Licensed to the Apache Software Foundation (ASF) under one or more
* contributor license agreements. See the NOTICE file distributed
* with this work for additional information regarding copyright
* ownership. The ASF licenses this file to you under the Apache
* License, Version 2.0 (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.apache.org/licenses/LICENSE-2.0 .
*/
#include "svddrgm1.hxx"
#include "svdglob.hxx"
#include "svx/svdstr.hrc"
#include <basegfx/matrix/b2dhommatrix.hxx>
#include <basegfx/polygon/b2dpolygon.hxx>
#include <basegfx/polygon/b2dpolygontools.hxx>
#include <editeng/eeitem.hxx>
#include <svl/smplhint.hxx>
#include <svl/style.hxx>
#include <sdr/contact/viewcontactofsdredgeobj.hxx>
#include <sdr/properties/connectorproperties.hxx>
#include <svx/sdrhittesthelper.hxx>
#include <svx/svddrag.hxx>
#include <svx/svddrgv.hxx>
#include <svx/svdetc.hxx>
#include <svx/svdhdl.hxx>
#include <svx/svdmodel.hxx>
#include <svx/svdoedge.hxx>
#include <svx/svdpage.hxx>
#include <svx/svdpagv.hxx>
#include <svx/svdpool.hxx>
#include <svx/svdtrans.hxx>
#include <svx/svdview.hxx>
#include <svx/sxekitm.hxx>
#include <svx/sxelditm.hxx>
#include <svx/sxenditm.hxx>
#include <svx/xpoly.hxx>
#include <svx/xpool.hxx>
SdrObjConnection::~SdrObjConnection()
{
}
void SdrObjConnection::ResetVars()
{
pObj=NULL;
nConId=0;
nXDist=0;
nYDist=0;
bBestConn=true;
bBestVertex=true;
bXDistOvr=false;
bYDistOvr=false;
bAutoVertex=false;
bAutoCorner=false;
}
bool SdrObjConnection::TakeGluePoint(SdrGluePoint& rGP, bool bSetAbsPos) const
{
bool bRet = false;
if (pObj!=NULL) { // one object has to be docked already!
if (bAutoVertex) {
rGP=pObj->GetVertexGluePoint(nConId);
bRet = true;
} else if (bAutoCorner) {
rGP=pObj->GetCornerGluePoint(nConId);
bRet = true;
} else {
const SdrGluePointList* pGPL=pObj->GetGluePointList();
if (pGPL!=NULL) {
sal_uInt16 nNum=pGPL->FindGluePoint(nConId);
if (nNum!=SDRGLUEPOINT_NOTFOUND) {
rGP=(*pGPL)[nNum];
bRet = true;
}
}
}
}
if (bRet && bSetAbsPos) {
Point aPt(rGP.GetAbsolutePos(*pObj));
aPt+=aObjOfs;
rGP.SetPos(aPt);
}
return bRet;
}
Point& SdrEdgeInfoRec::ImpGetLineVersatzPoint(SdrEdgeLineCode eLineCode)
{
switch (eLineCode) {
case OBJ1LINE2 : return aObj1Line2;
case OBJ1LINE3 : return aObj1Line3;
case OBJ2LINE2 : return aObj2Line2;
case OBJ2LINE3 : return aObj2Line3;
case MIDDLELINE: return aMiddleLine;
} // switch
return aMiddleLine;
}
sal_uInt16 SdrEdgeInfoRec::ImpGetPolyIdx(SdrEdgeLineCode eLineCode, const XPolygon& rXP) const
{
switch (eLineCode) {
case OBJ1LINE2 : return 1;
case OBJ1LINE3 : return 2;
case OBJ2LINE2 : return rXP.GetPointCount()-3;
case OBJ2LINE3 : return rXP.GetPointCount()-4;
case MIDDLELINE: return nMiddleLine;
} // switch
return 0;
}
bool SdrEdgeInfoRec::ImpIsHorzLine(SdrEdgeLineCode eLineCode, const XPolygon& rXP) const
{
sal_uInt16 nIdx=ImpGetPolyIdx(eLineCode,rXP);
bool bHorz=nAngle1==0 || nAngle1==18000;
if (eLineCode==OBJ2LINE2 || eLineCode==OBJ2LINE3) {
nIdx=rXP.GetPointCount()-nIdx;
bHorz=nAngle2==0 || nAngle2==18000;
}
if ((nIdx & 1)==1) bHorz=!bHorz;
return bHorz;
}
void SdrEdgeInfoRec::ImpSetLineVersatz(SdrEdgeLineCode eLineCode, const XPolygon& rXP, long nVal)
{
Point& rPt=ImpGetLineVersatzPoint(eLineCode);
if (ImpIsHorzLine(eLineCode,rXP)) rPt.Y()=nVal;
else rPt.X()=nVal;
}
long SdrEdgeInfoRec::ImpGetLineVersatz(SdrEdgeLineCode eLineCode, const XPolygon& rXP) const
{
const Point& rPt=ImpGetLineVersatzPoint(eLineCode);
if (ImpIsHorzLine(eLineCode,rXP)) return rPt.Y();
else return rPt.X();
}
// BaseProperties section
sdr::properties::BaseProperties* SdrEdgeObj::CreateObjectSpecificProperties()
{
return new sdr::properties::ConnectorProperties(*this);
}
// DrawContact section
sdr::contact::ViewContact* SdrEdgeObj::CreateObjectSpecificViewContact()
{
return new sdr::contact::ViewContactOfSdrEdgeObj(*this);
}
TYPEINIT1(SdrEdgeObj,SdrTextObj);
SdrEdgeObj::SdrEdgeObj()
: SdrTextObj(),
nNotifyingCount(0),
bEdgeTrackDirty(false),
bEdgeTrackUserDefined(false),
// Default is to allow default connects
mbSuppressDefaultConnect(false),
mbBoundRectCalculationRunning(false),
mbSuppressed(false)
{
bClosedObj=false;
bIsEdge=true;
pEdgeTrack=new XPolygon;
}
SdrEdgeObj::~SdrEdgeObj()
{
DisconnectFromNode(true);
DisconnectFromNode(false);
delete pEdgeTrack;
}
void SdrEdgeObj::ImpSetAttrToEdgeInfo()
{
const SfxItemSet& rSet = GetObjectItemSet();
SdrEdgeKind eKind = static_cast<const SdrEdgeKindItem&>(rSet.Get(SDRATTR_EDGEKIND)).GetValue();
sal_Int32 nVal1 = static_cast<const SdrMetricItem&>(rSet.Get(SDRATTR_EDGELINE1DELTA)).GetValue();
sal_Int32 nVal2 = static_cast<const SdrMetricItem&>(rSet.Get(SDRATTR_EDGELINE2DELTA)).GetValue();
sal_Int32 nVal3 = static_cast<const SdrMetricItem&>(rSet.Get(SDRATTR_EDGELINE3DELTA)).GetValue();
if(eKind == SDREDGE_ORTHOLINES || eKind == SDREDGE_BEZIER)
{
sal_Int32 nVals[3] = { nVal1, nVal2, nVal3 };
sal_uInt16 n = 0;
if(aEdgeInfo.nObj1Lines >= 2 && n < 3)
{
aEdgeInfo.ImpSetLineVersatz(OBJ1LINE2, *pEdgeTrack, nVals[n]);
n++;
}
if(aEdgeInfo.nObj1Lines >= 3 && n < 3)
{
aEdgeInfo.ImpSetLineVersatz(OBJ1LINE3, *pEdgeTrack, nVals[n]);
n++;
}
if(aEdgeInfo.nMiddleLine != 0xFFFF && n < 3)
{
aEdgeInfo.ImpSetLineVersatz(MIDDLELINE, *pEdgeTrack, nVals[n]);
n++;
}
if(aEdgeInfo.nObj2Lines >= 3 && n < 3)
{
aEdgeInfo.ImpSetLineVersatz(OBJ2LINE3, *pEdgeTrack, nVals[n]);
n++;
}
if(aEdgeInfo.nObj2Lines >= 2 && n < 3)
{
aEdgeInfo.ImpSetLineVersatz(OBJ2LINE2, *pEdgeTrack, nVals[n]);
n++;
}
}
else if(eKind == SDREDGE_THREELINES)
{
bool bHor1 = aEdgeInfo.nAngle1 == 0 || aEdgeInfo.nAngle1 == 18000;
bool bHor2 = aEdgeInfo.nAngle2 == 0 || aEdgeInfo.nAngle2 == 18000;
if(bHor1)
{
aEdgeInfo.aObj1Line2.X() = nVal1;
}
else
{
aEdgeInfo.aObj1Line2.Y() = nVal1;
}
if(bHor2)
{
aEdgeInfo.aObj2Line2.X() = nVal2;
}
else
{
aEdgeInfo.aObj2Line2.Y() = nVal2;
}
}
ImpDirtyEdgeTrack();
}
void SdrEdgeObj::ImpSetEdgeInfoToAttr()
{
const SfxItemSet& rSet = GetObjectItemSet();
SdrEdgeKind eKind = static_cast<const SdrEdgeKindItem&>(rSet.Get(SDRATTR_EDGEKIND)).GetValue();
sal_Int32 nValAnz = static_cast<const SdrEdgeLineDeltaAnzItem&>(rSet.Get(SDRATTR_EDGELINEDELTAANZ)).GetValue();
sal_Int32 nVal1 = static_cast<const SdrMetricItem&>(rSet.Get(SDRATTR_EDGELINE1DELTA)).GetValue();
sal_Int32 nVal2 = static_cast<const SdrMetricItem&>(rSet.Get(SDRATTR_EDGELINE2DELTA)).GetValue();
sal_Int32 nVal3 = static_cast<const SdrMetricItem&>(rSet.Get(SDRATTR_EDGELINE3DELTA)).GetValue();
sal_Int32 nVals[3] = { nVal1, nVal2, nVal3 };
sal_uInt16 n = 0;
if(eKind == SDREDGE_ORTHOLINES || eKind == SDREDGE_BEZIER)
{
if(aEdgeInfo.nObj1Lines >= 2 && n < 3)
{
nVals[n] = aEdgeInfo.ImpGetLineVersatz(OBJ1LINE2, *pEdgeTrack);
n++;
}
if(aEdgeInfo.nObj1Lines >= 3 && n < 3)
{
nVals[n] = aEdgeInfo.ImpGetLineVersatz(OBJ1LINE3, *pEdgeTrack);
n++;
}
if(aEdgeInfo.nMiddleLine != 0xFFFF && n < 3)
{
nVals[n] = aEdgeInfo.ImpGetLineVersatz(MIDDLELINE, *pEdgeTrack);
n++;
}
if(aEdgeInfo.nObj2Lines >= 3 && n < 3)
{
nVals[n] = aEdgeInfo.ImpGetLineVersatz(OBJ2LINE3, *pEdgeTrack);
n++;
}
if(aEdgeInfo.nObj2Lines >= 2 && n < 3)
{
nVals[n] = aEdgeInfo.ImpGetLineVersatz(OBJ2LINE2, *pEdgeTrack);
n++;
}
}
else if(eKind == SDREDGE_THREELINES)
{
bool bHor1 = aEdgeInfo.nAngle1 == 0 || aEdgeInfo.nAngle1 == 18000;
bool bHor2 = aEdgeInfo.nAngle2 == 0 || aEdgeInfo.nAngle2 == 18000;
n = 2;
nVals[0] = bHor1 ? aEdgeInfo.aObj1Line2.X() : aEdgeInfo.aObj1Line2.Y();
nVals[1] = bHor2 ? aEdgeInfo.aObj2Line2.X() : aEdgeInfo.aObj2Line2.Y();
}
if(n != nValAnz || nVals[0] != nVal1 || nVals[1] != nVal2 || nVals[2] != nVal3)
{
// Here no more notifying is necessary, just local changes are OK.
if(n != nValAnz)
{
GetProperties().SetObjectItemDirect(SdrEdgeLineDeltaAnzItem(n));
}
if(nVals[0] != nVal1)
{
GetProperties().SetObjectItemDirect(makeSdrEdgeLine1DeltaItem(nVals[0]));
}
if(nVals[1] != nVal2)
{
GetProperties().SetObjectItemDirect(makeSdrEdgeLine2DeltaItem(nVals[1]));
}
if(nVals[2] != nVal3)
{
GetProperties().SetObjectItemDirect(makeSdrEdgeLine3DeltaItem(nVals[2]));
}
if(n < 3)
{
GetProperties().ClearObjectItemDirect(SDRATTR_EDGELINE3DELTA);
}
if(n < 2)
{
GetProperties().ClearObjectItemDirect(SDRATTR_EDGELINE2DELTA);
}
if(n < 1)
{
GetProperties().ClearObjectItemDirect(SDRATTR_EDGELINE1DELTA);
}
}
}
void SdrEdgeObj::TakeObjInfo(SdrObjTransformInfoRec& rInfo) const
{
// #i54102# allow rotation, mirror and shear
rInfo.bRotateFreeAllowed = true;
rInfo.bRotate90Allowed = true;
rInfo.bMirrorFreeAllowed = true;
rInfo.bMirror45Allowed = true;
rInfo.bMirror90Allowed = true;
rInfo.bTransparenceAllowed = false;
rInfo.bGradientAllowed = false;
rInfo.bShearAllowed = true;
rInfo.bEdgeRadiusAllowed = false;
bool bCanConv=!HasText() || ImpCanConvTextToCurve();
rInfo.bCanConvToPath=bCanConv;
rInfo.bCanConvToPoly=bCanConv;
rInfo.bCanConvToContour = (rInfo.bCanConvToPoly || LineGeometryUsageIsNecessary());
}
sal_uInt16 SdrEdgeObj::GetObjIdentifier() const
{
return sal_uInt16(OBJ_EDGE);
}
const Rectangle& SdrEdgeObj::GetCurrentBoundRect() const
{
if(bEdgeTrackDirty)
{
const_cast<SdrEdgeObj*>(this)->ImpRecalcEdgeTrack();
}
return SdrTextObj::GetCurrentBoundRect();
}
const Rectangle& SdrEdgeObj::GetSnapRect() const
{
if(bEdgeTrackDirty)
{
const_cast<SdrEdgeObj*>(this)->ImpRecalcEdgeTrack();
}
return SdrTextObj::GetSnapRect();
}
void SdrEdgeObj::RecalcSnapRect()
{
maSnapRect=pEdgeTrack->GetBoundRect();
}
void SdrEdgeObj::TakeUnrotatedSnapRect(Rectangle& rRect) const
{
rRect=GetSnapRect();
}
bool SdrEdgeObj::IsNode() const
{
return true;
}
SdrGluePoint SdrEdgeObj::GetVertexGluePoint(sal_uInt16 nNum) const
{
Point aPt;
sal_uInt16 nPointCount=pEdgeTrack->GetPointCount();
if (nPointCount>0)
{
Point aOfs = GetSnapRect().Center();
if (nNum==2 && GetConnectedNode(true)==NULL) aPt=(*pEdgeTrack)[0];
else if (nNum==3 && GetConnectedNode(false)==NULL) aPt=(*pEdgeTrack)[nPointCount-1];
else {
if ((nPointCount & 1) ==1) {
aPt=(*pEdgeTrack)[nPointCount/2];
} else {
Point aPt1((*pEdgeTrack)[nPointCount/2-1]);
Point aPt2((*pEdgeTrack)[nPointCount/2]);
aPt1+=aPt2;
aPt1.X()/=2;
aPt1.Y()/=2;
aPt=aPt1;
}
}
aPt-=aOfs;
}
SdrGluePoint aGP(aPt);
aGP.SetPercent(false);
return aGP;
}
SdrGluePoint SdrEdgeObj::GetCornerGluePoint(sal_uInt16 nNum) const
{
return GetVertexGluePoint(nNum);
}
const SdrGluePointList* SdrEdgeObj::GetGluePointList() const
{
return NULL; // no user defined glue points for connectors
}
SdrGluePointList* SdrEdgeObj::ForceGluePointList()
{
return NULL; // no user defined glue points for connectors
}
bool SdrEdgeObj::IsEdge() const
{
return true;
}
void SdrEdgeObj::ConnectToNode(bool bTail1, SdrObject* pObj)
{
SdrObjConnection& rCon=GetConnection(bTail1);
DisconnectFromNode(bTail1);
if (pObj!=NULL) {
pObj->AddListener(*this);
rCon.pObj=pObj;
// #i120437# If connection is set, reset bEdgeTrackUserDefined
bEdgeTrackUserDefined = false;
ImpDirtyEdgeTrack();
}
}
void SdrEdgeObj::DisconnectFromNode(bool bTail1)
{
SdrObjConnection& rCon=GetConnection(bTail1);
if (rCon.pObj!=NULL) {
rCon.pObj->RemoveListener(*this);
rCon.pObj=NULL;
}
}
SdrObject* SdrEdgeObj::GetConnectedNode(bool bTail1) const
{
SdrObject* pObj=GetConnection(bTail1).pObj;
if (pObj!=NULL && (pObj->GetPage()!=pPage || !pObj->IsInserted())) pObj=NULL;
return pObj;
}
bool SdrEdgeObj::CheckNodeConnection(bool bTail1) const
{
bool bRet = false;
const SdrObjConnection& rCon=GetConnection(bTail1);
sal_uInt16 nPointCount=pEdgeTrack->GetPointCount();
if (rCon.pObj!=NULL && rCon.pObj->GetPage()==pPage && nPointCount!=0) {
const SdrGluePointList* pGPL=rCon.pObj->GetGluePointList();
sal_uInt16 nConAnz=pGPL==NULL ? 0 : pGPL->GetCount();
sal_uInt16 nGesAnz=nConAnz+8;
Point aTail(bTail1 ? (*pEdgeTrack)[0] : (*pEdgeTrack)[sal_uInt16(nPointCount-1)]);
for (sal_uInt16 i=0; i<nGesAnz && !bRet; i++) {
if (i<nConAnz) { // UserDefined
bRet=aTail==(*pGPL)[i].GetAbsolutePos(*rCon.pObj);
} else if (i<nConAnz+4) { // Vertex
SdrGluePoint aPt(rCon.pObj->GetVertexGluePoint(i-nConAnz));
bRet=aTail==aPt.GetAbsolutePos(*rCon.pObj);
} else { // Corner
SdrGluePoint aPt(rCon.pObj->GetCornerGluePoint(i-nConAnz-4));
bRet=aTail==aPt.GetAbsolutePos(*rCon.pObj);
}
}
}
return bRet;
}
void SdrEdgeObj::ImpSetTailPoint(bool bTail1, const Point& rPt)
{
sal_uInt16 nPointCount=pEdgeTrack->GetPointCount();
if (nPointCount==0) {
(*pEdgeTrack)[0]=rPt;
(*pEdgeTrack)[1]=rPt;
} else if (nPointCount==1) {
if (!bTail1) (*pEdgeTrack)[1]=rPt;
else { (*pEdgeTrack)[1]=(*pEdgeTrack)[0]; (*pEdgeTrack)[0]=rPt; }
} else {
if (!bTail1) (*pEdgeTrack)[sal_uInt16(nPointCount-1)]=rPt;
else (*pEdgeTrack)[0]=rPt;
}
ImpRecalcEdgeTrack();
SetRectsDirty();
}
void SdrEdgeObj::ImpDirtyEdgeTrack()
{
if ( !bEdgeTrackUserDefined || !(GetModel() && GetModel()->isLocked()) )
bEdgeTrackDirty = true;
}
void SdrEdgeObj::ImpUndirtyEdgeTrack()
{
if (bEdgeTrackDirty && (GetModel() && GetModel()->isLocked()) ) {
ImpRecalcEdgeTrack();
}
}
void SdrEdgeObj::ImpRecalcEdgeTrack()
{
// #i120437# if bEdgeTrackUserDefined, do not recalculate
if(bEdgeTrackUserDefined)
{
return;
}
// #i120437# also not when model locked during import, but remember
if(!GetModel() || GetModel()->isLocked())
{
mbSuppressed = true;
return;
}
// #i110649#
if(IsBoundRectCalculationRunning())
{
// This object is involved into another ImpRecalcEdgeTrack() call
// from another SdrEdgeObj. Do not calculate again to avoid loop.
// Also, do not change bEdgeTrackDirty so that it gets recalculated
// later at the first non-looping call.
}
else
{
// To not run in a depth loop, use a coloring algorithm on
// SdrEdgeObj BoundRect calculations
mbBoundRectCalculationRunning = true;
if(mbSuppressed)
{
// #i123048# If layouting was ever suppressed, it needs to be done once
// and the attr need to be set at EdgeInfo, else these attr *will be lost*
// in the following call to ImpSetEdgeInfoToAttr() sice they were never
// set before (!)
*pEdgeTrack=ImpCalcEdgeTrack(*pEdgeTrack,aCon1,aCon2,&aEdgeInfo);
ImpSetAttrToEdgeInfo();
mbSuppressed = false;
}
Rectangle aBoundRect0; if (pUserCall!=NULL) aBoundRect0=GetCurrentBoundRect();
SetRectsDirty();
*pEdgeTrack=ImpCalcEdgeTrack(*pEdgeTrack,aCon1,aCon2,&aEdgeInfo);
ImpSetEdgeInfoToAttr(); // copy values from aEdgeInfo into the pool
bEdgeTrackDirty=false;
// Only redraw here, no object change
ActionChanged();
SendUserCall(SDRUSERCALL_RESIZE,aBoundRect0);
mbBoundRectCalculationRunning = false;
}
}
SdrEscapeDirection SdrEdgeObj::ImpCalcEscAngle(SdrObject* pObj, const Point& rPt)
{
if (pObj==NULL) return SdrEscapeDirection::ALL;
Rectangle aR(pObj->GetSnapRect());
long dxl=rPt.X()-aR.Left();
long dyo=rPt.Y()-aR.Top();
long dxr=aR.Right()-rPt.X();
long dyu=aR.Bottom()-rPt.Y();
bool bxMitt=std::abs(dxl-dxr)<2;
bool byMitt=std::abs(dyo-dyu)<2;
long dx=std::min(dxl,dxr);
long dy=std::min(dyo,dyu);
bool bDiag=std::abs(dx-dy)<2;
if (bxMitt && byMitt) return SdrEscapeDirection::ALL; // in the center
if (bDiag) { // diagonally
SdrEscapeDirection nRet=SdrEscapeDirection::SMART;
if (byMitt) nRet|=SdrEscapeDirection::VERT;
if (bxMitt) nRet|=SdrEscapeDirection::HORZ;
if (dxl<dxr) { // left
if (dyo<dyu) nRet|=SdrEscapeDirection::LEFT | SdrEscapeDirection::TOP;
else nRet|=SdrEscapeDirection::LEFT | SdrEscapeDirection::BOTTOM;
} else { // right
if (dyo<dyu) nRet|=SdrEscapeDirection::RIGHT | SdrEscapeDirection::TOP;
else nRet|=SdrEscapeDirection::RIGHT | SdrEscapeDirection::BOTTOM;
}
return nRet;
}
if (dx<dy) { // horizontal
if (bxMitt) return SdrEscapeDirection::HORZ;
if (dxl<dxr) return SdrEscapeDirection::LEFT;
else return SdrEscapeDirection::RIGHT;
} else { // vertical
if (byMitt) return SdrEscapeDirection::VERT;
if (dyo<dyu) return SdrEscapeDirection::TOP;
else return SdrEscapeDirection::BOTTOM;
}
}
XPolygon SdrEdgeObj::ImpCalcObjToCenter(const Point& rStPt, long nEscAngle, const Rectangle& rRect, const Point& rMeeting)
{
XPolygon aXP;
aXP.Insert(XPOLY_APPEND,rStPt,XPOLY_NORMAL);
bool bRts=nEscAngle==0;
bool bObn=nEscAngle==9000;
bool bLks=nEscAngle==18000;
bool bUnt=nEscAngle==27000;
Point aP1(rStPt); // mandatory difference first,...
if (bLks) aP1.X()=rRect.Left();
if (bRts) aP1.X()=rRect.Right();
if (bObn) aP1.Y()=rRect.Top();
if (bUnt) aP1.Y()=rRect.Bottom();
Point aP2(aP1); // ...now increase to Meeting height, if necessary
if (bLks && rMeeting.X()<=aP2.X()) aP2.X()=rMeeting.X();
if (bRts && rMeeting.X()>=aP2.X()) aP2.X()=rMeeting.X();
if (bObn && rMeeting.Y()<=aP2.Y()) aP2.Y()=rMeeting.Y();
if (bUnt && rMeeting.Y()>=aP2.Y()) aP2.Y()=rMeeting.Y();
aXP.Insert(XPOLY_APPEND,aP2,XPOLY_NORMAL);
Point aP3(aP2);
if ((bLks && rMeeting.X()>aP2.X()) || (bRts && rMeeting.X()<aP2.X())) { // around
if (rMeeting.Y()<aP2.Y()) {
aP3.Y()=rRect.Top();
if (rMeeting.Y()<aP3.Y()) aP3.Y()=rMeeting.Y();
} else {
aP3.Y()=rRect.Bottom();
if (rMeeting.Y()>aP3.Y()) aP3.Y()=rMeeting.Y();
}
aXP.Insert(XPOLY_APPEND,aP3,XPOLY_NORMAL);
if (aP3.Y()!=rMeeting.Y()) {
aP3.X()=rMeeting.X();
aXP.Insert(XPOLY_APPEND,aP3,XPOLY_NORMAL);
}
}
if ((bObn && rMeeting.Y()>aP2.Y()) || (bUnt && rMeeting.Y()<aP2.Y())) { // around
if (rMeeting.X()<aP2.X()) {
aP3.X()=rRect.Left();
if (rMeeting.X()<aP3.X()) aP3.X()=rMeeting.X();
} else {
aP3.X()=rRect.Right();
if (rMeeting.X()>aP3.X()) aP3.X()=rMeeting.X();
}
aXP.Insert(XPOLY_APPEND,aP3,XPOLY_NORMAL);
if (aP3.X()!=rMeeting.X()) {
aP3.Y()=rMeeting.Y();
aXP.Insert(XPOLY_APPEND,aP3,XPOLY_NORMAL);
}
}
#ifdef DBG_UTIL
if (aXP.GetPointCount()>4) {
OSL_FAIL("SdrEdgeObj::ImpCalcObjToCenter(): Polygon has more than 4 points!");
}
#endif
return aXP;
}
XPolygon SdrEdgeObj::ImpCalcEdgeTrack(const XPolygon& rTrack0, SdrObjConnection& rCon1, SdrObjConnection& rCon2, SdrEdgeInfoRec* pInfo) const
{
Point aPt1,aPt2;
SdrGluePoint aGP1,aGP2;
SdrEscapeDirection nEsc1=SdrEscapeDirection::ALL,nEsc2=SdrEscapeDirection::ALL;
Rectangle aBoundRect1;
Rectangle aBoundRect2;
Rectangle aBewareRect1;
Rectangle aBewareRect2;
// first, get the old corner points
if (rTrack0.GetPointCount()!=0) {
aPt1=rTrack0[0];
sal_uInt16 nSiz=rTrack0.GetPointCount();
nSiz--;
aPt2=rTrack0[nSiz];
} else {
if (!aOutRect.IsEmpty()) {
aPt1=aOutRect.TopLeft();
aPt2=aOutRect.BottomRight();
}
}
// #i54102# To allow interactive preview, do also if not inserted
bool bCon1=rCon1.pObj!=NULL && rCon1.pObj->GetPage()==pPage;
bool bCon2=rCon2.pObj!=NULL && rCon2.pObj->GetPage()==pPage;
const SfxItemSet& rSet = GetObjectItemSet();
if (bCon1) {
if (rCon1.pObj==static_cast<SdrObject const *>(this))
{
// check, just in case
aBoundRect1=aOutRect;
}
else
{
aBoundRect1 = rCon1.pObj->GetCurrentBoundRect();
}
aBoundRect1.Move(rCon1.aObjOfs.X(),rCon1.aObjOfs.Y());
aBewareRect1=aBoundRect1;
sal_Int32 nH = static_cast<const SdrEdgeNode1HorzDistItem&>(rSet.Get(SDRATTR_EDGENODE1HORZDIST)).GetValue();
sal_Int32 nV = static_cast<const SdrEdgeNode1VertDistItem&>(rSet.Get(SDRATTR_EDGENODE1VERTDIST)).GetValue();
aBewareRect1.Left()-=nH;
aBewareRect1.Right()+=nH;
aBewareRect1.Top()-=nV;
aBewareRect1.Bottom()+=nV;
} else {
aBoundRect1=Rectangle(aPt1,aPt1);
aBoundRect1.Move(rCon1.aObjOfs.X(),rCon1.aObjOfs.Y());
aBewareRect1=aBoundRect1;
}
if (bCon2) {
if (rCon2.pObj==static_cast<SdrObject const *>(this)) { // check, just in case
aBoundRect2=aOutRect;
}
else
{
aBoundRect2 = rCon2.pObj->GetCurrentBoundRect();
}
aBoundRect2.Move(rCon2.aObjOfs.X(),rCon2.aObjOfs.Y());
aBewareRect2=aBoundRect2;
sal_Int32 nH = static_cast<const SdrEdgeNode2HorzDistItem&>(rSet.Get(SDRATTR_EDGENODE2HORZDIST)).GetValue();
sal_Int32 nV = static_cast<const SdrEdgeNode2VertDistItem&>(rSet.Get(SDRATTR_EDGENODE2VERTDIST)).GetValue();
aBewareRect2.Left()-=nH;
aBewareRect2.Right()+=nH;
aBewareRect2.Top()-=nV;
aBewareRect2.Bottom()+=nV;
} else {
aBoundRect2=Rectangle(aPt2,aPt2);
aBoundRect2.Move(rCon2.aObjOfs.X(),rCon2.aObjOfs.Y());
aBewareRect2=aBoundRect2;
}
XPolygon aBestXP;
sal_uIntPtr nBestQual=0xFFFFFFFF;
SdrEdgeInfoRec aBestInfo;
bool bAuto1=bCon1 && rCon1.bBestVertex;
bool bAuto2=bCon2 && rCon2.bBestVertex;
if (bAuto1) rCon1.bAutoVertex=true;
if (bAuto2) rCon2.bAutoVertex=true;
sal_uInt16 nBestAuto1=0;
sal_uInt16 nBestAuto2=0;
sal_uInt16 nCount1=bAuto1 ? 4 : 1;
sal_uInt16 nCount2=bAuto2 ? 4 : 1;
for (sal_uInt16 nNum1=0; nNum1<nCount1; nNum1++) {
if (bAuto1) rCon1.nConId=nNum1;
if (bCon1 && rCon1.TakeGluePoint(aGP1,true)) {
aPt1=aGP1.GetPos();
nEsc1=aGP1.GetEscDir();
if (nEsc1==SdrEscapeDirection::SMART) nEsc1=ImpCalcEscAngle(rCon1.pObj,aPt1-rCon1.aObjOfs);
}
for (sal_uInt16 nNum2=0; nNum2<nCount2; nNum2++) {
if (bAuto2) rCon2.nConId=nNum2;
if (bCon2 && rCon2.TakeGluePoint(aGP2,true)) {
aPt2=aGP2.GetPos();
nEsc2=aGP2.GetEscDir();
if (nEsc2==SdrEscapeDirection::SMART) nEsc2=ImpCalcEscAngle(rCon2.pObj,aPt2-rCon2.aObjOfs);
}
for (long nA1=0; nA1<36000; nA1+=9000) {
SdrEscapeDirection nE1 = nA1==0 ? SdrEscapeDirection::RIGHT : nA1==9000 ? SdrEscapeDirection::TOP : nA1==18000 ? SdrEscapeDirection::LEFT : nA1==27000 ? SdrEscapeDirection::BOTTOM : SdrEscapeDirection::SMART;
for (long nA2=0; nA2<36000; nA2+=9000) {
SdrEscapeDirection nE2 = nA2==0 ? SdrEscapeDirection::RIGHT : nA2==9000 ? SdrEscapeDirection::TOP : nA2==18000 ? SdrEscapeDirection::LEFT : nA2==27000 ? SdrEscapeDirection::BOTTOM : SdrEscapeDirection::SMART;
if ((nEsc1&nE1) && (nEsc2&nE2)) {
sal_uIntPtr nQual=0;
SdrEdgeInfoRec aInfo;
if (pInfo!=NULL) aInfo=*pInfo;
XPolygon aXP(ImpCalcEdgeTrack(aPt1,nA1,aBoundRect1,aBewareRect1,aPt2,nA2,aBoundRect2,aBewareRect2,&nQual,&aInfo));
if (nQual<nBestQual) {
aBestXP=aXP;
nBestQual=nQual;
aBestInfo=aInfo;
nBestAuto1=nNum1;
nBestAuto2=nNum2;
}
}
}
}
}
}
if (bAuto1) rCon1.nConId=nBestAuto1;
if (bAuto2) rCon2.nConId=nBestAuto2;
if (pInfo!=NULL) *pInfo=aBestInfo;
return aBestXP;
}
XPolygon SdrEdgeObj::ImpCalcEdgeTrack(const Point& rPt1, long nAngle1, const Rectangle& rBoundRect1, const Rectangle& rBewareRect1,
const Point& rPt2, long nAngle2, const Rectangle& rBoundRect2, const Rectangle& rBewareRect2,
sal_uIntPtr* pnQuality, SdrEdgeInfoRec* pInfo) const
{
SdrEdgeKind eKind=static_cast<const SdrEdgeKindItem&>(GetObjectItem(SDRATTR_EDGEKIND)).GetValue();
bool bRts1=nAngle1==0;
bool bObn1=nAngle1==9000;
bool bLks1=nAngle1==18000;
bool bUnt1=nAngle1==27000;
bool bHor1=bLks1 || bRts1;
bool bVer1=bObn1 || bUnt1;
bool bRts2=nAngle2==0;
bool bObn2=nAngle2==9000;
bool bLks2=nAngle2==18000;
bool bUnt2=nAngle2==27000;
bool bHor2=bLks2 || bRts2;
bool bVer2=bObn2 || bUnt2;
bool bInfo=pInfo!=NULL;
if (bInfo) {
pInfo->cOrthoForm=0;
pInfo->nAngle1=nAngle1;
pInfo->nAngle2=nAngle2;
pInfo->nObj1Lines=1;
pInfo->nObj2Lines=1;
pInfo->nMiddleLine=0xFFFF;
}
Point aPt1(rPt1);
Point aPt2(rPt2);
Rectangle aBoundRect1 (rBoundRect1 );
Rectangle aBoundRect2 (rBoundRect2 );
Rectangle aBewareRect1(rBewareRect1);
Rectangle aBewareRect2(rBewareRect2);
Point aMeeting((aPt1.X()+aPt2.X()+1)/2,(aPt1.Y()+aPt2.Y()+1)/2);
if (eKind==SDREDGE_ONELINE) {
XPolygon aXP(2);
aXP[0]=rPt1;
aXP[1]=rPt2;
if (pnQuality!=NULL) {
*pnQuality=std::abs(rPt1.X()-rPt2.X())+std::abs(rPt1.Y()-rPt2.Y());
}
return aXP;
} else if (eKind==SDREDGE_THREELINES) {
XPolygon aXP(4);
aXP[0]=rPt1;
aXP[1]=rPt1;
aXP[2]=rPt2;
aXP[3]=rPt2;
if (bRts1) aXP[1].X()=aBewareRect1.Right(); //+=500;
if (bObn1) aXP[1].Y()=aBewareRect1.Top(); //-=500;
if (bLks1) aXP[1].X()=aBewareRect1.Left(); //-=500;
if (bUnt1) aXP[1].Y()=aBewareRect1.Bottom(); //+=500;
if (bRts2) aXP[2].X()=aBewareRect2.Right(); //+=500;
if (bObn2) aXP[2].Y()=aBewareRect2.Top(); //-=500;
if (bLks2) aXP[2].X()=aBewareRect2.Left(); //-=500;
if (bUnt2) aXP[2].Y()=aBewareRect2.Bottom(); //+=500;
if (pnQuality!=NULL) {
long nQ=std::abs(aXP[1].X()-aXP[0].X())+std::abs(aXP[1].Y()-aXP[0].Y());
nQ+=std::abs(aXP[2].X()-aXP[1].X())+std::abs(aXP[2].Y()-aXP[1].Y());
nQ+=std::abs(aXP[3].X()-aXP[2].X())+std::abs(aXP[3].Y()-aXP[2].Y());
*pnQuality=nQ;
}
if (bInfo) {
pInfo->nObj1Lines=2;
pInfo->nObj2Lines=2;
if (bHor1) {
aXP[1].X()+=pInfo->aObj1Line2.X();
} else {
aXP[1].Y()+=pInfo->aObj1Line2.Y();
}
if (bHor2) {
aXP[2].X()+=pInfo->aObj2Line2.X();
} else {
aXP[2].Y()+=pInfo->aObj2Line2.Y();
}
}
return aXP;
}
sal_uInt16 nIntersections=0;
{
Point aC1(aBewareRect1.Center());
Point aC2(aBewareRect2.Center());
if (aBewareRect1.Left()<=aBewareRect2.Right() && aBewareRect1.Right()>=aBewareRect2.Left()) {
// overlapping on the x axis
long n1=std::max(aBewareRect1.Left(),aBewareRect2.Left());
long n2=std::min(aBewareRect1.Right(),aBewareRect2.Right());
aMeeting.X()=(n1+n2+1)/2;
} else {
// otherwise the center point of the empty space
if (aC1.X()<aC2.X()) {
aMeeting.X()=(aBewareRect1.Right()+aBewareRect2.Left()+1)/2;
} else {
aMeeting.X()=(aBewareRect1.Left()+aBewareRect2.Right()+1)/2;
}
}
if (aBewareRect1.Top()<=aBewareRect2.Bottom() && aBewareRect1.Bottom()>=aBewareRect2.Top()) {
// overlapping on the x axis
long n1=std::max(aBewareRect1.Top(),aBewareRect2.Top());
long n2=std::min(aBewareRect1.Bottom(),aBewareRect2.Bottom());
aMeeting.Y()=(n1+n2+1)/2;
} else {
// otherwise the center point of the empty space
if (aC1.Y()<aC2.Y()) {
aMeeting.Y()=(aBewareRect1.Bottom()+aBewareRect2.Top()+1)/2;
} else {
aMeeting.Y()=(aBewareRect1.Top()+aBewareRect2.Bottom()+1)/2;
}
}
// Here, there are three cases:
// 1. both go into the same direction
// 2. both go into opposite directions
// 3. one is vertical, the other is horizontal
long nXMin=std::min(aBewareRect1.Left(),aBewareRect2.Left());
long nXMax=std::max(aBewareRect1.Right(),aBewareRect2.Right());
long nYMin=std::min(aBewareRect1.Top(),aBewareRect2.Top());
long nYMax=std::max(aBewareRect1.Bottom(),aBewareRect2.Bottom());
bool bBewareOverlap=aBewareRect1.Right()>aBewareRect2.Left() && aBewareRect1.Left()<aBewareRect2.Right() &&
aBewareRect1.Bottom()>aBewareRect2.Top() && aBewareRect1.Top()<aBewareRect2.Bottom();
unsigned nMainCase=3;
if (nAngle1==nAngle2) nMainCase=1;
else if ((bHor1 && bHor2) || (bVer1 && bVer2)) nMainCase=2;
if (nMainCase==1) { // case 1 (both go in one direction) is possible
if (bVer1) aMeeting.X()=(aPt1.X()+aPt2.X()+1)/2; // Here, this is better than
if (bHor1) aMeeting.Y()=(aPt1.Y()+aPt2.Y()+1)/2; // using center point of empty space
// bX1Ok means that the vertical exiting Obj1 doesn't conflict with Obj2, ...
bool bX1Ok=aPt1.X()<=aBewareRect2.Left() || aPt1.X()>=aBewareRect2.Right();
bool bX2Ok=aPt2.X()<=aBewareRect1.Left() || aPt2.X()>=aBewareRect1.Right();
bool bY1Ok=aPt1.Y()<=aBewareRect2.Top() || aPt1.Y()>=aBewareRect2.Bottom();
bool bY2Ok=aPt2.Y()<=aBewareRect1.Top() || aPt2.Y()>=aBewareRect1.Bottom();
if (bLks1 && (bY1Ok || aBewareRect1.Left()<aBewareRect2.Right()) && (bY2Ok || aBewareRect2.Left()<aBewareRect1.Right())) {
aMeeting.X()=nXMin;
}
if (bRts1 && (bY1Ok || aBewareRect1.Right()>aBewareRect2.Left()) && (bY2Ok || aBewareRect2.Right()>aBewareRect1.Left())) {
aMeeting.X()=nXMax;
}
if (bObn1 && (bX1Ok || aBewareRect1.Top()<aBewareRect2.Bottom()) && (bX2Ok || aBewareRect2.Top()<aBewareRect1.Bottom())) {
aMeeting.Y()=nYMin;
}
if (bUnt1 && (bX1Ok || aBewareRect1.Bottom()>aBewareRect2.Top()) && (bX2Ok || aBewareRect2.Bottom()>aBewareRect1.Top())) {
aMeeting.Y()=nYMax;
}
} else if (nMainCase==2) {
// case 2:
if (bHor1) { // both horizontal
/* 9 sub-cases:
(legend: line exits to the left (-|), right (|-))
2.1: Facing; overlap only on y axis
* * *
|--| *
* * *
2.2, 2.3: Facing, offset vertically; no overlap on either
axis
|- * * * * *
* -| * * -| *
* * * , * * *
2.4, 2.5: One below the other; overlap only on y axis
* |- * * * *
* -| * * -| *
* * * , * |- *
2.6, 2.7: Not facing, offset vertically; no overlap on either
axis
* * |- * * *
* -| * * -| *
* * * , * * |-
2.8: Not facing; overlap only on y axis
* * *
* -| |-
* * *
2.9: The objects's BewareRects overlap on x and y axis
These cases, with some modifications are also valid for
horizontal line exits.
Cases 2.1 through 2.7 are covered well enough with the
default meetings. Only for cases 2.8 and 2.9 do we determine
special meeting points here.
*/
// normalization; be aR1 the one exiting to the right,
// be aR2 the one exiting to the left
Rectangle aBewR1(bRts1 ? aBewareRect1 : aBewareRect2);
Rectangle aBewR2(bRts1 ? aBewareRect2 : aBewareRect1);
Rectangle aBndR1(bRts1 ? aBoundRect1 : aBoundRect2);
Rectangle aBndR2(bRts1 ? aBoundRect2 : aBoundRect1);
if (aBewR1.Bottom()>aBewR2.Top() && aBewR1.Top()<aBewR2.Bottom()) {
// overlap on y axis; cases 2.1, 2.8, 2.9
if (aBewR1.Right()>aBewR2.Left()) {
/* Cases 2.8, 2.9:
Case 2.8: always going around on the outside
(bDirect=false).
Case 2.9 could also be a direct connection (in the
case that the BewareRects overlap only slightly and
the BoundRects don't overlap at all and if the
line exits would otherwise violate the respective
other object's BewareRect).
*/
bool bCase29Direct = false;
bool bCase29=aBewR1.Right()>aBewR2.Left();
if (aBndR1.Right()<=aBndR2.Left()) { // case 2.9 without BoundRect overlap
if ((aPt1.Y()>aBewareRect2.Top() && aPt1.Y()<aBewareRect2.Bottom()) ||
(aPt2.Y()>aBewareRect1.Top() && aPt2.Y()<aBewareRect1.Bottom())) {
bCase29Direct = true;
}
}
if (!bCase29Direct) {
bool bObenLang=std::abs(nYMin-aMeeting.Y())<=std::abs(nYMax-aMeeting.Y());
if (bObenLang) {
aMeeting.Y()=nYMin;
} else {
aMeeting.Y()=nYMax;
}
if (bCase29) {
// now make sure that the surrounded object
// isn't traversed
if ((aBewR1.Center().Y()<aBewR2.Center().Y()) != bObenLang) {
aMeeting.X()=aBewR2.Right();
} else {
aMeeting.X()=aBewR1.Left();
}
}
} else {
// We need a direct connection (3-line Z connection),
// because we have to violate the BewareRects.
// Use rule of three to scale down the BewareRects.
long nWant1=aBewR1.Right()-aBndR1.Right(); // distance at Obj1
long nWant2=aBndR2.Left()-aBewR2.Left(); // distance at Obj2
long nSpace=aBndR2.Left()-aBndR1.Right(); // available space
long nGet1=BigMulDiv(nWant1,nSpace,nWant1+nWant2);
long nGet2=nSpace-nGet1;
if (bRts1) { // revert normalization
aBewareRect1.Right()+=nGet1-nWant1;
aBewareRect2.Left()-=nGet2-nWant2;
} else {
aBewareRect2.Right()+=nGet1-nWant1;
aBewareRect1.Left()-=nGet2-nWant2;
}
nIntersections++; // lower quality
}
}
}
} else if (bVer1) { // both horizontal
Rectangle aBewR1(bUnt1 ? aBewareRect1 : aBewareRect2);
Rectangle aBewR2(bUnt1 ? aBewareRect2 : aBewareRect1);
Rectangle aBndR1(bUnt1 ? aBoundRect1 : aBoundRect2);
Rectangle aBndR2(bUnt1 ? aBoundRect2 : aBoundRect1);
if (aBewR1.Right()>aBewR2.Left() && aBewR1.Left()<aBewR2.Right()) {
// overlap on y axis; cases 2.1, 2.8, 2.9
if (aBewR1.Bottom()>aBewR2.Top()) {
/* Cases 2.8, 2.9
Case 2.8 always going around on the outside (bDirect=false).
Case 2.9 could also be a direct connection (in the
case that the BewareRects overlap only slightly and
the BoundRects don't overlap at all and if the
line exits would otherwise violate the respective
other object's BewareRect).
*/
bool bCase29Direct = false;
bool bCase29=aBewR1.Bottom()>aBewR2.Top();
if (aBndR1.Bottom()<=aBndR2.Top()) { // case 2.9 without BoundRect overlap
if ((aPt1.X()>aBewareRect2.Left() && aPt1.X()<aBewareRect2.Right()) ||
(aPt2.X()>aBewareRect1.Left() && aPt2.X()<aBewareRect1.Right())) {
bCase29Direct = true;
}
}
if (!bCase29Direct) {
bool bLinksLang=std::abs(nXMin-aMeeting.X())<=std::abs(nXMax-aMeeting.X());
if (bLinksLang) {
aMeeting.X()=nXMin;
} else {
aMeeting.X()=nXMax;
}
if (bCase29) {
// now make sure that the surrounded object
// isn't traversed
if ((aBewR1.Center().X()<aBewR2.Center().X()) != bLinksLang) {
aMeeting.Y()=aBewR2.Bottom();
} else {
aMeeting.Y()=aBewR1.Top();
}
}
} else {
// We need a direct connection (3-line Z connection),
// because we have to violate the BewareRects.
// Use rule of three to scale down the BewareRects.
long nWant1=aBewR1.Bottom()-aBndR1.Bottom(); // difference at Obj1
long nWant2=aBndR2.Top()-aBewR2.Top(); // difference at Obj2
long nSpace=aBndR2.Top()-aBndR1.Bottom(); // available space
long nGet1=BigMulDiv(nWant1,nSpace,nWant1+nWant2);
long nGet2=nSpace-nGet1;
if (bUnt1) { // revert normalization
aBewareRect1.Bottom()+=nGet1-nWant1;
aBewareRect2.Top()-=nGet2-nWant2;
} else {
aBewareRect2.Bottom()+=nGet1-nWant1;
aBewareRect1.Top()-=nGet2-nWant2;
}
nIntersections++; // lower quality
}
}
}
}
} else if (nMainCase==3) { // case 3: one horizontal, the other vertical
/* legend:
The line exits to the:
-| left
|- right
_|_ top
T bottom
* . * . * -- no overlap, at most might touch
. . . . . -- overlap
* . |- . * -- same height
. . . . . -- overlap
* . * . * -- no overlap, at most might touch
Overall, there are 96 possible constellations, some of these can't even
be unambiguously assigned to a certain case/method of handling.
3.1: All those constellations that are covered reasonably well
by the default MeetingPoint (20+12).
T T T . _|_ _|_ . T T T these 12 * . * T * * . * . * * T * . * * . * . *
. . . . _|_ _|_ . . . . constellations . . . . . . . . . T . . . . . T . . . .
* . |- . * * . -| . * are covered * . |- . _|_ * . |- . T _|_ . -| . * T . -| . *
. . . . T T . . . . only in . . . . _|_ . . . . . _|_ . . . . . . . . .
_|__|__|_ . T T . _|__|__|_ part: * . * _|_ * * . * . * * _|_ * . * * . * . *
The last 16 of these cases can be excluded, if the objects face each other openly.
3.2: The objects face each other openly, thus a connection using only two lines is possible (4+20);
This case is priority #1.
* . * . T T . * . * these 20 * . * T * * T * . * * . * . * * . * . *
. . . . . . . . . . constellations . . . T T T T . . . . . . . . . . . . .
* . |- . * * . -| . * are covered * . |-_|__|_ _|__|_-| . * * . |- T T T T -| . *
. . . . . . . . . . only in . . . _|__|_ _|__|_ . . . . . . . . . . . . .
* . * . _|_ _|_ . * . * part: * . * _|_ * * _|_ * . * * . * . * * . * . *
3.3: The line exits point away from the other object or miss its back (52+4).
_|__|__|__|_ * * _|__|__|__|_ * . . . * * . * . * these 4 * . * . * * . * . *
_|__|__|__|_ . . _|__|__|__|_ T T T . . . . T T T constellations . . . T . . T . . .
_|__|_ |- . * * . -| _|__|_ T T |- . * * . -| T T are covered * . |- . * * . -| . *
_|__|__|_ . . . . _|__|__|_ T T T T . . T T T T only in . . . _|_ . . _|_ . . .
* . * . * * . * . * T T T T * * T T T T part: * . * . * * . * . *
*/
// case 3.2
Rectangle aTmpR1(aBewareRect1);
Rectangle aTmpR2(aBewareRect2);
if (bBewareOverlap) {
// overlapping BewareRects: use BoundRects for checking for case 3.2
aTmpR1=aBoundRect1;
aTmpR2=aBoundRect2;
}
if ((((bRts1 && aTmpR1.Right ()<=aPt2.X()) || (bLks1 && aTmpR1.Left()>=aPt2.X())) &&
((bUnt2 && aTmpR2.Bottom()<=aPt1.Y()) || (bObn2 && aTmpR2.Top ()>=aPt1.Y()))) ||
(((bRts2 && aTmpR2.Right ()<=aPt1.X()) || (bLks2 && aTmpR2.Left()>=aPt1.X())) &&
((bUnt1 && aTmpR1.Bottom()<=aPt2.Y()) || (bObn1 && aTmpR1.Top ()>=aPt2.Y())))) {
// case 3.2 applies: connector with only 2 lines
if (bHor1) {
aMeeting.X()=aPt2.X();
aMeeting.Y()=aPt1.Y();
} else {
aMeeting.X()=aPt1.X();
aMeeting.Y()=aPt2.Y();
}
// in the case of overlapping BewareRects:
aBewareRect1=aTmpR1;
aBewareRect2=aTmpR2;
} else if ((((bRts1 && aBewareRect1.Right ()>aBewareRect2.Left ()) ||
(bLks1 && aBewareRect1.Left ()<aBewareRect2.Right ())) &&
((bUnt2 && aBewareRect2.Bottom()>aBewareRect1.Top ()) ||
(bObn2 && aBewareRect2.Top ()<aBewareRect1.Bottom()))) ||
(((bRts2 && aBewareRect2.Right ()>aBewareRect1.Left ()) ||
(bLks2 && aBewareRect2.Left ()<aBewareRect1.Right ())) &&
((bUnt1 && aBewareRect1.Bottom()>aBewareRect2.Top ()) ||
(bObn1 && aBewareRect1.Top ()<aBewareRect2.Bottom())))) {
// case 3.3
if (bRts1 || bRts2) { aMeeting.X()=nXMax; }
if (bLks1 || bLks2) { aMeeting.X()=nXMin; }
if (bUnt1 || bUnt2) { aMeeting.Y()=nYMax; }
if (bObn1 || bObn2) { aMeeting.Y()=nYMin; }
}
}
}
XPolygon aXP1(ImpCalcObjToCenter(aPt1,nAngle1,aBewareRect1,aMeeting));
XPolygon aXP2(ImpCalcObjToCenter(aPt2,nAngle2,aBewareRect2,aMeeting));
sal_uInt16 nXP1Anz=aXP1.GetPointCount();
sal_uInt16 nXP2Anz=aXP2.GetPointCount();
if (bInfo) {
pInfo->nObj1Lines=nXP1Anz; if (nXP1Anz>1) pInfo->nObj1Lines--;
pInfo->nObj2Lines=nXP2Anz; if (nXP2Anz>1) pInfo->nObj2Lines--;
}
Point aEP1(aXP1[nXP1Anz-1]);
Point aEP2(aXP2[nXP2Anz-1]);
bool bInsMeetingPoint=aEP1.X()!=aEP2.X() && aEP1.Y()!=aEP2.Y();
bool bHorzE1=aEP1.Y()==aXP1[nXP1Anz-2].Y(); // is last line of XP1 horizontal?
bool bHorzE2=aEP2.Y()==aXP2[nXP2Anz-2].Y(); // is last line of XP2 horizontal?
if (aEP1==aEP2 && ((bHorzE1 && bHorzE2 && aEP1.Y()==aEP2.Y()) || (!bHorzE1 && !bHorzE2 && aEP1.X()==aEP2.X()))) {
// special casing 'I' connectors
nXP1Anz--; aXP1.Remove(nXP1Anz,1);
nXP2Anz--; aXP2.Remove(nXP2Anz,1);
}
if (bInsMeetingPoint) {
aXP1.Insert(XPOLY_APPEND,aMeeting,XPOLY_NORMAL);
if (bInfo) {
// Inserting a MeetingPoint adds 2 new lines,
// either might become the center line.
if (pInfo->nObj1Lines==pInfo->nObj2Lines) {
pInfo->nObj1Lines++;
pInfo->nObj2Lines++;
} else {
if (pInfo->nObj1Lines>pInfo->nObj2Lines) {
pInfo->nObj2Lines++;
pInfo->nMiddleLine=nXP1Anz-1;
} else {
pInfo->nObj1Lines++;
pInfo->nMiddleLine=nXP1Anz;
}
}
}
} else if (bInfo && aEP1!=aEP2 && nXP1Anz+nXP2Anz>=4) {
// By connecting both ends, another line is added, this becomes the center line.
pInfo->nMiddleLine=nXP1Anz-1;
}
sal_uInt16 nNum=aXP2.GetPointCount();
if (aXP1[nXP1Anz-1]==aXP2[nXP2Anz-1] && nXP1Anz>1 && nXP2Anz>1) nNum--;
while (nNum>0) {
nNum--;
aXP1.Insert(XPOLY_APPEND,aXP2[nNum],XPOLY_NORMAL);
}
sal_uInt16 nPointCount=aXP1.GetPointCount();
char cForm=0;
if (bInfo || pnQuality!=NULL) {
cForm='?';
if (nPointCount==2) cForm='I';
else if (nPointCount==3) cForm='L';
else if (nPointCount==4) { // Z or U
if (nAngle1==nAngle2) cForm='U';
else cForm='Z';
} else if (nPointCount==6) { // S or C or ...
if (nAngle1!=nAngle2) {
// For type S, line 2 has the same direction as line 4.
// For type C, the opposite is true.
Point aP1(aXP1[1]);
Point aP2(aXP1[2]);
Point aP3(aXP1[3]);
Point aP4(aXP1[4]);
if (aP1.Y()==aP2.Y()) { // else both lines are horizontal
if ((aP1.X()<aP2.X())==(aP3.X()<aP4.X())) cForm='S';
else cForm='C';
} else { // else both lines are vertical
if ((aP1.Y()<aP2.Y())==(aP3.Y()<aP4.Y())) cForm='S';
else cForm='C';
}
} else cForm='4'; // else is case 3 with 5 lines
} else cForm='?';
// more shapes:
if (bInfo) {
pInfo->cOrthoForm=cForm;
if (cForm=='I' || cForm=='L' || cForm=='Z' || cForm=='U') {
pInfo->nObj1Lines=1;
pInfo->nObj2Lines=1;
if (cForm=='Z' || cForm=='U') {
pInfo->nMiddleLine=1;
} else {
pInfo->nMiddleLine=0xFFFF;
}
} else if (cForm=='S' || cForm=='C') {
pInfo->nObj1Lines=2;
pInfo->nObj2Lines=2;
pInfo->nMiddleLine=2;
}
}
}
if (pnQuality!=NULL) {
sal_uIntPtr nQual=0;
sal_uIntPtr nQual0=nQual; // prevent overruns
bool bOverflow = false;
Point aPt0(aXP1[0]);
for (sal_uInt16 nPntNum=1; nPntNum<nPointCount; nPntNum++) {
Point aPt1b(aXP1[nPntNum]);
nQual+=std::abs(aPt1b.X()-aPt0.X())+std::abs(aPt1b.Y()-aPt0.Y());
if (nQual<nQual0) bOverflow = true;
nQual0=nQual;
aPt0=aPt1b;
}
sal_uInt16 nTmp=nPointCount;
if (cForm=='Z') {
nTmp=2; // Z shape with good quality (nTmp=2 instead of 4)
sal_uIntPtr n1=std::abs(aXP1[1].X()-aXP1[0].X())+std::abs(aXP1[1].Y()-aXP1[0].Y());
sal_uIntPtr n2=std::abs(aXP1[2].X()-aXP1[1].X())+std::abs(aXP1[2].Y()-aXP1[1].Y());
sal_uIntPtr n3=std::abs(aXP1[3].X()-aXP1[2].X())+std::abs(aXP1[3].Y()-aXP1[2].Y());
// try to make lines lengths similar
sal_uIntPtr nBesser=0;
n1+=n3;
n3=n2/4;
if (n1>=n2) nBesser=6;
else if (n1>=3*n3) nBesser=4;
else if (n1>=2*n3) nBesser=2;
if (aXP1[0].Y()!=aXP1[1].Y()) nBesser++; // vertical starting line gets a plus (for H/V-Prio)
if (nQual>nBesser) nQual-=nBesser; else nQual=0;
}
if (nTmp>=3) {
nQual0=nQual;
nQual+=(sal_uIntPtr)nTmp*0x01000000;
if (nQual<nQual0 || nTmp>15) bOverflow = true;
}
if (nPointCount>=2) { // check exit angle again
Point aP1(aXP1[1]); aP1-=aXP1[0];
Point aP2(aXP1[nPointCount-2]); aP2-=aXP1[nPointCount-1];
long nAng1=0; if (aP1.X()<0) nAng1=18000; if (aP1.Y()>0) nAng1=27000;
if (aP1.Y()<0) nAng1=9000; if (aP1.X()!=0 && aP1.Y()!=0) nAng1=1; // slant?!
long nAng2=0; if (aP2.X()<0) nAng2=18000; if (aP2.Y()>0) nAng2=27000;
if (aP2.Y()<0) nAng2=9000; if (aP2.X()!=0 && aP2.Y()!=0) nAng2=1; // slant?!
if (nAng1!=nAngle1) nIntersections++;
if (nAng2!=nAngle2) nIntersections++;
}
// For the quality check, use the original Rects and at the same time
// check whether one them was scaled down for the calculation of the
// Edges (e. g. case 2.9)
aBewareRect1=rBewareRect1;
aBewareRect2=rBewareRect2;
for (sal_uInt16 i=0; i<nPointCount; i++) {
Point aPt1b(aXP1[i]);
bool b1=aPt1b.X()>aBewareRect1.Left() && aPt1b.X()<aBewareRect1.Right() &&
aPt1b.Y()>aBewareRect1.Top() && aPt1b.Y()<aBewareRect1.Bottom();
bool b2=aPt1b.X()>aBewareRect2.Left() && aPt1b.X()<aBewareRect2.Right() &&
aPt1b.Y()>aBewareRect2.Top() && aPt1b.Y()<aBewareRect2.Bottom();
sal_uInt16 nInt0=nIntersections;
if (i==0 || i==nPointCount-1) {
if (b1 && b2) nIntersections++;
} else {
if (b1) nIntersections++;
if (b2) nIntersections++;
}
// check for overlaps
if (i>0 && nInt0==nIntersections) {
if (aPt0.Y()==aPt1b.Y()) { // horizontal line
if (aPt0.Y()>aBewareRect1.Top() && aPt0.Y()<aBewareRect1.Bottom() &&
((aPt0.X()<=aBewareRect1.Left() && aPt1b.X()>=aBewareRect1.Right()) ||
(aPt1b.X()<=aBewareRect1.Left() && aPt0.X()>=aBewareRect1.Right()))) nIntersections++;
if (aPt0.Y()>aBewareRect2.Top() && aPt0.Y()<aBewareRect2.Bottom() &&
((aPt0.X()<=aBewareRect2.Left() && aPt1b.X()>=aBewareRect2.Right()) ||
(aPt1b.X()<=aBewareRect2.Left() && aPt0.X()>=aBewareRect2.Right()))) nIntersections++;
} else { // vertical line
if (aPt0.X()>aBewareRect1.Left() && aPt0.X()<aBewareRect1.Right() &&
((aPt0.Y()<=aBewareRect1.Top() && aPt1b.Y()>=aBewareRect1.Bottom()) ||
(aPt1b.Y()<=aBewareRect1.Top() && aPt0.Y()>=aBewareRect1.Bottom()))) nIntersections++;
if (aPt0.X()>aBewareRect2.Left() && aPt0.X()<aBewareRect2.Right() &&
((aPt0.Y()<=aBewareRect2.Top() && aPt1b.Y()>=aBewareRect2.Bottom()) ||
(aPt1b.Y()<=aBewareRect2.Top() && aPt0.Y()>=aBewareRect2.Bottom()))) nIntersections++;
}
}
aPt0=aPt1b;
}
if (nPointCount<=1) nIntersections++;
nQual0=nQual;
nQual+=(sal_uIntPtr)nIntersections*0x10000000;
if (nQual<nQual0 || nIntersections>15) bOverflow = true;
if (bOverflow || nQual==0xFFFFFFFF) nQual=0xFFFFFFFE;
*pnQuality=nQual;
}
if (bInfo) { // now apply line offsets to aXP1
if (pInfo->nMiddleLine!=0xFFFF) {
sal_uInt16 nIdx=pInfo->ImpGetPolyIdx(MIDDLELINE,aXP1);
if (pInfo->ImpIsHorzLine(MIDDLELINE,aXP1)) {
aXP1[nIdx].Y()+=pInfo->aMiddleLine.Y();
aXP1[nIdx+1].Y()+=pInfo->aMiddleLine.Y();
} else {
aXP1[nIdx].X()+=pInfo->aMiddleLine.X();
aXP1[nIdx+1].X()+=pInfo->aMiddleLine.X();
}
}
if (pInfo->nObj1Lines>=2) {
sal_uInt16 nIdx=pInfo->ImpGetPolyIdx(OBJ1LINE2,aXP1);
if (pInfo->ImpIsHorzLine(OBJ1LINE2,aXP1)) {
aXP1[nIdx].Y()+=pInfo->aObj1Line2.Y();
aXP1[nIdx+1].Y()+=pInfo->aObj1Line2.Y();
} else {
aXP1[nIdx].X()+=pInfo->aObj1Line2.X();
aXP1[nIdx+1].X()+=pInfo->aObj1Line2.X();
}
}
if (pInfo->nObj1Lines>=3) {
sal_uInt16 nIdx=pInfo->ImpGetPolyIdx(OBJ1LINE3,aXP1);
if (pInfo->ImpIsHorzLine(OBJ1LINE3,aXP1)) {
aXP1[nIdx].Y()+=pInfo->aObj1Line3.Y();
aXP1[nIdx+1].Y()+=pInfo->aObj1Line3.Y();
} else {
aXP1[nIdx].X()+=pInfo->aObj1Line3.X();
aXP1[nIdx+1].X()+=pInfo->aObj1Line3.X();
}
}
if (pInfo->nObj2Lines>=2) {
sal_uInt16 nIdx=pInfo->ImpGetPolyIdx(OBJ2LINE2,aXP1);
if (pInfo->ImpIsHorzLine(OBJ2LINE2,aXP1)) {
aXP1[nIdx].Y()+=pInfo->aObj2Line2.Y();
aXP1[nIdx+1].Y()+=pInfo->aObj2Line2.Y();
} else {
aXP1[nIdx].X()+=pInfo->aObj2Line2.X();
aXP1[nIdx+1].X()+=pInfo->aObj2Line2.X();
}
}
if (pInfo->nObj2Lines>=3) {
sal_uInt16 nIdx=pInfo->ImpGetPolyIdx(OBJ2LINE3,aXP1);
if (pInfo->ImpIsHorzLine(OBJ2LINE3,aXP1)) {
aXP1[nIdx].Y()+=pInfo->aObj2Line3.Y();
aXP1[nIdx+1].Y()+=pInfo->aObj2Line3.Y();
} else {
aXP1[nIdx].X()+=pInfo->aObj2Line3.X();
aXP1[nIdx+1].X()+=pInfo->aObj2Line3.X();
}
}
}
// make the connector a bezier curve, if appropriate
if (eKind==SDREDGE_BEZIER && nPointCount>2) {
Point* pPt1=&aXP1[0];
Point* pPt2=&aXP1[1];
Point* pPt3=&aXP1[nPointCount-2];
Point* pPt4=&aXP1[nPointCount-1];
long dx1=pPt2->X()-pPt1->X();
long dy1=pPt2->Y()-pPt1->Y();
long dx2=pPt3->X()-pPt4->X();
long dy2=pPt3->Y()-pPt4->Y();
if (cForm=='L') { // nPointCount==3
aXP1.SetFlags(1,XPOLY_CONTROL);
Point aPt3(*pPt2);
aXP1.Insert(2,aPt3,XPOLY_CONTROL);
nPointCount=aXP1.GetPointCount();
pPt2=&aXP1[1];
pPt3=&aXP1[nPointCount-2];
pPt2->X()-=dx1/3;
pPt2->Y()-=dy1/3;
pPt3->X()-=dx2/3;
pPt3->Y()-=dy2/3;
} else if (nPointCount>=4 && nPointCount<=6) { // Z or U or ...
// To all others, the end points of the original lines become control
// points for now. Thus, we need to do some more work for nPointCount>4!
aXP1.SetFlags(1,XPOLY_CONTROL);
aXP1.SetFlags(nPointCount-2,XPOLY_CONTROL);
// distance x1.5
pPt2->X()+=dx1/2;
pPt2->Y()+=dy1/2;
pPt3->X()+=dx2/2;
pPt3->Y()+=dy2/2;
if (nPointCount==5) {
// add a control point before and after center
Point aCenter(aXP1[2]);
long dx1b=aCenter.X()-aXP1[1].X();
long dy1b=aCenter.Y()-aXP1[1].Y();
long dx2b=aCenter.X()-aXP1[3].X();
long dy2b=aCenter.Y()-aXP1[3].Y();
aXP1.Insert(2,aCenter,XPOLY_CONTROL);
aXP1.SetFlags(3,XPOLY_SYMMTR);
aXP1.Insert(4,aCenter,XPOLY_CONTROL);
aXP1[2].X()-=dx1b/2;
aXP1[2].Y()-=dy1b/2;
aXP1[3].X()-=(dx1b+dx2b)/4;
aXP1[3].Y()-=(dy1b+dy2b)/4;
aXP1[4].X()-=dx2b/2;
aXP1[4].Y()-=dy2b/2;
}
if (nPointCount==6) {
Point aPt1b(aXP1[2]);
Point aPt2b(aXP1[3]);
aXP1.Insert(2,aPt1b,XPOLY_CONTROL);
aXP1.Insert(5,aPt2b,XPOLY_CONTROL);
long dx=aPt1b.X()-aPt2b.X();
long dy=aPt1b.Y()-aPt2b.Y();
aXP1[3].X()-=dx/2;
aXP1[3].Y()-=dy/2;
aXP1.SetFlags(3,XPOLY_SYMMTR);
aXP1.Remove(4,1); // because it's identical with aXP1[3]
}
}
}
return aXP1;
}
/*
There could be a maximum of 64 different developments with 5 lines, a
maximum of 32 developments with 4 lines, a maximum of 16 developments with
3 lines, a maximum of 8 developments with 2 lines.
This gives us a total of 124 possibilities.
Normalized for the 1st exit angle to the right, there remain 31 possibilities.
Now, normalizing away the vertical mirroring, we get to a total of 16
characteristic developments with 1 through 5 lines:
1 line (type "I") --
2 lines (type "L") __|
3 lines (type "U") __ (type "Z") _
__| _|
_ _
4 lines #1 _| #2 | | #3 |_ #4 | |
_| _| _| _|
Of these, #1 is implausible, #2 is a rotated version of #3. This leaves
#2 (from now on referred to as 4.1) and #4 (from now on referred to as 4.2).
_ _
5 lines #1 _| #2 _| #3 ___ #4 _
_| _| _| _| _| |_
_ _ _
#5 |_ #6 |_ #7 _| | #8 ____
_| _| _| |_ _|
Of these, 5.1, 5.2, 5.4 and 5.5 are implausible, 5.7 is a reversed version
of 5.3. This leaves 5.3 (type "4"), 5.6 (type "S") and 5.8 (type "C").
We now have discerned the 9 basic types to cover all 400 possible constellations
of object positions and exit angles. 4 of the 9 types have got a center
line (CL). The number of object margins per object varies between 0 and 3:
CL O1 O2 Note
"I": n 0 0
"L": n 0 0
"U": n 0-1 0-1
"Z": y 0 0
4.2: y 0 1 = U+1, respectively 1+U
4.4: n 0-2 0-2 = Z+1
"4": y 0 2 = Z+2
"S": y 1 1 = 1+Z+1
"C": n 0-3 0-3 = 1+U+1
*/
void SdrEdgeObj::Notify(SfxBroadcaster& rBC, const SfxHint& rHint)
{
const SfxSimpleHint* pSimple = dynamic_cast<const SfxSimpleHint*>(&rHint);
sal_uIntPtr nId=pSimple==0 ? 0 : pSimple->GetId();
bool bDataChg=nId==SFX_HINT_DATACHANGED;
bool bDying=nId==SFX_HINT_DYING;
bool bObj1=aCon1.pObj!=NULL && aCon1.pObj->GetBroadcaster()==&rBC;
bool bObj2=aCon2.pObj!=NULL && aCon2.pObj->GetBroadcaster()==&rBC;
if (bDying && (bObj1 || bObj2)) {
// catch Dying, so AttrObj doesn't start broadcasting
// about an alleged change of template
if (bObj1) aCon1.pObj=NULL;
if (bObj2) aCon2.pObj=NULL;
return;
}
if ( bObj1 || bObj2 )
{
bEdgeTrackUserDefined = false;
}
SdrTextObj::Notify(rBC,rHint);
if (nNotifyingCount==0) { // a locking flag
nNotifyingCount++;
const SdrHint* pSdrHint = dynamic_cast<const SdrHint*>(&rHint);
if (bDataChg) { // StyleSheet changed
ImpSetAttrToEdgeInfo(); // when changing templates, copy values from Pool to aEdgeInfo
}
if (bDataChg ||
(bObj1 && aCon1.pObj->GetPage()==pPage) ||
(bObj2 && aCon2.pObj->GetPage()==pPage) ||
(pSdrHint && pSdrHint->GetKind()==HINT_OBJREMOVED))
{
// broadcasting only, if on the same page
Rectangle aBoundRect0; if (pUserCall!=NULL) aBoundRect0=GetCurrentBoundRect();
ImpDirtyEdgeTrack();
// only redraw here, object hasn't actually changed
ActionChanged();
SendUserCall(SDRUSERCALL_RESIZE,aBoundRect0);
}
nNotifyingCount--;
}
}
/** updates edges that are connected to the edges of this object
as if the connected objects sent a repaint broadcast
*/
void SdrEdgeObj::Reformat()
{
if( NULL != aCon1.pObj )
{
SfxSimpleHint aHint( SFX_HINT_DATACHANGED );
Notify( *const_cast<SfxBroadcaster*>(aCon1.pObj->GetBroadcaster()), aHint );
}
if( NULL != aCon2.pObj )
{
SfxSimpleHint aHint( SFX_HINT_DATACHANGED );
Notify( *const_cast<SfxBroadcaster*>(aCon2.pObj->GetBroadcaster()), aHint );
}
}
SdrEdgeObj* SdrEdgeObj::Clone() const
{
return CloneHelper< SdrEdgeObj >();
}
SdrEdgeObj& SdrEdgeObj::operator=(const SdrEdgeObj& rObj)
{
if( this == &rObj )
return *this;
SdrTextObj::operator=(rObj);
*pEdgeTrack =*rObj.pEdgeTrack;
bEdgeTrackDirty=rObj.bEdgeTrackDirty;
aCon1 =rObj.aCon1;
aCon2 =rObj.aCon2;
aCon1.pObj=NULL;
aCon2.pObj=NULL;
aEdgeInfo=rObj.aEdgeInfo;
return *this;
}
OUString SdrEdgeObj::TakeObjNameSingul() const
{
OUStringBuffer sName(ImpGetResStr(STR_ObjNameSingulEDGE));
OUString aName(GetName());
if (!aName.isEmpty())
{
sName.append(' ');
sName.append('\'');
sName.append(aName);
sName.append('\'');
}
return sName.makeStringAndClear();
}
OUString SdrEdgeObj::TakeObjNamePlural() const
{
return ImpGetResStr(STR_ObjNamePluralEDGE);
}
basegfx::B2DPolyPolygon SdrEdgeObj::TakeXorPoly() const
{
basegfx::B2DPolyPolygon aPolyPolygon;
if (bEdgeTrackDirty)
{
const_cast<SdrEdgeObj*>(this)->ImpRecalcEdgeTrack();
}
if(pEdgeTrack)
{
aPolyPolygon.append(pEdgeTrack->getB2DPolygon());
}
return aPolyPolygon;
}
void SdrEdgeObj::SetEdgeTrackPath( const basegfx::B2DPolyPolygon& rPoly )
{
if ( !rPoly.count() )
{
bEdgeTrackDirty = true;
bEdgeTrackUserDefined = false;
}
else
{
*pEdgeTrack = XPolygon( rPoly.getB2DPolygon( 0 ) );
bEdgeTrackDirty = false;
bEdgeTrackUserDefined = true;
// #i110629# also set aRect and maSnapeRect depending on pEdgeTrack
const Rectangle aPolygonBounds(pEdgeTrack->GetBoundRect());
maRect = aPolygonBounds;
maSnapRect = aPolygonBounds;
}
}
basegfx::B2DPolyPolygon SdrEdgeObj::GetEdgeTrackPath() const
{
basegfx::B2DPolyPolygon aPolyPolygon;
if (bEdgeTrackDirty)
const_cast<SdrEdgeObj*>(this)->ImpRecalcEdgeTrack();
aPolyPolygon.append( pEdgeTrack->getB2DPolygon() );
return aPolyPolygon;
}
sal_uInt32 SdrEdgeObj::GetHdlCount() const
{
SdrEdgeKind eKind=static_cast<const SdrEdgeKindItem&>(GetObjectItem(SDRATTR_EDGEKIND)).GetValue();
sal_uInt32 nHdlAnz(0L);
sal_uInt32 nPointCount(pEdgeTrack->GetPointCount());
if(nPointCount)
{
nHdlAnz = 2L;
if ((eKind==SDREDGE_ORTHOLINES || eKind==SDREDGE_BEZIER) && nPointCount >= 4L)
{
sal_uInt32 nO1(aEdgeInfo.nObj1Lines > 0L ? aEdgeInfo.nObj1Lines - 1L : 0L);
sal_uInt32 nO2(aEdgeInfo.nObj2Lines > 0L ? aEdgeInfo.nObj2Lines - 1L : 0L);
sal_uInt32 nM(aEdgeInfo.nMiddleLine != 0xFFFF ? 1L : 0L);
nHdlAnz += nO1 + nO2 + nM;
}
else if (eKind==SDREDGE_THREELINES && nPointCount == 4L)
{
if(GetConnectedNode(true))
nHdlAnz++;
if(GetConnectedNode(false))
nHdlAnz++;
}
}
return nHdlAnz;
}
SdrHdl* SdrEdgeObj::GetHdl(sal_uInt32 nHdlNum) const
{
SdrHdl* pHdl=NULL;
sal_uInt32 nPointCount(pEdgeTrack->GetPointCount());
if (nPointCount!=0) {
if (nHdlNum==0) {
pHdl=new ImpEdgeHdl((*pEdgeTrack)[0],HDL_POLY);
if (aCon1.pObj!=NULL && aCon1.bBestVertex) pHdl->Set1PixMore(true);
} else if (nHdlNum==1) {
pHdl=new ImpEdgeHdl((*pEdgeTrack)[sal_uInt16(nPointCount-1)],HDL_POLY);
if (aCon2.pObj!=NULL && aCon2.bBestVertex) pHdl->Set1PixMore(true);
} else {
SdrEdgeKind eKind=static_cast<const SdrEdgeKindItem&>(GetObjectItem(SDRATTR_EDGEKIND)).GetValue();
if (eKind==SDREDGE_ORTHOLINES || eKind==SDREDGE_BEZIER) {
sal_uInt32 nO1(aEdgeInfo.nObj1Lines > 0L ? aEdgeInfo.nObj1Lines - 1L : 0L);
sal_uInt32 nO2(aEdgeInfo.nObj2Lines > 0L ? aEdgeInfo.nObj2Lines - 1L : 0L);
sal_uInt32 nM(aEdgeInfo.nMiddleLine != 0xFFFF ? 1L : 0L);
sal_uInt32 nNum(nHdlNum - 2L);
sal_Int32 nPt(0L);
pHdl=new ImpEdgeHdl(Point(),HDL_POLY);
if (nNum<nO1) {
nPt=nNum+1L;
if (nNum==0) static_cast<ImpEdgeHdl*>(pHdl)->SetLineCode(OBJ1LINE2);
if (nNum==1) static_cast<ImpEdgeHdl*>(pHdl)->SetLineCode(OBJ1LINE3);
} else {
nNum=nNum-nO1;
if (nNum<nO2) {
nPt=nPointCount-3-nNum;
if (nNum==0) static_cast<ImpEdgeHdl*>(pHdl)->SetLineCode(OBJ2LINE2);
if (nNum==1) static_cast<ImpEdgeHdl*>(pHdl)->SetLineCode(OBJ2LINE3);
} else {
nNum=nNum-nO2;
if (nNum<nM) {
nPt=aEdgeInfo.nMiddleLine;
static_cast<ImpEdgeHdl*>(pHdl)->SetLineCode(MIDDLELINE);
}
}
}
if (nPt>0) {
Point aPos((*pEdgeTrack)[(sal_uInt16)nPt]);
aPos+=(*pEdgeTrack)[(sal_uInt16)nPt+1];
aPos.X()/=2;
aPos.Y()/=2;
pHdl->SetPos(aPos);
} else {
delete pHdl;
pHdl=NULL;
}
} else if (eKind==SDREDGE_THREELINES) {
sal_uInt32 nNum(nHdlNum);
if (GetConnectedNode(true)==NULL) nNum++;
Point aPos((*pEdgeTrack)[(sal_uInt16)nNum-1]);
pHdl=new ImpEdgeHdl(aPos,HDL_POLY);
if (nNum==2) static_cast<ImpEdgeHdl*>(pHdl)->SetLineCode(OBJ1LINE2);
if (nNum==3) static_cast<ImpEdgeHdl*>(pHdl)->SetLineCode(OBJ2LINE2);
}
}
if (pHdl!=NULL) {
pHdl->SetPointNum(nHdlNum);
}
}
return pHdl;
}
bool SdrEdgeObj::hasSpecialDrag() const
{
return true;
}
SdrObject* SdrEdgeObj::getFullDragClone() const
{
// use Clone operator
SdrEdgeObj* pRetval = Clone();
// copy connections for clone, SdrEdgeObj::operator= does not do this
pRetval->ConnectToNode(true, GetConnectedNode(true));
pRetval->ConnectToNode(false, GetConnectedNode(false));
return pRetval;
}
bool SdrEdgeObj::beginSpecialDrag(SdrDragStat& rDrag) const
{
if(!rDrag.GetHdl())
return false;
rDrag.SetEndDragChangesAttributes(true);
if(rDrag.GetHdl()->GetPointNum() < 2)
{
rDrag.SetNoSnap(true);
}
return true;
}
bool SdrEdgeObj::applySpecialDrag(SdrDragStat& rDragStat)
{
SdrEdgeObj* pOriginalEdge = dynamic_cast< SdrEdgeObj* >(rDragStat.GetHdl()->GetObj());
const bool bOriginalEdgeModified(pOriginalEdge == this);
if(!bOriginalEdgeModified && pOriginalEdge)
{
// copy connections when clone is modified. This is needed because
// as preparation to this modification the data from the original object
// was copied to the clone using the operator=. As can be seen there,
// that operator does not copy the connections (for good reason)
ConnectToNode(true, pOriginalEdge->GetConnection(true).GetObject());
ConnectToNode(false, pOriginalEdge->GetConnection(false).GetObject());
}
if(rDragStat.GetHdl()->GetPointNum() < 2)
{
// start or end point connector drag
const bool bDragA(0 == rDragStat.GetHdl()->GetPointNum());
const Point aPointNow(rDragStat.GetNow());
if(rDragStat.GetPageView())
{
SdrObjConnection* pDraggedOne(bDragA ? &aCon1 : &aCon2);
// clear connection
DisconnectFromNode(bDragA);
// look for new connection
ImpFindConnector(aPointNow, *rDragStat.GetPageView(), *pDraggedOne, pOriginalEdge);
if(pDraggedOne->pObj)
{
// if found, officially connect to it; ImpFindConnector only
// sets pObj hard
SdrObject* pNewConnection = pDraggedOne->pObj;
pDraggedOne->pObj = 0;
ConnectToNode(bDragA, pNewConnection);
}
if(rDragStat.GetView() && !bOriginalEdgeModified)
{
// show IA helper, but only do this during IA, so not when the original
// Edge gets modified in the last call
rDragStat.GetView()->SetConnectMarker(*pDraggedOne, *rDragStat.GetPageView());
}
}
if(pEdgeTrack)
{
// change pEdgeTrack to modified position
if(bDragA)
{
(*pEdgeTrack)[0] = aPointNow;
}
else
{
(*pEdgeTrack)[sal_uInt16(pEdgeTrack->GetPointCount()-1)] = aPointNow;
}
}
// reset edge info's offsets, this is a end point drag
aEdgeInfo.aObj1Line2 = Point();
aEdgeInfo.aObj1Line3 = Point();
aEdgeInfo.aObj2Line2 = Point();
aEdgeInfo.aObj2Line3 = Point();
aEdgeInfo.aMiddleLine = Point();
}
else
{
// control point connector drag
const ImpEdgeHdl* pEdgeHdl = static_cast<const ImpEdgeHdl*>(rDragStat.GetHdl());
const SdrEdgeLineCode eLineCode = pEdgeHdl->GetLineCode();
const Point aDist(rDragStat.GetNow() - rDragStat.GetStart());
sal_Int32 nDist(pEdgeHdl->IsHorzDrag() ? aDist.X() : aDist.Y());
nDist += aEdgeInfo.ImpGetLineVersatz(eLineCode, *pEdgeTrack);
aEdgeInfo.ImpSetLineVersatz(eLineCode, *pEdgeTrack, nDist);
}
// force recalculation of EdgeTrack
*pEdgeTrack = ImpCalcEdgeTrack(*pEdgeTrack, aCon1, aCon2, &aEdgeInfo);
bEdgeTrackDirty=false;
// save EdgeInfos and mark object as user modified
ImpSetEdgeInfoToAttr();
bEdgeTrackUserDefined = false;
SetRectsDirty();
if(bOriginalEdgeModified && rDragStat.GetView())
{
// hide connect marker helper again when original gets changed.
// This happens at the end of the interaction
rDragStat.GetView()->HideConnectMarker();
}
return true;
}
OUString SdrEdgeObj::getSpecialDragComment(const SdrDragStat& rDrag) const
{
const bool bCreateComment(rDrag.GetView() && this == rDrag.GetView()->GetCreateObj());
if(bCreateComment)
{
return OUString();
}
else
{
OUString aStr;
ImpTakeDescriptionStr(STR_DragEdgeTail, aStr);
return aStr;
}
}
basegfx::B2DPolygon SdrEdgeObj::ImplAddConnectorOverlay(SdrDragMethod& rDragMethod, bool bTail1, bool bTail2, bool bDetail) const
{
basegfx::B2DPolygon aResult;
if(bDetail)
{
SdrObjConnection aMyCon1(aCon1);
SdrObjConnection aMyCon2(aCon2);
if (bTail1)
{
const basegfx::B2DPoint aTemp(rDragMethod.getCurrentTransformation() * basegfx::B2DPoint(aMyCon1.aObjOfs.X(), aMyCon1.aObjOfs.Y()));
aMyCon1.aObjOfs.X() = basegfx::fround(aTemp.getX());
aMyCon1.aObjOfs.Y() = basegfx::fround(aTemp.getY());
}
if (bTail2)
{
const basegfx::B2DPoint aTemp(rDragMethod.getCurrentTransformation() * basegfx::B2DPoint(aMyCon2.aObjOfs.X(), aMyCon2.aObjOfs.Y()));
aMyCon2.aObjOfs.X() = basegfx::fround(aTemp.getX());
aMyCon2.aObjOfs.Y() = basegfx::fround(aTemp.getY());
}
SdrEdgeInfoRec aInfo(aEdgeInfo);
XPolygon aXP(ImpCalcEdgeTrack(*pEdgeTrack, aMyCon1, aMyCon2, &aInfo));
if(aXP.GetPointCount())
{
aResult = aXP.getB2DPolygon();
}
}
else
{
Point aPt1((*pEdgeTrack)[0]);
Point aPt2((*pEdgeTrack)[sal_uInt16(pEdgeTrack->GetPointCount() - 1)]);
if (aCon1.pObj && (aCon1.bBestConn || aCon1.bBestVertex))
aPt1 = aCon1.pObj->GetSnapRect().Center();
if (aCon2.pObj && (aCon2.bBestConn || aCon2.bBestVertex))
aPt2 = aCon2.pObj->GetSnapRect().Center();
if (bTail1)
{
const basegfx::B2DPoint aTemp(rDragMethod.getCurrentTransformation() * basegfx::B2DPoint(aPt1.X(), aPt1.Y()));
aPt1.X() = basegfx::fround(aTemp.getX());
aPt1.Y() = basegfx::fround(aTemp.getY());
}
if (bTail2)
{
const basegfx::B2DPoint aTemp(rDragMethod.getCurrentTransformation() * basegfx::B2DPoint(aPt2.X(), aPt2.Y()));
aPt2.X() = basegfx::fround(aTemp.getX());
aPt2.Y() = basegfx::fround(aTemp.getY());
}
aResult.append(basegfx::B2DPoint(aPt1.X(), aPt1.Y()));
aResult.append(basegfx::B2DPoint(aPt2.X(), aPt2.Y()));
}
return aResult;
}
bool SdrEdgeObj::BegCreate(SdrDragStat& rDragStat)
{
rDragStat.SetNoSnap(true);
pEdgeTrack->SetPointCount(2);
(*pEdgeTrack)[0]=rDragStat.GetStart();
(*pEdgeTrack)[1]=rDragStat.GetNow();
if (rDragStat.GetPageView()!=NULL) {
ImpFindConnector(rDragStat.GetStart(),*rDragStat.GetPageView(),aCon1,this);
ConnectToNode(true,aCon1.pObj);
}
*pEdgeTrack=ImpCalcEdgeTrack(*pEdgeTrack,aCon1,aCon2,&aEdgeInfo);
return true;
}
bool SdrEdgeObj::MovCreate(SdrDragStat& rDragStat)
{
sal_uInt16 nMax=pEdgeTrack->GetPointCount();
(*pEdgeTrack)[nMax-1]=rDragStat.GetNow();
if (rDragStat.GetPageView()!=NULL) {
ImpFindConnector(rDragStat.GetNow(),*rDragStat.GetPageView(),aCon2,this);
rDragStat.GetView()->SetConnectMarker(aCon2,*rDragStat.GetPageView());
}
SetBoundRectDirty();
bSnapRectDirty=true;
ConnectToNode(false,aCon2.pObj);
*pEdgeTrack=ImpCalcEdgeTrack(*pEdgeTrack,aCon1,aCon2,&aEdgeInfo);
bEdgeTrackDirty=false;
return true;
}
bool SdrEdgeObj::EndCreate(SdrDragStat& rDragStat, SdrCreateCmd eCmd)
{
bool bOk=(eCmd==SDRCREATE_FORCEEND || rDragStat.GetPointAnz()>=2);
if (bOk) {
ConnectToNode(true,aCon1.pObj);
ConnectToNode(false,aCon2.pObj);
if (rDragStat.GetView()!=NULL) {
rDragStat.GetView()->HideConnectMarker();
}
ImpSetEdgeInfoToAttr(); // copy values from aEdgeInfo into the pool
}
SetRectsDirty();
return bOk;
}
bool SdrEdgeObj::BckCreate(SdrDragStat& rDragStat)
{
if (rDragStat.GetView()!=NULL) {
rDragStat.GetView()->HideConnectMarker();
}
return false;
}
void SdrEdgeObj::BrkCreate(SdrDragStat& rDragStat)
{
if (rDragStat.GetView()!=NULL) {
rDragStat.GetView()->HideConnectMarker();
}
}
basegfx::B2DPolyPolygon SdrEdgeObj::TakeCreatePoly(const SdrDragStat& /*rStatDrag*/) const
{
basegfx::B2DPolyPolygon aRetval;
aRetval.append(pEdgeTrack->getB2DPolygon());
return aRetval;
}
Pointer SdrEdgeObj::GetCreatePointer() const
{
return Pointer(PointerStyle::DrawConnect);
}
bool SdrEdgeObj::ImpFindConnector(const Point& rPt, const SdrPageView& rPV, SdrObjConnection& rCon, const SdrEdgeObj* pThis, OutputDevice* pOut)
{
rCon.ResetVars();
if (pOut==NULL) pOut=rPV.GetView().GetFirstOutputDevice();
if (pOut==NULL) return false;
SdrObjList* pOL=rPV.GetObjList();
const SetOfByte& rVisLayer=rPV.GetVisibleLayers();
// sensitive area of connectors is twice as large as the one of the handles
sal_uInt16 nMarkHdSiz=rPV.GetView().GetMarkHdlSizePixel();
Size aHalfConSiz(nMarkHdSiz,nMarkHdSiz);
aHalfConSiz=pOut->PixelToLogic(aHalfConSiz);
Rectangle aMouseRect(rPt,rPt);
aMouseRect.Left() -=aHalfConSiz.Width();
aMouseRect.Top() -=aHalfConSiz.Height();
aMouseRect.Right() +=aHalfConSiz.Width();
aMouseRect.Bottom()+=aHalfConSiz.Height();
sal_uInt16 nBoundHitTol=(sal_uInt16)aHalfConSiz.Width()/2; if (nBoundHitTol==0) nBoundHitTol=1;
size_t no=pOL->GetObjCount();
bool bFnd = false;
SdrObjConnection aTestCon;
SdrObjConnection aBestCon;
while (no>0 && !bFnd) {
// issue: group objects on different layers return LayerID=0!
no--;
SdrObject* pObj=pOL->GetObj(no);
if (rVisLayer.IsSet(pObj->GetLayer()) && pObj->IsVisible() && // only visible objects
(pThis==NULL || pObj!=static_cast<SdrObject const *>(pThis)) && // don't connect it to itself
pObj->IsNode())
{
Rectangle aObjBound(pObj->GetCurrentBoundRect());
if (aObjBound.IsOver(aMouseRect)) {
aTestCon.ResetVars();
bool bEdge=HAS_BASE(SdrEdgeObj,pObj); // no BestCon for Edge
// User-defined connectors have absolute priority.
// After those come Vertex, Corner and center (Best), all prioritized equally.
// Finally, a HitTest for the object.
const SdrGluePointList* pGPL=pObj->GetGluePointList();
sal_uInt16 nConAnz=pGPL==NULL ? 0 : pGPL->GetCount();
sal_uInt16 nGesAnz=nConAnz+9;
bool bUserFnd = false;
sal_uIntPtr nBestDist=0xFFFFFFFF;
for (sal_uInt16 i=0; i<nGesAnz; i++)
{
bool bUser=i<nConAnz;
bool bVertex=i>=nConAnz+0 && i<nConAnz+4;
bool bCorner=i>=nConAnz+4 && i<nConAnz+8;
bool bCenter=i==nConAnz+8;
bool bOk = false;
Point aConPos;
sal_uInt16 nConNum=i;
if (bUser) {
const SdrGluePoint& rGP=(*pGPL)[nConNum];
aConPos=rGP.GetAbsolutePos(*pObj);
nConNum=rGP.GetId();
bOk = true;
} else if (bVertex && !bUserFnd) {
nConNum=nConNum-nConAnz;
if (rPV.GetView().IsAutoVertexConnectors()) {
SdrGluePoint aPt(pObj->GetVertexGluePoint(nConNum));
aConPos=aPt.GetAbsolutePos(*pObj);
bOk = true;
} else i+=3;
} else if (bCorner && !bUserFnd) {
nConNum-=nConAnz+4;
if (rPV.GetView().IsAutoCornerConnectors()) {
SdrGluePoint aPt(pObj->GetCornerGluePoint(nConNum));
aConPos=aPt.GetAbsolutePos(*pObj);
bOk = true;
} else i+=3;
}
else if (bCenter && !bUserFnd && !bEdge)
{
// Suppress default connect at object center
if(!pThis || !pThis->GetSuppressDefaultConnect())
{
// not the edges!
nConNum=0;
aConPos=aObjBound.Center();
bOk = true;
}
}
if (bOk && aMouseRect.IsInside(aConPos)) {
if (bUser) bUserFnd = true;
bFnd = true;
sal_uIntPtr nDist=(sal_uIntPtr)std::abs(aConPos.X()-rPt.X())+(sal_uIntPtr)std::abs(aConPos.Y()-rPt.Y());
if (nDist<nBestDist) {
nBestDist=nDist;
aTestCon.pObj=pObj;
aTestCon.nConId=nConNum;
aTestCon.bAutoCorner=bCorner;
aTestCon.bAutoVertex=bVertex;
aTestCon.bBestConn=false; // bCenter;
aTestCon.bBestVertex=bCenter;
}
}
}
// if no connector is hit, try HitTest again, for BestConnector (=bCenter)
if(!bFnd &&
!bEdge &&
SdrObjectPrimitiveHit(*pObj, rPt, nBoundHitTol, rPV, &rVisLayer, false))
{
// Suppress default connect at object inside bound
if(!pThis || !pThis->GetSuppressDefaultConnect())
{
bFnd = true;
aTestCon.pObj=pObj;
aTestCon.bBestConn=true;
}
}
if (bFnd) {
Rectangle aMouseRect2(rPt,rPt);
aMouseRect.Left() -=nBoundHitTol;
aMouseRect.Top() -=nBoundHitTol;
aMouseRect.Right() +=nBoundHitTol;
aMouseRect.Bottom()+=nBoundHitTol;
aObjBound.IsOver(aMouseRect2);
}
}
}
}
rCon=aTestCon;
return bFnd;
}
void SdrEdgeObj::NbcSetSnapRect(const Rectangle& rRect)
{
const Rectangle aOld(GetSnapRect());
if(aOld != rRect)
{
if (maRect.IsEmpty() && 0 == pEdgeTrack->GetPointCount())
{
// #i110629# When initializing, do not scale on empty Rectangle; this
// will mirror the underlying text object (!)
maRect = rRect;
maSnapRect = rRect;
}
else
{
long nMulX = rRect.Right() - rRect.Left();
long nDivX = aOld.Right() - aOld.Left();
long nMulY = rRect.Bottom() - rRect.Top();
long nDivY = aOld.Bottom() - aOld.Top();
if ( nDivX == 0 ) { nMulX = 1; nDivX = 1; }
if ( nDivY == 0 ) { nMulY = 1; nDivY = 1; }
Fraction aX(nMulX, nDivX);
Fraction aY(nMulY, nDivY);
NbcResize(aOld.TopLeft(), aX, aY);
NbcMove(Size(rRect.Left() - aOld.Left(), rRect.Top() - aOld.Top()));
}
}
}
void SdrEdgeObj::NbcMove(const Size& rSiz)
{
SdrTextObj::NbcMove(rSiz);
MoveXPoly(*pEdgeTrack,rSiz);
}
void SdrEdgeObj::NbcResize(const Point& rRefPnt, const Fraction& aXFact, const Fraction& aYFact)
{
SdrTextObj::NbcResize(rRefPnt,aXFact,aXFact);
ResizeXPoly(*pEdgeTrack,rRefPnt,aXFact,aYFact);
// if resize is not from paste, forget user distances
if(!GetModel()->IsPasteResize())
{
aEdgeInfo.aObj1Line2 = Point();
aEdgeInfo.aObj1Line3 = Point();
aEdgeInfo.aObj2Line2 = Point();
aEdgeInfo.aObj2Line3 = Point();
aEdgeInfo.aMiddleLine = Point();
}
}
// #i54102# added rotation support
void SdrEdgeObj::NbcRotate(const Point& rRef, long nAngle, double sn, double cs)
{
if(bEdgeTrackUserDefined)
{
// #i120437# special handling when track is imported, apply
// transformation directly to imported track.
SdrTextObj::NbcRotate(rRef, nAngle, sn, cs);
RotateXPoly(*pEdgeTrack, rRef, sn, cs);
}
else
{
// handle start and end point if not connected
bool bCon1=aCon1.pObj!=NULL && aCon1.pObj->GetPage()==pPage;
bool bCon2=aCon2.pObj!=NULL && aCon2.pObj->GetPage()==pPage;
if(!bCon1 && pEdgeTrack)
{
RotatePoint((*pEdgeTrack)[0],rRef,sn,cs);
ImpDirtyEdgeTrack();
}
if(!bCon2 && pEdgeTrack)
{
sal_uInt16 nPointCount = pEdgeTrack->GetPointCount();
RotatePoint((*pEdgeTrack)[sal_uInt16(nPointCount-1)],rRef,sn,cs);
ImpDirtyEdgeTrack();
}
}
}
// #i54102# added mirror support
void SdrEdgeObj::NbcMirror(const Point& rRef1, const Point& rRef2)
{
if(bEdgeTrackUserDefined)
{
// #i120437# special handling when track is imported, apply
// transformation directly to imported track.
SdrTextObj::NbcMirror(rRef1, rRef2);
MirrorXPoly(*pEdgeTrack, rRef1, rRef2);
}
else
{
// handle start and end point if not connected
bool bCon1=aCon1.pObj!=NULL && aCon1.pObj->GetPage()==pPage;
bool bCon2=aCon2.pObj!=NULL && aCon2.pObj->GetPage()==pPage;
if(!bCon1 && pEdgeTrack)
{
MirrorPoint((*pEdgeTrack)[0],rRef1,rRef2);
ImpDirtyEdgeTrack();
}
if(!bCon2 && pEdgeTrack)
{
sal_uInt16 nPointCount = pEdgeTrack->GetPointCount();
MirrorPoint((*pEdgeTrack)[sal_uInt16(nPointCount-1)],rRef1,rRef2);
ImpDirtyEdgeTrack();
}
}
}
// #i54102# added shear support
void SdrEdgeObj::NbcShear(const Point& rRef, long nAngle, double tn, bool bVShear)
{
if(bEdgeTrackUserDefined)
{
// #i120437# special handling when track is imported, apply
// transformation directly to imported track.
SdrTextObj::NbcShear(rRef, nAngle, tn, bVShear);
ShearXPoly(*pEdgeTrack, rRef, tn, bVShear);
}
else
{
// handle start and end point if not connected
bool bCon1=aCon1.pObj!=NULL && aCon1.pObj->GetPage()==pPage;
bool bCon2=aCon2.pObj!=NULL && aCon2.pObj->GetPage()==pPage;
if(!bCon1 && pEdgeTrack)
{
ShearPoint((*pEdgeTrack)[0],rRef,tn,bVShear);
ImpDirtyEdgeTrack();
}
if(!bCon2 && pEdgeTrack)
{
sal_uInt16 nPointCount = pEdgeTrack->GetPointCount();
ShearPoint((*pEdgeTrack)[sal_uInt16(nPointCount-1)],rRef,tn,bVShear);
ImpDirtyEdgeTrack();
}
}
}
SdrObject* SdrEdgeObj::DoConvertToPolyObj(bool bBezier, bool bAddText) const
{
basegfx::B2DPolyPolygon aPolyPolygon;
aPolyPolygon.append(pEdgeTrack->getB2DPolygon());
SdrObject* pRet = ImpConvertMakeObj(aPolyPolygon, false, bBezier);
if(bAddText)
{
pRet = ImpConvertAddText(pRet, bBezier);
}
return pRet;
}
sal_uInt32 SdrEdgeObj::GetSnapPointCount() const
{
return 2L;
}
Point SdrEdgeObj::GetSnapPoint(sal_uInt32 i) const
{
const_cast<SdrEdgeObj*>(this)->ImpUndirtyEdgeTrack();
sal_uInt16 nCount=pEdgeTrack->GetPointCount();
if (i==0) return (*pEdgeTrack)[0];
else return (*pEdgeTrack)[nCount-1];
}
bool SdrEdgeObj::IsPolyObj() const
{
return false;
}
sal_uInt32 SdrEdgeObj::GetPointCount() const
{
return 0L;
}
Point SdrEdgeObj::GetPoint(sal_uInt32 i) const
{
const_cast<SdrEdgeObj*>(this)->ImpUndirtyEdgeTrack();
sal_uInt16 nCount=pEdgeTrack->GetPointCount();
if (0L == i)
return (*pEdgeTrack)[0];
else
return (*pEdgeTrack)[nCount-1];
}
void SdrEdgeObj::NbcSetPoint(const Point& rPnt, sal_uInt32 i)
{
// TODO: Need an implementation to connect differently.
ImpUndirtyEdgeTrack();
sal_uInt16 nCount=pEdgeTrack->GetPointCount();
if (0L == i)
(*pEdgeTrack)[0]=rPnt;
if (1L == i)
(*pEdgeTrack)[nCount-1]=rPnt;
SetEdgeTrackDirty();
SetRectsDirty();
}
SdrEdgeObjGeoData::SdrEdgeObjGeoData()
: bEdgeTrackDirty(false)
, bEdgeTrackUserDefined(false)
{
pEdgeTrack=new XPolygon;
}
SdrEdgeObjGeoData::~SdrEdgeObjGeoData()
{
delete pEdgeTrack;
}
SdrObjGeoData* SdrEdgeObj::NewGeoData() const
{
return new SdrEdgeObjGeoData;
}
void SdrEdgeObj::SaveGeoData(SdrObjGeoData& rGeo) const
{
SdrTextObj::SaveGeoData(rGeo);
SdrEdgeObjGeoData& rEGeo=static_cast<SdrEdgeObjGeoData&>(rGeo);
rEGeo.aCon1 =aCon1;
rEGeo.aCon2 =aCon2;
*rEGeo.pEdgeTrack =*pEdgeTrack;
rEGeo.bEdgeTrackDirty=bEdgeTrackDirty;
rEGeo.bEdgeTrackUserDefined=bEdgeTrackUserDefined;
rEGeo.aEdgeInfo =aEdgeInfo;
}
void SdrEdgeObj::RestGeoData(const SdrObjGeoData& rGeo)
{
SdrTextObj::RestGeoData(rGeo);
const SdrEdgeObjGeoData& rEGeo=static_cast<const SdrEdgeObjGeoData&>(rGeo);
if (aCon1.pObj!=rEGeo.aCon1.pObj) {
if (aCon1.pObj!=NULL) aCon1.pObj->RemoveListener(*this);
aCon1=rEGeo.aCon1;
if (aCon1.pObj!=NULL) aCon1.pObj->AddListener(*this);
}
if (aCon2.pObj!=rEGeo.aCon2.pObj) {
if (aCon2.pObj!=NULL) aCon2.pObj->RemoveListener(*this);
aCon2=rEGeo.aCon2;
if (aCon2.pObj!=NULL) aCon2.pObj->AddListener(*this);
}
*pEdgeTrack =*rEGeo.pEdgeTrack;
bEdgeTrackDirty=rEGeo.bEdgeTrackDirty;
bEdgeTrackUserDefined=rEGeo.bEdgeTrackUserDefined;
aEdgeInfo =rEGeo.aEdgeInfo;
}
Point SdrEdgeObj::GetTailPoint( bool bTail ) const
{
if( pEdgeTrack && pEdgeTrack->GetPointCount()!=0)
{
const XPolygon& rTrack0 = *pEdgeTrack;
if(bTail)
{
return rTrack0[0];
}
else
{
const sal_uInt16 nSiz = rTrack0.GetPointCount() - 1;
return rTrack0[nSiz];
}
}
else
{
if(bTail)
return aOutRect.TopLeft();
else
return aOutRect.BottomRight();
}
}
void SdrEdgeObj::SetTailPoint( bool bTail, const Point& rPt )
{
ImpSetTailPoint( bTail, rPt );
SetChanged();
}
/** this method is used by the api to set a glue point for a connection
nId == -1 : The best default point is automatically chosen
0 <= nId <= 3 : One of the default points is chosen
nId >= 4 : A user defined glue point is chosen
*/
void SdrEdgeObj::setGluePointIndex( bool bTail, sal_Int32 nIndex /* = -1 */ )
{
Rectangle aBoundRect0; if (pUserCall!=NULL) aBoundRect0=GetCurrentBoundRect();
SdrObjConnection& rConn1 = GetConnection( bTail );
rConn1.SetAutoVertex( nIndex >= 0 && nIndex <= 3 );
rConn1.SetBestConnection( nIndex < 0 );
rConn1.SetBestVertex( nIndex < 0 );
if( nIndex > 3 )
{
nIndex -= 3; // the start api index is 0, whereas the implementation in svx starts from 1
// for user defined glue points we have
// to get the id for this index first
const SdrGluePointList* pList = rConn1.GetObject() ? rConn1.GetObject()->GetGluePointList() : NULL;
if( pList == NULL || SDRGLUEPOINT_NOTFOUND == pList->FindGluePoint((sal_uInt16)nIndex) )
return;
}
else if( nIndex < 0 )
{
nIndex = 0;
}
rConn1.SetConnectorId( (sal_uInt16)nIndex );
SetChanged();
SetRectsDirty();
ImpRecalcEdgeTrack();
}
/** this method is used by the api to return a glue point id for a connection.
See setGluePointId for possible return values */
sal_Int32 SdrEdgeObj::getGluePointIndex( bool bTail )
{
SdrObjConnection& rConn1 = GetConnection( bTail );
sal_Int32 nId = -1;
if( !rConn1.IsBestConnection() )
{
nId = rConn1.GetConnectorId();
if( !rConn1.IsAutoVertex() )
nId += 3; // the start api index is 0, whereas the implementation in svx starts from 1
}
return nId;
}
// Implementation was missing; edge track needs to be invalidated additionally.
void SdrEdgeObj::NbcSetAnchorPos(const Point& rPnt)
{
// call parent functionality
SdrTextObj::NbcSetAnchorPos(rPnt);
// Additionally, invalidate edge track
ImpDirtyEdgeTrack();
}
bool SdrEdgeObj::TRGetBaseGeometry(basegfx::B2DHomMatrix& rMatrix, basegfx::B2DPolyPolygon& rPolyPolygon) const
{
// use base method from SdrObject, it's not rotatable and
// a call to GetSnapRect() is used. That's what we need for Connector.
return SdrObject::TRGetBaseGeometry(rMatrix, rPolyPolygon);
}
void SdrEdgeObj::TRSetBaseGeometry(const basegfx::B2DHomMatrix& rMatrix, const basegfx::B2DPolyPolygon& rPolyPolygon)
{
// where appropriate take care for existing connections. For now, just use the
// implementation from SdrObject.
SdrObject::TRSetBaseGeometry(rMatrix, rPolyPolygon);
}
// for geometry access
::basegfx::B2DPolygon SdrEdgeObj::getEdgeTrack() const
{
if(bEdgeTrackDirty)
{
const_cast< SdrEdgeObj* >(this)->ImpRecalcEdgeTrack();
}
if(pEdgeTrack)
{
return pEdgeTrack->getB2DPolygon();
}
else
{
return ::basegfx::B2DPolygon();
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
Reference in New Issue View Git Blame Copy Permalink