1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
|
/* -*- 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 <sal/config.h>
#include <osl/time.h>
#include <svx/svdmark.hxx>
#include <svx/svdetc.hxx>
#include <svx/svdobj.hxx>
#include <svx/svdpage.hxx>
#include "svx/svditer.hxx"
#include <svx/svdpagv.hxx>
#include <svx/svdopath.hxx>
#include <svx/svdogrp.hxx>
#include <svx/svdorect.hxx>
#include "svx/strings.hrc"
#include "svdglob.hxx"
#include <svx/obj3d.hxx>
#include <svx/scene3d.hxx>
#include <svl/SfxBroadcaster.hxx>
#include <svx/svdoedge.hxx>
#include <cassert>
void SdrMark::setTime()
{
TimeValue aNow;
osl_getSystemTime(&aNow);
mnTimeStamp = sal_Int64(aNow.Seconds) * 1000000000L + aNow.Nanosec;
}
SdrMark::SdrMark(SdrObject* pNewObj, SdrPageView* pNewPageView)
: mpSelectedSdrObject(pNewObj),
mpPageView(pNewPageView),
mbCon1(false),
mbCon2(false),
mnUser(0)
{
if(mpSelectedSdrObject)
{
mpSelectedSdrObject->AddObjectUser( *this );
}
setTime();
}
SdrMark::SdrMark(const SdrMark& rMark)
: ObjectUser(),
mnTimeStamp(0),
mpSelectedSdrObject(nullptr),
mpPageView(nullptr),
mbCon1(false),
mbCon2(false),
mnUser(0)
{
*this = rMark;
}
SdrMark::~SdrMark()
{
if (mpSelectedSdrObject)
{
mpSelectedSdrObject->RemoveObjectUser( *this );
}
}
void SdrMark::ObjectInDestruction(const SdrObject& rObject)
{
(void) rObject; // avoid warnings
OSL_ENSURE(mpSelectedSdrObject && mpSelectedSdrObject == &rObject, "SdrMark::ObjectInDestruction: called form object different from hosted one (!)");
OSL_ENSURE(mpSelectedSdrObject, "SdrMark::ObjectInDestruction: still selected SdrObject is deleted, deselect first (!)");
mpSelectedSdrObject = nullptr;
}
void SdrMark::SetMarkedSdrObj(SdrObject* pNewObj)
{
if(mpSelectedSdrObject)
{
mpSelectedSdrObject->RemoveObjectUser( *this );
}
mpSelectedSdrObject = pNewObj;
if(mpSelectedSdrObject)
{
mpSelectedSdrObject->AddObjectUser( *this );
}
}
SdrMark& SdrMark::operator=(const SdrMark& rMark)
{
SetMarkedSdrObj(rMark.mpSelectedSdrObject);
mnTimeStamp = rMark.mnTimeStamp;
mpPageView = rMark.mpPageView;
mbCon1 = rMark.mbCon1;
mbCon2 = rMark.mbCon2;
mnUser = rMark.mnUser;
maPoints = rMark.maPoints;
maGluePoints = rMark.maGluePoints;
return *this;
}
static bool ImpSdrMarkListSorter(SdrMark* const& lhs, SdrMark* const& rhs)
{
SdrObject* pObj1 = lhs->GetMarkedSdrObj();
SdrObject* pObj2 = rhs->GetMarkedSdrObj();
SdrObjList* pOL1 = (pObj1) ? pObj1->GetObjList() : nullptr;
SdrObjList* pOL2 = (pObj2) ? pObj2->GetObjList() : nullptr;
if (pOL1 == pOL2)
{
// AF: Note that I reverted a change from sal_uInt32 to sal_uLong (made
// for 64bit compliance, #i78198#) because internally in SdrObject
// both nOrdNum and mnNavigationPosition are stored as sal_uInt32.
sal_uInt32 nObjOrd1((pObj1) ? pObj1->GetNavigationPosition() : 0);
sal_uInt32 nObjOrd2((pObj2) ? pObj2->GetNavigationPosition() : 0);
return nObjOrd1 < nObjOrd2;
}
else
{
return pOL1 < pOL2;
}
}
void SdrMarkList::ForceSort() const
{
if(!mbSorted)
{
const_cast<SdrMarkList*>(this)->ImpForceSort();
}
}
void SdrMarkList::ImpForceSort()
{
if(!mbSorted)
{
mbSorted = true;
size_t nCount = maList.size();
// remove invalid
if(nCount > 0 )
{
for(std::vector<SdrMark*>::iterator it = maList.begin(); it != maList.end(); )
{
SdrMark* pAkt = *it;
if(pAkt->GetMarkedSdrObj() == nullptr)
{
it = maList.erase( it );
delete pAkt;
}
else
++it;
}
nCount = maList.size();
}
if(nCount > 1)
{
std::sort(maList.begin(), maList.end(), ImpSdrMarkListSorter);
// remove duplicates
if(maList.size() > 1)
{
SdrMark* pAkt = maList.back();
for (size_t count = maList.size() - 1; count; --count)
{
size_t i = count - 1;
SdrMark* pCmp = maList[i];
assert(pAkt->GetMarkedSdrObj());
if(pAkt->GetMarkedSdrObj() == pCmp->GetMarkedSdrObj())
{
// Con1/Con2 Merging
if(pCmp->IsCon1())
pAkt->SetCon1(true);
if(pCmp->IsCon2())
pAkt->SetCon2(true);
// delete pCmp
maList.erase(maList.begin() + i);
delete pCmp;
}
else
{
pAkt = pCmp;
}
}
}
}
}
}
void SdrMarkList::Clear()
{
for(size_t i = 0; i < GetMarkCount(); ++i)
{
SdrMark* pMark = GetMark(i);
delete pMark;
}
maList.clear();
mbSorted = true; //we're empty, so can be considered sorted
SetNameDirty();
}
SdrMarkList& SdrMarkList::operator=(const SdrMarkList& rLst)
{
Clear();
for(size_t i = 0; i < rLst.GetMarkCount(); ++i)
{
SdrMark* pMark = rLst.GetMark(i);
SdrMark* pNeuMark = new SdrMark(*pMark);
maList.push_back(pNeuMark);
}
maMarkName = rLst.maMarkName;
mbNameOk = rLst.mbNameOk;
maPointName = rLst.maPointName;
mbPointNameOk = rLst.mbPointNameOk;
maGluePointName = rLst.maGluePointName;
mbSorted = rLst.mbSorted;
return *this;
}
SdrMark* SdrMarkList::GetMark(size_t nNum) const
{
return (nNum < maList.size()) ? maList[nNum] : nullptr;
}
size_t SdrMarkList::FindObject(const SdrObject* pObj) const
{
// Since relying on OrdNums is not allowed for the selection because objects in the
// selection may not be inserted in a list if they are e.g. modified ATM, i changed
// this loop to just look if the object pointer is in the selection.
// Problem is that GetOrdNum() which is const, internally casts to non-const and
// hardly sets the OrdNum member of the object (nOrdNum) to 0 (ZERO) if the object
// is not inserted in a object list.
// Since this may be by purpose and necessary somewhere else i decided that it is
// less dangerous to change this method then changing SdrObject::GetOrdNum().
if(pObj && !maList.empty())
{
for(size_t a = 0; a < maList.size(); ++a)
{
if(maList[a]->GetMarkedSdrObj() == pObj)
{
return a;
}
}
}
return SAL_MAX_SIZE;
}
void SdrMarkList::InsertEntry(const SdrMark& rMark, bool bChkSort)
{
SetNameDirty();
const size_t nCount(maList.size());
if(!bChkSort || !mbSorted || nCount == 0)
{
if(!bChkSort)
mbSorted = false;
maList.push_back(new SdrMark(rMark));
}
else
{
SdrMark* pLast = GetMark(nCount - 1);
const SdrObject* pLastObj = pLast->GetMarkedSdrObj();
const SdrObject* pNewObj = rMark.GetMarkedSdrObj();
if(pLastObj == pNewObj)
{
// This one already exists.
// Con1/Con2 Merging
if(rMark.IsCon1())
pLast->SetCon1(true);
if(rMark.IsCon2())
pLast->SetCon2(true);
}
else
{
SdrMark* pKopie = new SdrMark(rMark);
maList.push_back(pKopie);
// now check if the sort is ok
const SdrObjList* pLastOL = pLastObj!=nullptr ? pLastObj->GetObjList() : nullptr;
const SdrObjList* pNeuOL = pNewObj !=nullptr ? pNewObj ->GetObjList() : nullptr;
if(pLastOL == pNeuOL)
{
const sal_uLong nLastNum(pLastObj!=nullptr ? pLastObj->GetOrdNum() : 0);
const sal_uLong nNewNum(pNewObj !=nullptr ? pNewObj ->GetOrdNum() : 0);
if(nNewNum < nLastNum)
{
// at some point, we have to sort
mbSorted = false;
}
}
else
{
// at some point, we have to sort
mbSorted = false;
}
}
}
}
void SdrMarkList::DeleteMark(size_t nNum)
{
SdrMark* pMark = GetMark(nNum);
DBG_ASSERT(pMark!=nullptr,"DeleteMark: MarkEntry not found.");
if(pMark)
{
maList.erase(maList.begin() + nNum);
delete pMark;
if (maList.empty())
mbSorted = true; //we're empty, so can be considered sorted
SetNameDirty();
}
}
void SdrMarkList::ReplaceMark(const SdrMark& rNewMark, size_t nNum)
{
SdrMark* pMark = GetMark(nNum);
DBG_ASSERT(pMark!=nullptr,"ReplaceMark: MarkEntry not found.");
if(pMark)
{
delete pMark;
SetNameDirty();
SdrMark* pKopie = new SdrMark(rNewMark);
maList[nNum] = pKopie;
mbSorted = false;
}
}
void SdrMarkList::Merge(const SdrMarkList& rSrcList, bool bReverse)
{
const size_t nCount(rSrcList.maList.size());
if(rSrcList.mbSorted)
{
// merge without forcing a Sort in rSrcList
bReverse = false;
}
if(!bReverse)
{
for(size_t i = 0; i < nCount; ++i)
{
SdrMark* pM = rSrcList.maList[i];
InsertEntry(*pM);
}
}
else
{
for(size_t i = nCount; i > 0;)
{
--i;
SdrMark* pM = rSrcList.maList[i];
InsertEntry(*pM);
}
}
}
bool SdrMarkList::DeletePageView(const SdrPageView& rPV)
{
bool bChgd(false);
for(std::vector<SdrMark*>::iterator it = maList.begin(); it != maList.end(); )
{
SdrMark* pMark = *it;
if(pMark->GetPageView()==&rPV)
{
it = maList.erase(it);
delete pMark;
SetNameDirty();
bChgd = true;
}
else
++it;
}
return bChgd;
}
bool SdrMarkList::InsertPageView(const SdrPageView& rPV)
{
bool bChgd(false);
DeletePageView(rPV); // delete all of them, then append the entire page
const SdrObjList* pOL = rPV.GetObjList();
const size_t nObjCount(pOL->GetObjCount());
for(size_t nO = 0; nO < nObjCount; ++nO)
{
SdrObject* pObj = pOL->GetObj(nO);
bool bDoIt(rPV.IsObjMarkable(pObj));
if(bDoIt)
{
SdrMark* pM = new SdrMark(pObj, const_cast<SdrPageView*>(&rPV));
maList.push_back(pM);
SetNameDirty();
bChgd = true;
}
}
return bChgd;
}
const OUString& SdrMarkList::GetMarkDescription() const
{
const size_t nCount(GetMarkCount());
if(mbNameOk && 1 == nCount)
{
// if it's a single selection, cache only text frame
const SdrObject* pObj = GetMark(0)->GetMarkedSdrObj();
const SdrTextObj* pTextObj = dynamic_cast<const SdrTextObj*>( pObj );
if(!pTextObj || !pTextObj->IsTextFrame())
{
const_cast<SdrMarkList*>(this)->mbNameOk = false;
}
}
if(!mbNameOk)
{
SdrMark* pMark = GetMark(0);
OUString aNam;
if(!nCount)
{
const_cast<SdrMarkList*>(this)->maMarkName = ImpGetResStr(STR_ObjNameNoObj);
}
else if(1 == nCount)
{
if(pMark->GetMarkedSdrObj())
{
aNam = pMark->GetMarkedSdrObj()->TakeObjNameSingul();
}
}
else
{
if(pMark->GetMarkedSdrObj())
{
aNam = pMark->GetMarkedSdrObj()->TakeObjNamePlural();
bool bEq(true);
for(size_t i = 1; i < GetMarkCount() && bEq; ++i)
{
SdrMark* pMark2 = GetMark(i);
OUString aStr1(pMark2->GetMarkedSdrObj()->TakeObjNamePlural());
bEq = aNam == aStr1;
}
if(!bEq)
{
aNam = ImpGetResStr(STR_ObjNamePlural);
}
}
aNam = OUString::number( nCount ) + " " + aNam;
}
const_cast<SdrMarkList*>(this)->maMarkName = aNam;
const_cast<SdrMarkList*>(this)->mbNameOk = true;
}
return maMarkName;
}
const OUString& SdrMarkList::GetPointMarkDescription(bool bGlue) const
{
bool& rNameOk = const_cast<bool&>(bGlue ? mbGluePointNameOk : mbPointNameOk);
OUString& rName = const_cast<OUString&>(bGlue ? maGluePointName : maPointName);
const size_t nMarkCount(GetMarkCount());
size_t nMarkPtCnt(0);
size_t nMarkPtObjCnt(0);
size_t n1stMarkNum(SAL_MAX_SIZE);
for(size_t nMarkNum = 0; nMarkNum < nMarkCount; ++nMarkNum)
{
const SdrMark* pMark = GetMark(nMarkNum);
const SdrUShortCont& rPts = bGlue ? pMark->GetMarkedGluePoints() : pMark->GetMarkedPoints();
if (!rPts.empty())
{
if(n1stMarkNum == SAL_MAX_SIZE)
{
n1stMarkNum = nMarkNum;
}
nMarkPtCnt += rPts.size();
nMarkPtObjCnt++;
}
if(nMarkPtObjCnt > 1 && rNameOk)
{
// preliminary decision
return rName;
}
}
if(rNameOk && 1 == nMarkPtObjCnt)
{
// if it's a single selection, cache only text frame
const SdrObject* pObj = GetMark(0)->GetMarkedSdrObj();
const SdrTextObj* pTextObj = dynamic_cast<const SdrTextObj*>( pObj );
if(!pTextObj || !pTextObj->IsTextFrame())
{
rNameOk = false;
}
}
if(!nMarkPtObjCnt)
{
rName.clear();
rNameOk = true;
}
else if(!rNameOk)
{
const SdrMark* pMark = GetMark(n1stMarkNum);
OUString aNam;
if(1 == nMarkPtObjCnt)
{
if(pMark->GetMarkedSdrObj())
{
aNam = pMark->GetMarkedSdrObj()->TakeObjNameSingul();
}
}
else
{
if(pMark->GetMarkedSdrObj())
{
aNam = pMark->GetMarkedSdrObj()->TakeObjNamePlural();
}
bool bEq(true);
for(size_t i = n1stMarkNum + 1; i < GetMarkCount() && bEq; ++i)
{
const SdrMark* pMark2 = GetMark(i);
const SdrUShortCont& rPts = bGlue ? pMark2->GetMarkedGluePoints() : pMark2->GetMarkedPoints();
if (!rPts.empty() && pMark2->GetMarkedSdrObj())
{
OUString aStr1(pMark2->GetMarkedSdrObj()->TakeObjNamePlural());
bEq = aNam == aStr1;
}
}
if(!bEq)
{
aNam = ImpGetResStr(STR_ObjNamePlural);
}
aNam = OUString::number( nMarkPtObjCnt ) + " " + aNam;
}
OUString aStr1;
if(1 == nMarkPtCnt)
{
aStr1 = (ImpGetResStr(bGlue ? STR_ViewMarkedGluePoint : STR_ViewMarkedPoint));
}
else
{
aStr1 = (ImpGetResStr(bGlue ? STR_ViewMarkedGluePoints : STR_ViewMarkedPoints));
aStr1 = aStr1.replaceFirst("%2", OUString::number( nMarkPtCnt ));
}
aStr1 = aStr1.replaceFirst("%1", aNam);
rName = aStr1;
rNameOk = true;
}
return rName;
}
bool SdrMarkList::TakeBoundRect(SdrPageView const * pPV, tools::Rectangle& rRect) const
{
bool bFnd(false);
tools::Rectangle aR;
for(size_t i = 0; i < GetMarkCount(); ++i)
{
SdrMark* pMark = GetMark(i);
if(!pPV || pMark->GetPageView() == pPV)
{
if(pMark->GetMarkedSdrObj())
{
aR = pMark->GetMarkedSdrObj()->GetCurrentBoundRect();
if(bFnd)
{
rRect.Union(aR);
}
else
{
rRect = aR;
bFnd = true;
}
}
}
}
return bFnd;
}
bool SdrMarkList::TakeSnapRect(SdrPageView const * pPV, tools::Rectangle& rRect) const
{
bool bFnd(false);
for(size_t i = 0; i < GetMarkCount(); ++i)
{
SdrMark* pMark = GetMark(i);
if(!pPV || pMark->GetPageView() == pPV)
{
if(pMark->GetMarkedSdrObj())
{
tools::Rectangle aR(pMark->GetMarkedSdrObj()->GetSnapRect());
if(bFnd)
{
rRect.Union(aR);
}
else
{
rRect = aR;
bFnd = true;
}
}
}
}
return bFnd;
}
namespace sdr
{
ViewSelection::ViewSelection()
: mbEdgesOfMarkedNodesDirty(false)
{
}
void ViewSelection::SetEdgesOfMarkedNodesDirty()
{
if(!mbEdgesOfMarkedNodesDirty)
{
mbEdgesOfMarkedNodesDirty = true;
maEdgesOfMarkedNodes.Clear();
maMarkedEdgesOfMarkedNodes.Clear();
maAllMarkedObjects.clear();
}
}
const SdrMarkList& ViewSelection::GetEdgesOfMarkedNodes() const
{
if(mbEdgesOfMarkedNodesDirty)
{
const_cast<ViewSelection*>(this)->ImpForceEdgesOfMarkedNodes();
}
return maEdgesOfMarkedNodes;
}
const SdrMarkList& ViewSelection::GetMarkedEdgesOfMarkedNodes() const
{
if(mbEdgesOfMarkedNodesDirty)
{
const_cast<ViewSelection*>(this)->ImpForceEdgesOfMarkedNodes();
}
return maMarkedEdgesOfMarkedNodes;
}
const std::vector<SdrObject*>& ViewSelection::GetAllMarkedObjects() const
{
if(mbEdgesOfMarkedNodesDirty)
const_cast<ViewSelection*>(this)->ImpForceEdgesOfMarkedNodes();
return maAllMarkedObjects;
}
void ViewSelection::ImplCollectCompleteSelection(SdrObject* pObj)
{
if(pObj)
{
bool bIsGroup(pObj->IsGroupObject());
if(bIsGroup && dynamic_cast< const E3dObject* >(pObj) != nullptr && dynamic_cast< const E3dScene* >(pObj) == nullptr)
{
bIsGroup = false;
}
if(bIsGroup)
{
SdrObjList* pList = pObj->GetSubList();
for(size_t a = 0; a < pList->GetObjCount(); ++a)
{
SdrObject* pObj2 = pList->GetObj(a);
ImplCollectCompleteSelection(pObj2);
}
}
maAllMarkedObjects.push_back(pObj);
}
}
void ViewSelection::ImpForceEdgesOfMarkedNodes()
{
if(mbEdgesOfMarkedNodesDirty)
{
mbEdgesOfMarkedNodesDirty = false;
maMarkedObjectList.ForceSort();
maEdgesOfMarkedNodes.Clear();
maMarkedEdgesOfMarkedNodes.Clear();
maAllMarkedObjects.clear();
// GetMarkCount after ForceSort
const size_t nMarkCount(maMarkedObjectList.GetMarkCount());
for(size_t a = 0; a < nMarkCount; ++a)
{
SdrObject* pCandidate = maMarkedObjectList.GetMark(a)->GetMarkedSdrObj();
if(pCandidate)
{
// build transitive hull
ImplCollectCompleteSelection(pCandidate);
if(pCandidate->IsNode())
{
// travel over broadcaster/listener to access edges connected to the selected object
const SfxBroadcaster* pBC = pCandidate->GetBroadcaster();
if(pBC)
{
const size_t nLstAnz(pBC->GetSizeOfVector());
for(size_t nl=0; nl < nLstAnz; ++nl)
{
SfxListener* pLst = pBC->GetListener(nl);
SdrEdgeObj* pEdge = dynamic_cast<SdrEdgeObj*>( pLst );
if(pEdge && pEdge->IsInserted() && pEdge->GetPage() == pCandidate->GetPage())
{
SdrMark aM(pEdge, maMarkedObjectList.GetMark(a)->GetPageView());
if(pEdge->GetConnectedNode(true) == pCandidate)
{
aM.SetCon1(true);
}
if(pEdge->GetConnectedNode(false) == pCandidate)
{
aM.SetCon2(true);
}
if(SAL_MAX_SIZE == maMarkedObjectList.FindObject(pEdge))
{
// check if it itself is selected
maEdgesOfMarkedNodes.InsertEntry(aM);
}
else
{
maMarkedEdgesOfMarkedNodes.InsertEntry(aM);
}
}
}
}
}
}
}
maEdgesOfMarkedNodes.ForceSort();
maMarkedEdgesOfMarkedNodes.ForceSort();
}
}
} // end of namespace sdr
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|