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
|
/* -*- 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 <tools/debug.hxx>
#include <o3tl/sorted_vector.hxx>
#include <com/sun/star/ucb/XAnyCompareFactory.hpp>
#include <com/sun/star/container/XNamed.hpp>
#include <com/sun/star/container/XIndexReplace.hpp>
#include <rtl/ustrbuf.hxx>
#include <xmloff/xmlnume.hxx>
#include <xmloff/XMLTextListAutoStylePool.hxx>
#include <xmloff/xmlexp.hxx>
using namespace ::com::sun::star;
using namespace ::com::sun::star::uno;
using namespace ::com::sun::star::beans;
using namespace ::com::sun::star::container;
using namespace ::com::sun::star::style;
class XMLTextListAutoStylePoolEntry_Impl
{
OUString sName;
OUString sInternalName;
Reference < XIndexReplace > xNumRules;
sal_uInt32 nPos;
bool bIsNamed;
public:
XMLTextListAutoStylePoolEntry_Impl(
sal_uInt32 nPos,
const Reference < XIndexReplace > & rNumRules,
XMLTextListAutoStylePoolNames_Impl& rNames,
const OUString& rPrefix,
sal_uInt32& rName );
XMLTextListAutoStylePoolEntry_Impl(
const Reference < XIndexReplace > & rNumRules ) :
xNumRules( rNumRules ),
nPos( 0 ),
bIsNamed( false )
{
Reference < XNamed > xNamed( xNumRules, UNO_QUERY );
if( xNamed.is() )
{
sInternalName = xNamed->getName();
bIsNamed = true;
}
}
XMLTextListAutoStylePoolEntry_Impl(
const OUString& rInternalName ) :
sInternalName( rInternalName ),
nPos( 0 ),
bIsNamed( true )
{
}
const OUString& GetName() const { return sName; }
const OUString& GetInternalName() const { return sInternalName; }
const Reference < XIndexReplace > & GetNumRules() const { return xNumRules; }
sal_uInt32 GetPos() const { return nPos; }
bool IsNamed() const { return bIsNamed; }
};
XMLTextListAutoStylePoolEntry_Impl::XMLTextListAutoStylePoolEntry_Impl(
sal_uInt32 nP,
const Reference < XIndexReplace > & rNumRules,
XMLTextListAutoStylePoolNames_Impl& rNames,
const OUString& rPrefix,
sal_uInt32& rName ) :
xNumRules( rNumRules ),
nPos( nP ),
bIsNamed( false )
{
Reference < XNamed > xNamed( xNumRules, UNO_QUERY );
if( xNamed.is() )
{
sInternalName = xNamed->getName();
bIsNamed = true;
}
// create a name that hasn't been used before. The created name has not
// to be added to the array, because it will never tried again
OUStringBuffer sBuffer( 7 );
do
{
rName++;
sBuffer.append( rPrefix );
sBuffer.append( (sal_Int32)rName );
sName = sBuffer.makeStringAndClear();
}
while (rNames.find(sName) != rNames.end());
}
struct XMLTextListAutoStylePoolEntryCmp_Impl
{
bool operator()(
XMLTextListAutoStylePoolEntry_Impl* const& r1,
XMLTextListAutoStylePoolEntry_Impl* const& r2 ) const
{
if( r1->IsNamed() )
{
if( r2->IsNamed() )
return r1->GetInternalName().compareTo( r2->GetInternalName() ) < 0;
else
return true;
}
else
{
if( r2->IsNamed() )
return false;
else
return r1->GetNumRules().get() < r2->GetNumRules().get();
}
}
};
class XMLTextListAutoStylePool_Impl : public o3tl::sorted_vector<XMLTextListAutoStylePoolEntry_Impl*, XMLTextListAutoStylePoolEntryCmp_Impl> {};
XMLTextListAutoStylePool::XMLTextListAutoStylePool( SvXMLExport& rExp ) :
rExport( rExp ),
sPrefix( "L" ),
pPool( new XMLTextListAutoStylePool_Impl ),
nName( 0 )
{
Reference<ucb::XAnyCompareFactory> xCompareFac( rExp.GetModel(), uno::UNO_QUERY );
if( xCompareFac.is() )
mxNumRuleCompare = xCompareFac->createAnyCompareByName( OUString( "NumberingRules" ) );
sal_uInt16 nExportFlags = rExport.getExportFlags();
bool bStylesOnly = (nExportFlags & EXPORT_STYLES) != 0 && (nExportFlags & EXPORT_CONTENT) == 0;
if( bStylesOnly )
sPrefix = "ML";
}
XMLTextListAutoStylePool::~XMLTextListAutoStylePool()
{
// The XMLTextListAutoStylePoolEntry_Impl object in the pool need delete explicitly in dtor.
pPool->DeleteAndDestroyAll();
delete pPool;
}
void XMLTextListAutoStylePool::RegisterName( const OUString& rName )
{
m_aNames.insert(rName);
}
sal_uInt32 XMLTextListAutoStylePool::Find( XMLTextListAutoStylePoolEntry_Impl* pEntry ) const
{
if( !pEntry->IsNamed() && mxNumRuleCompare.is() )
{
const sal_uInt32 nCount = pPool->size();
uno::Any aAny1, aAny2;
aAny1 <<= pEntry->GetNumRules();
for( sal_uLong nPos = 0; nPos < nCount; nPos++ )
{
aAny2 <<= (*pPool)[nPos]->GetNumRules();
if( mxNumRuleCompare->compare( aAny1, aAny2 ) == 0 )
return nPos;
}
}
else
{
XMLTextListAutoStylePool_Impl::const_iterator it = pPool->find( pEntry );
if( it != pPool->end() )
return it - pPool->begin();
}
return (sal_uInt32)-1;
}
OUString XMLTextListAutoStylePool::Add(
const Reference < XIndexReplace > & rNumRules )
{
OUString sName;
XMLTextListAutoStylePoolEntry_Impl aTmp( rNumRules );
sal_uInt32 nPos = Find( &aTmp );
if( nPos != (sal_uInt32)-1 )
{
sName = (*pPool)[ nPos ]->GetName();
}
else
{
XMLTextListAutoStylePoolEntry_Impl *pEntry =
new XMLTextListAutoStylePoolEntry_Impl( pPool->size(),
rNumRules, m_aNames, sPrefix,
nName );
pPool->insert( pEntry );
sName = pEntry->GetName();
}
return sName;
}
OUString XMLTextListAutoStylePool::Find(
const Reference < XIndexReplace > & rNumRules ) const
{
OUString sName;
XMLTextListAutoStylePoolEntry_Impl aTmp( rNumRules );
sal_uInt32 nPos = Find( &aTmp );
if( nPos != (sal_uInt32)-1 )
sName = (*pPool)[ nPos ]->GetName();
return sName;
}
OUString XMLTextListAutoStylePool::Find(
const OUString& rInternalName ) const
{
OUString sName;
XMLTextListAutoStylePoolEntry_Impl aTmp( rInternalName );
sal_uInt32 nPos = Find( &aTmp );
if( nPos != (sal_uInt32)-1 )
sName = (*pPool)[ nPos ]->GetName();
return sName;
}
void XMLTextListAutoStylePool::exportXML() const
{
sal_uInt32 nCount = pPool->size();
if( !nCount )
return;
XMLTextListAutoStylePoolEntry_Impl **aExpEntries =
new XMLTextListAutoStylePoolEntry_Impl*[nCount];
sal_uInt32 i;
for( i=0; i < nCount; i++ )
{
aExpEntries[i] = 0;
}
for( i=0; i < nCount; i++ )
{
XMLTextListAutoStylePoolEntry_Impl *pEntry = (*pPool)[i];
DBG_ASSERT( pEntry->GetPos() < nCount, "Illegal pos" );
aExpEntries[pEntry->GetPos()] = pEntry;
}
SvxXMLNumRuleExport aNumRuleExp( rExport );
for( i=0; i < nCount; i++ )
{
XMLTextListAutoStylePoolEntry_Impl *pEntry = aExpEntries[i];
aNumRuleExp.exportNumberingRule( pEntry->GetName(), false,
pEntry->GetNumRules() );
}
delete [] aExpEntries;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
