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
|
/* -*- 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 <com/sun/star/style/NumberingType.hpp>
#include <hintids.hxx>
#include <svtools/htmltokn.h>
#include <svtools/htmlkywd.hxx>
#include <svtools/htmlout.hxx>
#include <svl/urihelper.hxx>
#include <editeng/brushitem.hxx>
#include <editeng/lrspitem.hxx>
#include <vcl/svapp.hxx>
#include <vcl/wrkwin.hxx>
#include <numrule.hxx>
#include <doc.hxx>
#include <docary.hxx>
#include <poolfmt.hxx>
#include <ndtxt.hxx>
#include <paratr.hxx>
#include "htmlnum.hxx"
#include "wrthtml.hxx"
#include <SwNodeNum.hxx>
#include <rtl/strbuf.hxx>
using namespace css;
void SwHTMLWriter::FillNextNumInfo()
{
pNextNumRuleInfo = 0;
sal_uLong nPos = pCurPam->GetPoint()->nNode.GetIndex() + 1;
bool bTable = false;
do
{
const SwNode* pNd = pDoc->GetNodes()[nPos];
if( pNd->IsTxtNode() )
{
// Der naechste wird als naechstes ausgegeben.
pNextNumRuleInfo = new SwHTMLNumRuleInfo( *pNd->GetTxtNode() );
// Vor einer Tabelle behalten wir erst einmal die alte Ebene bei,
// wenn die gleiche Numerierung hinter der Tabelle
// fortgesetzt wird und dort nicht von vorne numeriert
// wird. Die Tabelle wird ann beim Import so weit eingeruckt,
// wie es der Num-Ebene entspricht.
if( bTable &&
pNextNumRuleInfo->GetNumRule()==GetNumInfo().GetNumRule() &&
!pNextNumRuleInfo->IsRestart() )
{
pNextNumRuleInfo->SetDepth( GetNumInfo().GetDepth() );
}
}
else if( pNd->IsTableNode() )
{
// Eine Tabelle wird uebersprungen, also den Node
// hinter der Tabelle betrachten.
nPos = pNd->EndOfSectionIndex() + 1;
bTable = true;
}
else
{
// In allen anderen Faellen ist die Numerierung erstmal
// zu Ende.
pNextNumRuleInfo = new SwHTMLNumRuleInfo;
}
}
while( !pNextNumRuleInfo );
}
void SwHTMLWriter::ClearNextNumInfo()
{
delete pNextNumRuleInfo;
pNextNumRuleInfo = 0;
}
Writer& OutHTML_NumBulListStart( SwHTMLWriter& rWrt,
const SwHTMLNumRuleInfo& rInfo )
{
SwHTMLNumRuleInfo& rPrevInfo = rWrt.GetNumInfo();
bool bSameRule = rPrevInfo.GetNumRule() == rInfo.GetNumRule();
if( bSameRule && rPrevInfo.GetDepth() >= rInfo.GetDepth() &&
!rInfo.IsRestart() )
{
return rWrt;
}
bool bStartValue = false;
if( !bSameRule && rInfo.GetDepth() )
{
OUString aName( rInfo.GetNumRule()->GetName() );
if( 0 != rWrt.aNumRuleNames.count( aName ) )
{
// The rule has been applied before
sal_Int16 eType = rInfo.GetNumRule()
->Get( rInfo.GetDepth()-1 ).GetNumberingType();
if( SVX_NUM_CHAR_SPECIAL != eType && SVX_NUM_BITMAP != eType )
{
// If it's a numbering rule, the current number should be
// exported as start value, but only if there are no nodes
// within the numbering that have a lower level
bStartValue = true;
if( rInfo.GetDepth() > 1 )
{
sal_uLong nPos =
rWrt.pCurPam->GetPoint()->nNode.GetIndex() + 1;
do
{
const SwNode* pNd = rWrt.pDoc->GetNodes()[nPos];
if( pNd->IsTxtNode() )
{
const SwTxtNode *pTxtNd = pNd->GetTxtNode();
if( !pTxtNd->GetNumRule() )
{
// node isn't numbered => check completed
break;
}
OSL_ENSURE(! pTxtNd->IsOutline(),
"outline not expected");
if( pTxtNd->GetActualListLevel() + 1 <
rInfo.GetDepth() )
{
// node is numbered, but level is lower
// => check completed
bStartValue = false;
break;
}
nPos++;
}
else if( pNd->IsTableNode() )
{
// skip table
nPos = pNd->EndOfSectionIndex() + 1;
}
else
{
// end node or sections start node -> check
// completed
break;
}
}
while( true );
}
}
}
else
{
rWrt.aNumRuleNames.insert( aName );
}
}
OSL_ENSURE( rWrt.nLastParaToken == 0,
"<PRE> wurde nicht vor <OL> beendet." );
sal_uInt16 nPrevDepth =
(bSameRule && !rInfo.IsRestart()) ? rPrevInfo.GetDepth() : 0;
for( sal_uInt16 i=nPrevDepth; i<rInfo.GetDepth(); i++ )
{
rWrt.OutNewLine(); // <OL>/<UL> in eine neue Zeile
rWrt.aBulletGrfs[i] = "";
OStringBuffer sOut;
sOut.append('<');
const SwNumFmt& rNumFmt = rInfo.GetNumRule()->Get( i );
sal_Int16 eType = rNumFmt.GetNumberingType();
if( SVX_NUM_CHAR_SPECIAL == eType )
{
// Aufzaehlungs-Liste: <OL>
sOut.append(OOO_STRING_SVTOOLS_HTML_unorderlist);
// den Typ ueber das Bullet-Zeichen bestimmen
const sal_Char *pStr = 0;
switch( rNumFmt.GetBulletChar() )
{
case HTML_BULLETCHAR_DISC:
pStr = OOO_STRING_SVTOOLS_HTML_ULTYPE_disc;
break;
case HTML_BULLETCHAR_CIRCLE:
pStr = OOO_STRING_SVTOOLS_HTML_ULTYPE_circle;
break;
case HTML_BULLETCHAR_SQUARE:
pStr = OOO_STRING_SVTOOLS_HTML_ULTYPE_square;
break;
}
if( pStr )
{
sOut.append(' ').append(OOO_STRING_SVTOOLS_HTML_O_type).
append("=\"").append(pStr).append("\"");
}
}
else if( SVX_NUM_BITMAP == eType )
{
// Unordered list: <UL>
sOut.append(OOO_STRING_SVTOOLS_HTML_unorderlist);
rWrt.Strm().WriteCharPtr( sOut.makeStringAndClear().getStr() );
OutHTML_BulletImage( rWrt,
0,
rNumFmt.GetBrush() );
}
else
{
// Ordered list: <OL>
sOut.append(OOO_STRING_SVTOOLS_HTML_orderlist);
// den Typ ueber das Format bestimmen
sal_Char cType = 0;
switch( eType )
{
case SVX_NUM_CHARS_UPPER_LETTER: cType = 'A'; break;
case SVX_NUM_CHARS_LOWER_LETTER: cType = 'a'; break;
case SVX_NUM_ROMAN_UPPER: cType = 'I'; break;
case SVX_NUM_ROMAN_LOWER: cType = 'i'; break;
}
if( cType )
{
sOut.append(' ').append(OOO_STRING_SVTOOLS_HTML_O_type).
append("=\"").append(cType).append("\"");
}
sal_uInt16 nStartVal = rNumFmt.GetStart();
if( bStartValue && 1 == nStartVal && i == rInfo.GetDepth()-1 )
{
// #i51089 - TUNING#
if ( rWrt.pCurPam->GetNode()->GetTxtNode()->GetNum() )
{
nStartVal = static_cast< sal_uInt16 >( rWrt.pCurPam->GetNode()
->GetTxtNode()->GetNumberVector()[i] );
}
else
{
OSL_FAIL( "<OutHTML_NumBulListStart(..) - text node has no number." );
}
}
if( nStartVal != 1 )
{
sOut.append(' ').append(OOO_STRING_SVTOOLS_HTML_O_start).
append("=\"").append(static_cast<sal_Int32>(nStartVal)).append("\"");
}
}
if (!sOut.isEmpty())
rWrt.Strm().WriteCharPtr( sOut.makeStringAndClear().getStr() );
if( rWrt.bCfgOutStyles )
OutCSS1_NumBulListStyleOpt( rWrt, *rInfo.GetNumRule(), (sal_uInt8)i );
rWrt.Strm().WriteChar( '>' );
rWrt.IncIndentLevel(); // Inhalt von <OL> einruecken
}
return rWrt;
}
Writer& OutHTML_NumBulListEnd( SwHTMLWriter& rWrt,
const SwHTMLNumRuleInfo& rNextInfo )
{
SwHTMLNumRuleInfo& rInfo = rWrt.GetNumInfo();
bool bSameRule = rNextInfo.GetNumRule() == rInfo.GetNumRule();
if( bSameRule && rNextInfo.GetDepth() >= rInfo.GetDepth() &&
!rNextInfo.IsRestart() )
{
return rWrt;
}
OSL_ENSURE( rWrt.nLastParaToken == 0,
"<PRE> wurde nicht vor </OL> beendet." );
sal_uInt16 nNextDepth =
(bSameRule && !rNextInfo.IsRestart()) ? rNextInfo.GetDepth() : 0;
// MIB 23.7.97: Die Schleife muss doch rueckwaerts durchlaufen
// werden, weil die Reihenfolge von </OL>/</UL> stimmen muss
for( sal_uInt16 i=rInfo.GetDepth(); i>nNextDepth; i-- )
{
rWrt.DecIndentLevel(); // Inhalt von <OL> einruecken
if( rWrt.bLFPossible )
rWrt.OutNewLine(); // </OL>/</UL> in eine neue Zeile
// es wird also eine Liste angefangen oder beendet:
sal_Int16 eType = rInfo.GetNumRule()->Get( i-1 ).GetNumberingType();
const sal_Char *pStr;
if( SVX_NUM_CHAR_SPECIAL == eType || SVX_NUM_BITMAP == eType)
pStr = OOO_STRING_SVTOOLS_HTML_unorderlist;
else
pStr = OOO_STRING_SVTOOLS_HTML_orderlist;
HTMLOutFuncs::Out_AsciiTag( rWrt.Strm(), pStr, false );
rWrt.bLFPossible = true;
}
return rWrt;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
