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
|
/* -*- 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 <calbck.hxx>
#include <node.hxx>
#include <ndindex.hxx>
#include <swtable.hxx>
#include <ftnfrm.hxx>
#include <sectfrm.hxx>
#include <cntfrm.hxx>
#include <tabfrm.hxx>
#include <frmtool.hxx>
#include <section.hxx>
#include <node2lay.hxx>
/**
* The SwNode2LayImpl class does the actual work, the SwNode2Layout class is
* just the public interface.
*/
class SwNode2LayImpl
{
std::unique_ptr<SwIterator<SwFrame, SwModify, sw::IteratorMode::UnwrapMulti>> pIter;
SwModify* pMod;
std::vector<SwFrame*> mvUpperFrames; // To collect the Upper
sal_uLong nIndex; // The Index of the to-be-inserted Nodes
bool bMaster : 1; // true => only Master, false => only Frames without Follow
bool bInit : 1; // Did we already call First() at SwClient?
SwNode2LayImpl(const SwNode2LayImpl&) = delete;
SwNode2LayImpl& operator=(const SwNode2LayImpl&) = delete;
public:
SwNode2LayImpl( const SwNode& rNode, sal_uLong nIdx, bool bSearch );
SwFrame* NextFrame(); // Returns the next "useful" Frame
SwLayoutFrame* UpperFrame( SwFrame* &rpFrame, const SwNode &rNode );
void SaveUpperFrames(); // Saves (and locks if needed) the pUpper
// Inserts a Frame under every pUpper of the array
void RestoreUpperFrames( SwNodes& rNds, sal_uLong nStt, sal_uLong nEnd );
SwFrame* GetFrame( const Point* pDocPos ) const;
};
static SwNode* GoNextWithFrame(const SwNodes& rNodes, SwNodeIndex *pIdx)
{
if( pIdx->GetIndex() >= rNodes.Count() - 1 )
return nullptr;
SwNodeIndex aTmp(*pIdx, +1);
SwNode* pNd = nullptr;
while( aTmp < rNodes.Count()-1 )
{
pNd = &aTmp.GetNode();
bool bFound = false;
if ( pNd->IsContentNode() )
// sw_redlinehide: assume that it's OK to find a node with the same
// frame as the caller's one
bFound = SwIterator<SwFrame, SwContentNode, sw::IteratorMode::UnwrapMulti>(*static_cast<SwContentNode*>(pNd)).First();
else if ( pNd->IsTableNode() )
bFound = SwIterator<SwFrame,SwFormat>(*static_cast<SwTableNode*>(pNd)->GetTable().GetFrameFormat()).First() ;
else if( pNd->IsEndNode() && !pNd->StartOfSectionNode()->IsSectionNode() )
{
pNd = nullptr;
break;
}
if ( bFound )
break;
++aTmp;
}
if( aTmp == rNodes.Count()-1 )
pNd = nullptr;
else if( pNd )
(*pIdx) = aTmp;
return pNd;
}
static SwNode* GoPreviousWithFrame(SwNodeIndex *pIdx)
{
if( !pIdx->GetIndex() )
return nullptr;
SwNodeIndex aTmp( *pIdx, -1 );
SwNode* pNd(nullptr);
while( aTmp.GetIndex() )
{
pNd = &aTmp.GetNode();
bool bFound = false;
if ( pNd->IsContentNode() )
// sw_redlinehide: assume that it's OK to find a node with the same
// frame as the caller's one
bFound = SwIterator<SwFrame, SwContentNode, sw::IteratorMode::UnwrapMulti>(*static_cast<SwContentNode*>(pNd)).First();
else if ( pNd->IsTableNode() )
bFound = SwIterator<SwFrame,SwFormat>(*static_cast<SwTableNode*>(pNd)->GetTable().GetFrameFormat()).First();
else if( pNd->IsStartNode() && !pNd->IsSectionNode() )
{
pNd = nullptr;
break;
}
if ( bFound )
break;
--aTmp;
}
if( !aTmp.GetIndex() )
pNd = nullptr;
else if( pNd )
(*pIdx) = aTmp;
return pNd;
}
/**
* The main purpose of this ctor is to find the right SwModify to iterate over.
*
* @param bSearch true: find the next Content or TableNode which contains
* Frames (to collect the pUpper).
* Else we assume that rNode points already to such a
* Content or TableNode.
* We insert before or after it.
*/
SwNode2LayImpl::SwNode2LayImpl( const SwNode& rNode, sal_uLong nIdx, bool bSearch )
: nIndex( nIdx ), bInit( false )
{
const SwNode* pNd;
if( bSearch || rNode.IsSectionNode() )
{
// Find the next Content/TableNode that contains a Frame, so that we can add
// ourselves before/after it
if( !bSearch && rNode.GetIndex() < nIndex )
{
SwNodeIndex aTmp( *rNode.EndOfSectionNode(), +1 );
pNd = GoPreviousWithFrame( &aTmp );
if( pNd && rNode.GetIndex() > pNd->GetIndex() )
pNd = nullptr; // Do not go over the limits
bMaster = false;
}
else
{
SwNodeIndex aTmp( rNode, -1 );
pNd = GoNextWithFrame( rNode.GetNodes(), &aTmp );
bMaster = true;
if( !bSearch && pNd && rNode.EndOfSectionIndex() < pNd->GetIndex() )
pNd = nullptr; // Do not go over the limits
}
}
else
{
pNd = &rNode;
bMaster = nIndex < rNode.GetIndex();
}
if( pNd )
{
if( pNd->IsContentNode() )
pMod = const_cast<SwModify*>(static_cast<SwModify const *>(pNd->GetContentNode()));
else
{
assert(pNd->IsTableNode());
pMod = pNd->GetTableNode()->GetTable().GetFrameFormat();
}
pIter.reset(new SwIterator<SwFrame, SwModify, sw::IteratorMode::UnwrapMulti>(*pMod));
}
else
{
pIter = nullptr;
pMod = nullptr;
}
}
/**
* Returns the next "useful" Frame.
*
* When calling this method for the first time, a First is triggered at the
* actual Iterator. The result is check for suitability: Follows are not
* accepted, a Master is accepted when collecting the pUpper and when
* inserting before it.
* When inserting after it, we find and return the last Follow starting
* from the Master.
*
* If the Frame is located in a SectionFrame, we check to see whether the
* SectionFrame is the suitable return value (instead of the Frame itself).
* This is the case if the to-be-inserted Node is outside of the Section.
*/
SwFrame* SwNode2LayImpl::NextFrame()
{
SwFrame* pRet;
if( !pIter )
return nullptr;
if( !bInit )
{
pRet = pIter->First();
bInit = true;
}
else
pRet = pIter->Next();
while( pRet )
{
SwFlowFrame* pFlow = SwFlowFrame::CastFlowFrame( pRet );
assert(pFlow);
// Follows are pretty volatile, thus we ignore them.
// Even if we insert after the Frame, we start from the Master
// and iterate through it until the last Follow
if( !pFlow->IsFollow() )
{
if( !bMaster )
{
while( pFlow->HasFollow() )
pFlow = pFlow->GetFollow();
pRet = &(pFlow->GetFrame());
}
if( pRet->IsInSct() )
{
SwSectionFrame* pSct = pRet->FindSctFrame();
// ATTENTION: If we are in a Footnote, from a Layout point of view
// it could be located in a Section with columns, although it
// should be outside of it when looking at the Nodes.
// Thus, when dealing with Footnotes, we need to check whether the
// SectionFrame is also located within the Footnote and not outside of it.
if( !pRet->IsInFootnote() || pSct->IsInFootnote() )
{
assert(pSct && pSct->GetSection());
SwSectionNode* pNd = pSct->GetSection()->GetFormat()->GetSectionNode();
assert(pNd);
// If the result Frame is located within a Section Frame
// whose Section does not contain the Node, we return with
// the SectionFrame, else we return with the Content/TabFrame
if( bMaster )
{
if( pNd->GetIndex() >= nIndex )
pRet = pSct;
}
else if( pNd->EndOfSectionIndex() < nIndex )
pRet = pSct;
}
}
return pRet;
}
pRet = pIter->Next();
}
return nullptr;
}
void SwNode2LayImpl::SaveUpperFrames()
{
SwFrame* pFrame;
while( nullptr != (pFrame = NextFrame()) )
{
SwFrame* pPrv = pFrame->GetPrev();
pFrame = pFrame->GetUpper();
if( pFrame )
{
if( pFrame->IsFootnoteFrame() )
static_cast<SwFootnoteFrame*>(pFrame)->ColLock();
else if( pFrame->IsInSct() )
pFrame->FindSctFrame()->ColLock();
if( pPrv && pPrv->IsSctFrame() )
static_cast<SwSectionFrame*>(pPrv)->LockJoin();
mvUpperFrames.push_back( pPrv );
mvUpperFrames.push_back( pFrame );
}
}
pIter.reset();
pMod = nullptr;
}
SwLayoutFrame* SwNode2LayImpl::UpperFrame( SwFrame* &rpFrame, const SwNode &rNode )
{
rpFrame = NextFrame();
if( !rpFrame )
return nullptr;
SwLayoutFrame* pUpper = rpFrame->GetUpper();
if( rpFrame->IsSctFrame() )
{
const SwNode* pNode = rNode.StartOfSectionNode();
if( pNode->IsSectionNode() )
{
SwFrame* pFrame = bMaster ? rpFrame->FindPrev() : rpFrame->FindNext();
if( pFrame && pFrame->IsSctFrame() )
{
// pFrame could be a "dummy"-section
if( static_cast<SwSectionFrame*>(pFrame)->GetSection() &&
(&static_cast<const SwSectionNode*>(pNode)->GetSection() ==
static_cast<SwSectionFrame*>(pFrame)->GetSection()) )
{
// #i22922# - consider columned sections
// 'Go down' the section frame as long as the layout frame
// is found, which would contain content.
while ( pFrame->IsLayoutFrame() &&
static_cast<SwLayoutFrame*>(pFrame)->Lower() &&
!static_cast<SwLayoutFrame*>(pFrame)->Lower()->IsFlowFrame() &&
static_cast<SwLayoutFrame*>(pFrame)->Lower()->IsLayoutFrame() )
{
pFrame = static_cast<SwLayoutFrame*>(pFrame)->Lower();
}
assert(pFrame->IsLayoutFrame());
rpFrame = bMaster ? nullptr
: static_cast<SwLayoutFrame*>(pFrame)->Lower();
assert((!rpFrame || rpFrame->IsFlowFrame()) &&
"<SwNode2LayImpl::UpperFrame(..)> - expected sibling isn't a flow frame." );
return static_cast<SwLayoutFrame*>(pFrame);
}
pUpper = new SwSectionFrame(const_cast<SwSectionNode*>(static_cast<const SwSectionNode*>(pNode))->GetSection(), rpFrame);
pUpper->Paste( rpFrame->GetUpper(),
bMaster ? rpFrame : rpFrame->GetNext() );
static_cast<SwSectionFrame*>(pUpper)->Init();
rpFrame = nullptr;
// 'Go down' the section frame as long as the layout frame
// is found, which would contain content.
while ( pUpper->Lower() &&
!pUpper->Lower()->IsFlowFrame() &&
pUpper->Lower()->IsLayoutFrame() )
{
pUpper = static_cast<SwLayoutFrame*>(pUpper->Lower());
}
return pUpper;
}
}
}
if( !bMaster )
rpFrame = rpFrame->GetNext();
return pUpper;
}
void SwNode2LayImpl::RestoreUpperFrames( SwNodes& rNds, sal_uLong nStt, sal_uLong nEnd )
{
SwNode* pNd;
SwDoc *pDoc = rNds.GetDoc();
bool bFirst = true;
for( ; nStt < nEnd; ++nStt )
{
SwFrame* pNew = nullptr;
SwFrame* pNxt;
SwLayoutFrame* pUp;
if( (pNd = rNds[nStt])->IsContentNode() )
for( std::vector<SwFrame*>::size_type n = 0; n < mvUpperFrames.size(); )
{
pNxt = mvUpperFrames[n++];
if( bFirst && pNxt && pNxt->IsSctFrame() )
static_cast<SwSectionFrame*>(pNxt)->UnlockJoin();
pUp = static_cast<SwLayoutFrame*>(mvUpperFrames[n++]);
if( pNxt )
pNxt = pNxt->GetNext();
else
pNxt = pUp->Lower();
pNew = static_cast<SwContentNode*>(pNd)->MakeFrame( pUp );
pNew->Paste( pUp, pNxt );
mvUpperFrames[n-2] = pNew;
}
else if( pNd->IsTableNode() )
for( std::vector<SwFrame*>::size_type x = 0; x < mvUpperFrames.size(); )
{
pNxt = mvUpperFrames[x++];
if( bFirst && pNxt && pNxt->IsSctFrame() )
static_cast<SwSectionFrame*>(pNxt)->UnlockJoin();
pUp = static_cast<SwLayoutFrame*>(mvUpperFrames[x++]);
if( pNxt )
pNxt = pNxt->GetNext();
else
pNxt = pUp->Lower();
pNew = static_cast<SwTableNode*>(pNd)->MakeFrame( pUp );
assert(pNew->IsTabFrame());
pNew->Paste( pUp, pNxt );
static_cast<SwTabFrame*>(pNew)->RegistFlys();
mvUpperFrames[x-2] = pNew;
}
else if( pNd->IsSectionNode() )
{
nStt = pNd->EndOfSectionIndex();
for( std::vector<SwFrame*>::size_type x = 0; x < mvUpperFrames.size(); )
{
pNxt = mvUpperFrames[x++];
if( bFirst && pNxt && pNxt->IsSctFrame() )
static_cast<SwSectionFrame*>(pNxt)->UnlockJoin();
pUp = static_cast<SwLayoutFrame*>(mvUpperFrames[x++]);
OSL_ENSURE( pUp->GetUpper() || pUp->IsFlyFrame(), "Lost Upper" );
::InsertCnt_( pUp, pDoc, pNd->GetIndex(), false, nStt+1, pNxt );
pNxt = pUp->GetLastLower();
mvUpperFrames[x-2] = pNxt;
}
}
bFirst = false;
}
for( std::vector<SwFrame*>::size_type x = 0; x < mvUpperFrames.size(); ++x )
{
SwFrame* pTmp = mvUpperFrames[++x];
if( pTmp->IsFootnoteFrame() )
static_cast<SwFootnoteFrame*>(pTmp)->ColUnlock();
else if ( pTmp->IsInSct() )
{
SwSectionFrame* pSctFrame = pTmp->FindSctFrame();
pSctFrame->ColUnlock();
// #i18103# - invalidate size of section in order to
// assure, that the section is formatted, unless it was 'Collocked'
// from its 'collection' until its 'restoration'.
pSctFrame->InvalidateSize_();
}
}
}
SwFrame* SwNode2LayImpl::GetFrame( const Point* pDocPos ) const
{
// test if change of member pIter -> pMod broke anything
std::pair<Point, bool> tmp;
if (pDocPos)
{
tmp.first = *pDocPos;
tmp.second = false;
}
return pMod ? ::GetFrameOfModify(nullptr, *pMod, FRM_ALL, nullptr, pDocPos ? &tmp : nullptr) : nullptr;
}
SwNode2Layout::SwNode2Layout( const SwNode& rNd, sal_uLong nIdx )
: pImpl( new SwNode2LayImpl( rNd, nIdx, false ) )
{
}
SwNode2LayoutSaveUpperFrames::SwNode2LayoutSaveUpperFrames(const SwNode& rNd)
: pImpl( new SwNode2LayImpl( rNd, rNd.GetIndex(), true ) )
{
pImpl->SaveUpperFrames();
}
void SwNode2LayoutSaveUpperFrames::RestoreUpperFrames(
SwNodes& rNds, sal_uLong const nStt, sal_uLong const nEnd)
{
pImpl->RestoreUpperFrames( rNds, nStt, nEnd );
}
SwFrame* SwNode2Layout::NextFrame()
{
return pImpl->NextFrame();
}
SwLayoutFrame* SwNode2Layout::UpperFrame( SwFrame* &rpFrame, const SwNode &rNode )
{
return pImpl->UpperFrame( rpFrame, rNode );
}
SwNode2Layout::~SwNode2Layout()
{
}
SwNode2LayoutSaveUpperFrames::~SwNode2LayoutSaveUpperFrames()
{
}
SwFrame* SwNode2Layout::GetFrame( const Point* pDocPos ) const
{
return pImpl->GetFrame( pDocPos );
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|