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 | /* -*- 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 <hintids.hxx>
#include <tools/stream.hxx>
#include <comphelper/string.hxx>
#include <pam.hxx>
#include <doc.hxx>
#include <ndtxt.hxx>
#include <IDocumentRedlineAccess.hxx>
#include <redline.hxx>
#include "wrtasc.hxx"
#include <txatbase.hxx>
#include <txtfld.hxx>
#include <fmtftn.hxx>
#include <fmtfld.hxx>
#include <fldbas.hxx>
#include <ftninfo.hxx>
#include <numrule.hxx>
#include <algorithm>
/*
* This file contains all output functions of the ASCII-Writer;
* For all nodes, attributes, formats and chars.
*/
namespace {
class SwASC_AttrIter
{
SwASCWriter& rWrt;
const SwTextNode& rNd;
sal_Int32 nCurrentSwPos;
sal_Int32 SearchNext( sal_Int32 nStartPos );
public:
SwASC_AttrIter( SwASCWriter& rWrt, const SwTextNode& rNd, sal_Int32 nStt );
void NextPos()
{
nCurrentSwPos = SearchNext( nCurrentSwPos + 1 );
}
sal_Int32 WhereNext() const
{
return nCurrentSwPos;
}
bool OutAttr( sal_Int32 nSwPos );
};
}
SwASC_AttrIter::SwASC_AttrIter(
SwASCWriter& rWr,
const SwTextNode& rTextNd,
sal_Int32 nStt )
: rWrt( rWr )
, rNd( rTextNd )
, nCurrentSwPos( 0 )
{
nCurrentSwPos = SearchNext( nStt + 1 );
}
sal_Int32 SwASC_AttrIter::SearchNext( sal_Int32 nStartPos )
{
sal_Int32 nMinPos = SAL_MAX_INT32;
const SwpHints* pTextAttrs = rNd.GetpSwpHints();
if( pTextAttrs )
{
// TODO: This can be optimized, if we make use of the fact that the TextAttrs
// are sorted by starting position. We would need to remember two indices, however.
for ( size_t i = 0; i < pTextAttrs->Count(); ++i )
{
const SwTextAttr* pHt = pTextAttrs->Get(i);
if ( pHt->HasDummyChar() )
{
sal_Int32 nPos = pHt->GetStart();
if( nPos >= nStartPos && nPos <= nMinPos )
nMinPos = nPos;
if( ( ++nPos ) >= nStartPos && nPos < nMinPos )
nMinPos = nPos;
}
else if ( pHt->HasContent() )
{
const sal_Int32 nHintStart = pHt->GetStart();
if ( nHintStart >= nStartPos && nHintStart <= nMinPos )
{
nMinPos = nHintStart;
}
const sal_Int32 nHintEnd = pHt->End() ? *pHt->End() : COMPLETE_STRING;
if ( nHintEnd >= nStartPos && nHintEnd < nMinPos )
{
nMinPos = nHintEnd;
}
}
}
}
return nMinPos;
}
bool SwASC_AttrIter::OutAttr( sal_Int32 nSwPos )
{
bool bRet = false;
const SwpHints* pTextAttrs = rNd.GetpSwpHints();
if( pTextAttrs )
{
for( size_t i = 0; i < pTextAttrs->Count(); ++i )
{
const SwTextAttr* pHt = pTextAttrs->Get(i);
if ( ( pHt->HasDummyChar()
|| pHt->HasContent() )
&& nSwPos == pHt->GetStart() )
{
bRet = true;
OUString sOut;
switch( pHt->Which() )
{
case RES_TXTATR_FIELD:
case RES_TXTATR_ANNOTATION:
case RES_TXTATR_INPUTFIELD:
sOut = static_txtattr_cast<SwTextField const*>(pHt)
->GetFormatField().GetField()->ExpandField(true, nullptr);
break;
case RES_TXTATR_FTN:
{
const SwFormatFootnote& rFootnote = pHt->GetFootnote();
if( !rFootnote.GetNumStr().isEmpty() )
sOut = rFootnote.GetNumStr();
else if( rFootnote.IsEndNote() )
sOut = rWrt.m_pDoc->GetEndNoteInfo().m_aFormat.
GetNumStr( rFootnote.GetNumber() );
else
sOut = rWrt.m_pDoc->GetFootnoteInfo().m_aFormat.
GetNumStr( rFootnote.GetNumber() );
}
break;
}
if( !sOut.isEmpty() )
rWrt.Strm().WriteUnicodeOrByteText( sOut );
}
else if( nSwPos < pHt->GetStart() )
break;
}
}
return bRet;
}
namespace {
class SwASC_RedlineIter
{
private:
SwTextNode const& m_rNode;
IDocumentRedlineAccess const& m_rIDRA;
SwRedlineTable::size_type m_nextRedline;
public:
SwASC_RedlineIter(SwASCWriter const& rWriter, SwTextNode const& rNode)
: m_rNode(rNode)
, m_rIDRA(rNode.GetDoc()->getIDocumentRedlineAccess())
, m_nextRedline(rWriter.m_bHideDeleteRedlines
? m_rIDRA.GetRedlinePos(m_rNode, RedlineType::Delete)
: SwRedlineTable::npos)
{
}
bool CheckNodeDeleted()
{
if (m_nextRedline == SwRedlineTable::npos)
{
return false;
}
SwRangeRedline const*const pRedline(m_rIDRA.GetRedlineTable()[m_nextRedline]);
return pRedline->Start()->nNode.GetIndex() < m_rNode.GetIndex()
&& m_rNode.GetIndex() < pRedline->End()->nNode.GetIndex();
}
std::pair<sal_Int32, sal_Int32> GetNextRedlineSkip()
{
sal_Int32 nRedlineStart(COMPLETE_STRING);
sal_Int32 nRedlineEnd(COMPLETE_STRING);
for ( ; m_nextRedline < m_rIDRA.GetRedlineTable().size(); ++m_nextRedline)
{
SwRangeRedline const*const pRedline(m_rIDRA.GetRedlineTable()[m_nextRedline]);
if (pRedline->GetType() != RedlineType::Delete)
{
continue;
}
SwPosition const*const pStart(pRedline->Start());
SwPosition const*const pEnd(pRedline->End());
if (m_rNode.GetIndex() < pStart->nNode.GetIndex())
{
m_nextRedline = SwRedlineTable::npos;
break; // done
}
if (nRedlineStart == COMPLETE_STRING)
{
nRedlineStart = pStart->nNode.GetIndex() == m_rNode.GetIndex()
? pStart->nContent.GetIndex()
: 0;
}
else
{
if (pStart->nContent.GetIndex() != nRedlineEnd)
{
assert(nRedlineEnd < pStart->nContent.GetIndex());
break; // no increment, revisit it next call
}
}
nRedlineEnd = pEnd->nNode.GetIndex() == m_rNode.GetIndex()
? pEnd->nContent.GetIndex()
: COMPLETE_STRING;
}
return std::make_pair(nRedlineStart, nRedlineEnd);
}
};
}
// Output of the node
static Writer& OutASC_SwTextNode( Writer& rWrt, SwContentNode& rNode )<--- Parameter 'rNode' can be declared with const
{
const SwTextNode& rNd = static_cast<SwTextNode&>(rNode);
sal_Int32 nStrPos = rWrt.m_pCurrentPam->GetPoint()->nContent.GetIndex();
const sal_Int32 nNodeEnd = rNd.Len();
sal_Int32 nEnd = nNodeEnd;
bool bLastNd = rWrt.m_pCurrentPam->GetPoint()->nNode == rWrt.m_pCurrentPam->GetMark()->nNode;
if( bLastNd )
nEnd = rWrt.m_pCurrentPam->GetMark()->nContent.GetIndex();
bool bIsOneParagraph = rWrt.m_pOrigPam->Start()->nNode == rWrt.m_pOrigPam->End()->nNode;
SwASC_AttrIter aAttrIter( static_cast<SwASCWriter&>(rWrt), rNd, nStrPos );
SwASC_RedlineIter redlineIter(static_cast<SwASCWriter&>(rWrt), rNd);
if (redlineIter.CheckNodeDeleted())
{
return rWrt;
}
const SwNumRule* pNumRule = rNd.GetNumRule();
if (pNumRule && !nStrPos && rWrt.m_bExportPargraphNumbering && !bIsOneParagraph)
{
bool bIsOutlineNumRule = pNumRule == rNd.GetDoc()->GetOutlineNumRule();
// indent each numbering level by 4 spaces
OUString level;
if (!bIsOutlineNumRule)
{
for (int i = 0; i <= rNd.GetActualListLevel(); ++i)
level += " ";
}
// set up bullets or numbering
OUString numString(rNd.GetNumString());
if (numString.isEmpty() && !bIsOutlineNumRule)
{
if (rNd.HasBullet() && !rNd.HasVisibleNumberingOrBullet())
numString = " ";
else if (rNd.HasBullet())
numString = OUString(numfunc::GetBulletChar(rNd.GetActualListLevel()));
else if (!rNd.HasBullet() && !rNd.HasVisibleNumberingOrBullet())
numString = " ";
}
if (!level.isEmpty() || !numString.isEmpty())
rWrt.Strm().WriteUnicodeOrByteText(level + numString + " ");
}
OUString aStr( rNd.GetText() );
if( rWrt.m_bASCII_ParaAsBlank )
aStr = aStr.replace(0x0A, ' ');
const bool bExportSoftHyphens = RTL_TEXTENCODING_UCS2 == rWrt.GetAsciiOptions().GetCharSet() ||
RTL_TEXTENCODING_UTF8 == rWrt.GetAsciiOptions().GetCharSet();
std::pair<sal_Int32, sal_Int32> curRedline(redlineIter.GetNextRedlineSkip());
for (;;) {
const sal_Int32 nNextAttr = std::min(aAttrIter.WhereNext(), nEnd);
bool isOutAttr(false);
if (nStrPos < curRedline.first || curRedline.second <= nStrPos)
{
isOutAttr = aAttrIter.OutAttr(nStrPos);
}
if (!isOutAttr)
{
OUStringBuffer buf;
while (true)
{
if (nNextAttr <= curRedline.first)
{
buf.append(aStr.copy(nStrPos, nNextAttr - nStrPos));
break;
}
else if (nStrPos < curRedline.second)
{
if (nStrPos < curRedline.first)
{
buf.append(aStr.copy(nStrPos, curRedline.first - nStrPos));
}
if (curRedline.second <= nNextAttr)
{
nStrPos = curRedline.second;
curRedline = redlineIter.GetNextRedlineSkip();
}
else
{
nStrPos = nNextAttr;
break;
}
}
else
{
curRedline = redlineIter.GetNextRedlineSkip();
}
}
OUString aOutStr(buf.makeStringAndClear());
if ( !bExportSoftHyphens )
aOutStr = aOutStr.replaceAll(OUStringChar(CHAR_SOFTHYPHEN), "");
// all INWORD/BREAKWORD should be already removed by OutAttr
// but the field-marks are not attributes so filter those
static sal_Unicode const forbidden [] = {
CH_TXT_ATR_INPUTFIELDSTART,
CH_TXT_ATR_INPUTFIELDEND,
CH_TXT_ATR_FORMELEMENT,
CH_TXT_ATR_FIELDSTART,
CH_TXT_ATR_FIELDSEP,
CH_TXT_ATR_FIELDEND,
0
};
aOutStr = comphelper::string::removeAny(aOutStr, forbidden);
rWrt.Strm().WriteUnicodeOrByteText( aOutStr );
}
nStrPos = nNextAttr;
if (nStrPos >= nEnd)
{
break;
}
aAttrIter.NextPos();
}
if( !bLastNd ||
( ( !rWrt.m_bWriteClipboardDoc && !rWrt.m_bASCII_NoLastLineEnd )
&& !nStrPos && nEnd == nNodeEnd ) )
rWrt.Strm().WriteUnicodeOrByteText( static_cast<SwASCWriter&>(rWrt).GetLineEnd());
return rWrt;
}
/*
* Create the table for the ASCII function pointers to the output
* function.
* There are local structures that only need to be known to the ASCII DLL.
*/
SwNodeFnTab aASCNodeFnTab = {
/* RES_TXTNODE */ OutASC_SwTextNode,
/* RES_GRFNODE */ nullptr,
/* RES_OLENODE */ nullptr
};
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|