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
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
|
/* -*- 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/.
*/
#ifndef INCLUDED_SC_INC_MTVFUNCTIONS_HXX
#define INCLUDED_SC_INC_MTVFUNCTIONS_HXX
#include <cstdlib>
#include <mdds/multi_type_vector_types.hpp>
namespace sc {
template<typename SizeT, typename Ret = bool>
struct FuncElseNoOp
{
Ret operator() (mdds::mtv::element_t, SizeT, SizeT) const
{
return Ret();
}
};
/**
* Generic algorithm to parse blocks of multi_type_vector either partially
* or fully.
*/
template<typename StoreT, typename Func>
typename StoreT::const_iterator
ParseBlock(
const typename StoreT::const_iterator& itPos, const StoreT& rStore, Func& rFunc,
typename StoreT::size_type nStart, typename StoreT::size_type nEnd)
{
typedef std::pair<typename StoreT::const_iterator, typename StoreT::size_type> PositionType;
PositionType aPos = rStore.position(itPos, nStart);
typename StoreT::const_iterator it = aPos.first;
typename StoreT::size_type nOffset = aPos.second;
typename StoreT::size_type nDataSize = 0;
typename StoreT::size_type nTopRow = nStart;
for (; it != rStore.end() && nTopRow <= nEnd; ++it, nOffset = 0, nTopRow += nDataSize)
{
bool bLastBlock = false;
nDataSize = it->size - nOffset;
if (nTopRow + nDataSize - 1 > nEnd)
{
// Truncate the block.
nDataSize = nEnd - nTopRow + 1;
bLastBlock = true;
}
rFunc(*it, nOffset, nDataSize);
if (bLastBlock)
break;
}
return it;
}
/**
* Non-const variant of the above function. TODO: Find a way to merge these
* two in an elegant way.
*/
template<typename StoreT, typename Func>
typename StoreT::iterator
ProcessBlock(const typename StoreT::iterator& itPos, StoreT& rStore, Func& rFunc, typename StoreT::size_type nStart, typename StoreT::size_type nEnd)
{
typedef std::pair<typename StoreT::iterator, typename StoreT::size_type> PositionType;
PositionType aPos = rStore.position(itPos, nStart);
typename StoreT::iterator it = aPos.first;
typename StoreT::size_type nOffset = aPos.second;
typename StoreT::size_type nDataSize = 0;
typename StoreT::size_type nCurRow = nStart;
for (; it != rStore.end() && nCurRow <= nEnd; ++it, nOffset = 0, nCurRow += nDataSize)
{
bool bLastBlock = false;
nDataSize = it->size - nOffset;
if (nCurRow + nDataSize - 1 > nEnd)
{
// Truncate the block.
nDataSize = nEnd - nCurRow + 1;
bLastBlock = true;
}
rFunc(*it, nOffset, nDataSize);
if (bLastBlock)
break;
}
return it;
}
template<typename BlkT, typename ItrT, typename NodeT, typename FuncElem>
void EachElem(NodeT& rNode, size_t nOffset, size_t nDataSize, FuncElem& rFuncElem)
{
ItrT it = BlkT::begin(*rNode.data);
std::advance(it, nOffset);
ItrT itEnd = it;
std::advance(itEnd, nDataSize);
size_t nRow = rNode.position + nOffset;
for (; it != itEnd; ++it, ++nRow)
rFuncElem(nRow, *it);
}
template<typename BlkT, typename ItrT, typename NodeT, typename FuncElem>
void EachElem(NodeT& rNode, FuncElem& rFuncElem)
{
ItrT it = BlkT::begin(*rNode.data);
ItrT itEnd = BlkT::end(*rNode.data);
size_t nRow = rNode.position;
for (; it != itEnd; ++it, ++nRow)
rFuncElem(nRow, *it);
}
template<typename BlkT, typename StoreT, typename FuncElem>
std::pair<typename StoreT::const_iterator, size_t>
CheckElem(
const StoreT& rStore, const typename StoreT::const_iterator& it, size_t nOffset, size_t nDataSize,
FuncElem& rFuncElem)
{
typedef std::pair<typename StoreT::const_iterator, size_t> PositionType;
typename BlkT::const_iterator itData = BlkT::begin(*it->data);
std::advance(itData, nOffset);
typename BlkT::const_iterator itDataEnd = itData;
std::advance(itDataEnd, nDataSize);
size_t nTopRow = it->position + nOffset;
size_t nRow = nTopRow;
for (; itData != itDataEnd; ++itData, ++nRow)
{
if (rFuncElem(nRow, *itData))
return PositionType(it, nRow - it->position);
}
return PositionType(rStore.end(), 0);
}
template<typename StoreT, typename BlkT, typename FuncElem, typename FuncElse>
void ParseElements1(const StoreT& rStore, FuncElem& rFuncElem, FuncElse& rFuncElse)
{
typename StoreT::size_type nTopRow = 0, nDataSize = 0;
typename StoreT::const_iterator it = rStore.begin(), itEnd = rStore.end();
for (; it != itEnd; ++it, nTopRow += nDataSize)
{
nDataSize = it->size;
if (it->type != BlkT::block_type)
{
rFuncElse(it->type, nTopRow, nDataSize);
continue;
}
EachElem<BlkT, typename BlkT::const_iterator>(*it, rFuncElem);
}
}
template<typename StoreT, typename BlkT, typename FuncElem, typename FuncElse>
typename StoreT::const_iterator
ParseElements1(
const typename StoreT::const_iterator& itPos, const StoreT& rStore,
typename StoreT::size_type nStart, typename StoreT::size_type nEnd,
FuncElem& rFuncElem, FuncElse& rFuncElse)
{
typedef std::pair<typename StoreT::const_iterator, typename StoreT::size_type> PositionType;
PositionType aPos = rStore.position(itPos, nStart);
typename StoreT::const_iterator it = aPos.first;
typename StoreT::size_type nOffset = aPos.second;
typename StoreT::size_type nDataSize = 0;
typename StoreT::size_type nTopRow = nStart;
for (; it != rStore.end() && nTopRow <= nEnd; ++it, nOffset = 0, nTopRow += nDataSize)
{
bool bLastBlock = false;
nDataSize = it->size - nOffset;
if (nTopRow + nDataSize - 1 > nEnd)
{
// Truncate the block.
nDataSize = nEnd - nTopRow + 1;
bLastBlock = true;
}
if (it->type == BlkT::block_type)
EachElem<BlkT, typename BlkT::const_iterator>(*it, nOffset, nDataSize, rFuncElem);
else
rFuncElse(it->type, nTopRow, nDataSize);
if (bLastBlock)
break;
}
return it;
};
template<typename StoreT, typename Blk1, typename Blk2, typename FuncElem, typename FuncElse>
typename StoreT::const_iterator
ParseElements2(
const typename StoreT::const_iterator& itPos, const StoreT& rStore, typename StoreT::size_type nStart, typename StoreT::size_type nEnd,
FuncElem& rFuncElem, FuncElse& rFuncElse)
{
typedef std::pair<typename StoreT::const_iterator, typename StoreT::size_type> PositionType;
PositionType aPos = rStore.position(itPos, nStart);
typename StoreT::const_iterator it = aPos.first;
typename StoreT::size_type nOffset = aPos.second;
typename StoreT::size_type nDataSize = 0;
typename StoreT::size_type nTopRow = nStart;
for (; it != rStore.end() && nTopRow <= nEnd; ++it, nOffset = 0, nTopRow += nDataSize)
{
bool bLastBlock = false;
nDataSize = it->size - nOffset;
if (nTopRow + nDataSize - 1 > nEnd)
{
// Truncate the block.
nDataSize = nEnd - nTopRow + 1;
bLastBlock = true;
}
switch (it->type)
{
case Blk1::block_type:
EachElem<Blk1, typename Blk1::const_iterator>(*it, nOffset, nDataSize, rFuncElem);
break;
case Blk2::block_type:
EachElem<Blk2, typename Blk2::const_iterator>(*it, nOffset, nDataSize, rFuncElem);
break;
default:
rFuncElse(it->type, nTopRow, nDataSize);
}
if (bLastBlock)
break;
}
return it;
}
template<typename StoreT, typename Blk1, typename Blk2, typename Blk3, typename Blk4, typename FuncElem, typename FuncElse>
typename StoreT::const_iterator
ParseElements4(
const typename StoreT::const_iterator& itPos, const StoreT& rStore, typename StoreT::size_type nStart, typename StoreT::size_type nEnd,
FuncElem& rFuncElem, FuncElse& rFuncElse)
{
typedef std::pair<typename StoreT::const_iterator, typename StoreT::size_type> PositionType;
PositionType aPos = rStore.position(itPos, nStart);
typename StoreT::const_iterator it = aPos.first;
typename StoreT::size_type nOffset = aPos.second;
typename StoreT::size_type nDataSize = 0;
typename StoreT::size_type nTopRow = nStart;
for (; it != rStore.end() && nTopRow <= nEnd; ++it, nOffset = 0, nTopRow += nDataSize)
{
bool bLastBlock = false;
nDataSize = it->size - nOffset;
if (nTopRow + nDataSize - 1 > nEnd)
{
// Truncate the block.
nDataSize = nEnd - nTopRow + 1;
bLastBlock = true;
}
switch (it->type)
{
case Blk1::block_type:
EachElem<Blk1, typename Blk1::const_iterator>(*it, nOffset, nDataSize, rFuncElem);
break;
case Blk2::block_type:
EachElem<Blk2, typename Blk2::const_iterator>(*it, nOffset, nDataSize, rFuncElem);
break;
case Blk3::block_type:
EachElem<Blk3, typename Blk3::const_iterator>(*it, nOffset, nDataSize, rFuncElem);
break;
case Blk4::block_type:
EachElem<Blk4, typename Blk4::const_iterator>(*it, nOffset, nDataSize, rFuncElem);
break;
default:
rFuncElse(it->type, nTopRow, nDataSize);
}
if (bLastBlock)
break;
}
return it;
}
template<typename StoreT, typename BlkT, typename FuncElem, typename FuncElse>
void ProcessElements1(StoreT& rStore, FuncElem& rFuncElem, FuncElse& rFuncElse)
{
typename StoreT::size_type nTopRow = 0, nDataSize = 0;
typename StoreT::iterator it = rStore.begin(), itEnd = rStore.end();
for (; it != itEnd; ++it, nTopRow += nDataSize)
{
nDataSize = it->size;
if (it->type != BlkT::block_type)
{
rFuncElse(it->type, nTopRow, nDataSize);
continue;
}
EachElem<BlkT, typename BlkT::iterator>(*it, rFuncElem);
}
}
/**
* This variant specifies start and end positions.
*/
template<typename StoreT, typename BlkT, typename FuncElem, typename FuncElse>
typename StoreT::iterator
ProcessElements1(
const typename StoreT::iterator& itPos, StoreT& rStore,
typename StoreT::size_type nStart, typename StoreT::size_type nEnd,
FuncElem& rFuncElem, FuncElse& rFuncElse)
{
typedef std::pair<typename StoreT::iterator, typename StoreT::size_type> PositionType;
PositionType aPos = rStore.position(itPos, nStart);
typename StoreT::iterator it = aPos.first;
typename StoreT::size_type nOffset = aPos.second;
typename StoreT::size_type nDataSize = 0;
typename StoreT::size_type nTopRow = nStart;
for (; it != rStore.end() && nTopRow <= nEnd; ++it, nOffset = 0, nTopRow += nDataSize)
{
bool bLastBlock = false;
nDataSize = it->size - nOffset;
if (nTopRow + nDataSize - 1 > nEnd)
{
// Truncate the block.
nDataSize = nEnd - nTopRow + 1;
bLastBlock = true;
}
if (it->type == BlkT::block_type)
EachElem<BlkT, typename BlkT::iterator>(*it, nOffset, nDataSize, rFuncElem);
else
rFuncElse(it->type, nTopRow, nDataSize);
if (bLastBlock)
break;
}
return it;
};
template<typename StoreT, typename Blk1, typename Blk2, typename FuncElem, typename FuncElse>
void ProcessElements2(StoreT& rStore, FuncElem& rFuncElem, FuncElse& rFuncElse)
{
typename StoreT::size_type nTopRow = 0, nDataSize = 0;
typename StoreT::iterator it = rStore.begin(), itEnd = rStore.end();
for (; it != itEnd; ++it, nTopRow += nDataSize)
{
nDataSize = it->size;
switch (it->type)
{
case Blk1::block_type:
EachElem<Blk1, typename Blk1::iterator>(*it, rFuncElem);
break;
case Blk2::block_type:
EachElem<Blk2, typename Blk2::iterator>(*it, rFuncElem);
break;
default:
rFuncElse(it->type, nTopRow, nDataSize);
}
}
}
template<typename StoreT, typename Blk1, typename FuncElem, typename FuncElse>
std::pair<typename StoreT::const_iterator, typename StoreT::size_type>
FindElement1(
const StoreT& rStore, typename StoreT::size_type nStart, typename StoreT::size_type nEnd,
FuncElem& rFuncElem, FuncElse& rFuncElse)
{
typedef std::pair<typename StoreT::const_iterator, typename StoreT::size_type> PositionType;
typedef std::pair<typename StoreT::size_type, bool> ElseRetType;
PositionType aPos = rStore.position(nStart);
typename StoreT::const_iterator it = aPos.first;
typename StoreT::size_type nOffset = aPos.second;
typename StoreT::size_type nDataSize = 0;
typename StoreT::size_type nTopRow = nStart;
for (; it != rStore.end() && nTopRow <= nEnd; ++it, nOffset = 0, nTopRow += nDataSize)
{
bool bLastBlock = false;
nDataSize = it->size - nOffset;
if (nTopRow + nDataSize - 1 > nEnd)
{
// Truncate the block.
nDataSize = nEnd - nTopRow + 1;
bLastBlock = true;
}
switch (it->type)
{
case Blk1::block_type:
{
PositionType aRet = CheckElem<Blk1>(rStore, it, nOffset, nDataSize, rFuncElem);
if (aRet.first != rStore.end())
return aRet;
}
break;
default:
{
ElseRetType aRet = rFuncElse(it->type, nTopRow, nDataSize);
if (aRet.second)
return PositionType(it, aRet.first);
}
}
if (bLastBlock)
break;
}
return PositionType(rStore.end(), 0);
}
template<typename StoreT, typename Blk1, typename Blk2, typename FuncElem, typename FuncElse>
std::pair<typename StoreT::const_iterator, typename StoreT::size_type>
FindElement2(
const StoreT& rStore, typename StoreT::size_type nStart, typename StoreT::size_type nEnd,
FuncElem& rFuncElem, FuncElse& rFuncElse)
{
typedef std::pair<typename StoreT::const_iterator, typename StoreT::size_type> PositionType;
typedef std::pair<typename StoreT::size_type, bool> ElseRetType;
PositionType aPos = rStore.position(nStart);
typename StoreT::const_iterator it = aPos.first;
typename StoreT::size_type nOffset = aPos.second;
typename StoreT::size_type nDataSize = 0;
typename StoreT::size_type nTopRow = nStart;
for (; it != rStore.end() && nTopRow <= nEnd; ++it, nOffset = 0, nTopRow += nDataSize)
{
bool bLastBlock = false;
nDataSize = it->size - nOffset;
if (nTopRow + nDataSize - 1 > nEnd)
{
// Truncate the block.
nDataSize = nEnd - nTopRow + 1;
bLastBlock = true;
}
switch (it->type)
{
case Blk1::block_type:
{
PositionType aRet = CheckElem<Blk1>(rStore, it, nOffset, nDataSize, rFuncElem);
if (aRet.first != rStore.end())
return aRet;
}
break;
case Blk2::block_type:
{
PositionType aRet = CheckElem<Blk2>(rStore, it, nOffset, nDataSize, rFuncElem);
if (aRet.first != rStore.end())
return aRet;
}
break;
default:
{
ElseRetType aRet = rFuncElse(*it, nOffset, nDataSize);
if (aRet.second)
return PositionType(it, aRet.first);
}
}
if (bLastBlock)
break;
}
return PositionType(rStore.end(), 0);
}
}
#endif
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
