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
|
/* -*- 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 <algorithm>
#include <iterator>
#ifndef INCLUDED_DOCTOK_EXCEPTIONS
#include <resourcemodel/exceptions.hxx>
#endif
#include <WW8PieceTableImpl.hxx>
#include <WW8Clx.hxx>
namespace writerfilter {
namespace doctok
{
using namespace ::std;
ostream & operator << (ostream & o, const WW8PieceTable & rPieceTable)
{
rPieceTable.dump(o);
return o;
}
WW8PieceTableImpl::WW8PieceTableImpl(WW8Stream & rStream,
sal_uInt32 nOffset,
sal_uInt32 nCount)
{
WW8Clx aClx(rStream, nOffset, nCount);
sal_uInt32 nPieceCount = aClx.getPieceCount();
if (nPieceCount > 0)
{
for (sal_uInt32 n = 0; n < nPieceCount; n++)
{
Cp aCp(aClx.getCp(n));
Fc aFc(aClx.getFc(n), aClx.isComplexFc(n));
CpAndFc aCpAndFc(aCp, aFc, PROP_DOC);
mEntries.push_back(aCpAndFc);
}
CpAndFc aBack = mEntries.back();
Cp aCp(aClx.getCp(aClx.getPieceCount()));
Fc aFc(aBack.getFc() + (aCp - aBack.getCp()));
CpAndFc aCpAndFc(aCp, aFc, PROP_DOC);
mEntries.push_back(aCpAndFc);
}
}
sal_uInt32 WW8PieceTableImpl::getCount() const
{
return mEntries.size();
}
WW8PieceTableImpl::tEntries::const_iterator
WW8PieceTableImpl::findCp(const Cp & rCp) const
{
tEntries::const_iterator aResult = mEntries.end();
tEntries::const_iterator aEnd = mEntries.end();
for (tEntries::const_iterator aIt = mEntries.begin(); aIt != aEnd;
++aIt)
{
if (aIt->getCp() <= rCp)
{
aResult = aIt;
//break;
}
}
return aResult;
}
WW8PieceTableImpl::tEntries::const_iterator
WW8PieceTableImpl::findFc(const Fc & rFc) const
{
tEntries::const_iterator aResult = mEntries.end();
tEntries::const_iterator aEnd = mEntries.end();
if (mEntries.size() > 0)
{
if (rFc < mEntries.begin()->getFc())
aResult = mEntries.begin();
else
{
for (tEntries::const_iterator aIt = mEntries.begin();
aIt != aEnd; ++aIt)
{
if (aIt->getFc() <= rFc)
{
tEntries::const_iterator aItNext = aIt;
++aItNext;
if (aItNext != aEnd)
{
sal_uInt32 nOffset = rFc.get() - aIt->getFc().get();
sal_uInt32 nLength = aItNext->getCp() - aIt->getCp();
if (! aIt->isComplex())
nLength *= 2;
if (nOffset < nLength)
{
aResult = aIt;
break;
}
}
}
}
}
}
return aResult;
}
Cp WW8PieceTableImpl::getFirstCp() const
{
Cp aResult;
if (getCount() > 0)
aResult = getCp(0);
else
throw ExceptionNotFound("WW8PieceTableImpl::getFirstCp");
return aResult;
}
Fc WW8PieceTableImpl::getFirstFc() const
{
Fc aResult;
if (getCount() > 0)
aResult = getFc(0);
else
throw ExceptionNotFound(" WW8PieceTableImpl::getFirstFc");
return aResult;
}
Cp WW8PieceTableImpl::getLastCp() const
{
Cp aResult;
if (getCount() > 0)
aResult = getCp(getCount() - 1);
else
throw ExceptionNotFound("WW8PieceTableImpl::getLastCp");
return aResult;
}
Fc WW8PieceTableImpl::getLastFc() const
{
Fc aResult;
if (getCount() > 0)
aResult = getFc(getCount() - 1);
else
throw ExceptionNotFound("WW8PieceTableImpl::getLastFc");
return aResult;
}
Cp WW8PieceTableImpl::getCp(sal_uInt32 nIndex) const
{
return mEntries[nIndex].getCp();
}
Fc WW8PieceTableImpl::getFc(sal_uInt32 nIndex) const
{
return mEntries[nIndex].getFc();
}
Cp WW8PieceTableImpl::fc2cp(const Fc & rFc) const
{
Cp cpResult;
if (mEntries.size() > 0)
{
Fc aFc;
if (rFc < mEntries.begin()->getFc())
aFc = mEntries.begin()->getFc();
else
aFc = rFc;
tEntries::const_iterator aIt = findFc(aFc);
if (aIt != mEntries.end())
{
cpResult = aIt->getCp() + (aFc - aIt->getFc());
}
else
throw ExceptionNotFound("WW8PieceTableImpl::fc2cp: " + aFc.toString());
}
return cpResult;
}
Fc WW8PieceTableImpl::cp2fc(const Cp & rCp) const
{
Fc aResult;
Cp2FcHashMap_t::iterator aItCp = mCp2FcCache.find(rCp);
if (aItCp == mCp2FcCache.end())
{
tEntries::const_iterator aIt = findCp(rCp);
if (aIt != mEntries.end())
{
aResult = aIt->getFc() + (rCp - aIt->getCp());
mCp2FcCache[rCp] = aResult;
}
else
throw ExceptionNotFound
("WW8PieceTableImpl::cp2fc: " + rCp.toString());
}
else
aResult = mCp2FcCache[rCp];
return aResult;
}
bool WW8PieceTableImpl::isComplex(const Cp & rCp) const
{
bool bResult = false;
tEntries::const_iterator aIt = findCp(rCp);
if (aIt != mEntries.end())
bResult = aIt->isComplex();
return bResult;
}
bool WW8PieceTableImpl::isComplex(const Fc & rFc) const
{
bool bResult = false;
tEntries::const_iterator aIt = findFc(rFc);
if (aIt != mEntries.end())
bResult = aIt->isComplex();
return bResult;
}
CpAndFc WW8PieceTableImpl::createCpAndFc
(const Cp & rCp, PropertyType eType) const
{
return CpAndFc(rCp, cp2fc(rCp), eType);
}
CpAndFc WW8PieceTableImpl::createCpAndFc
(const Fc & rFc, PropertyType eType) const
{
return CpAndFc(fc2cp(rFc), rFc, eType);
}
void WW8PieceTableImpl::dump(ostream & o) const
{
o << "<piecetable>" << endl;
copy(mEntries.begin(), mEntries.end(), ostream_iterator<CpAndFc>(o, "\n"));
o << "</piecetable>" << endl;
}
}}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
