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
|
/* -*- 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 "markarr.hxx"
#include "global.hxx"
#include "address.hxx"
// STATIC DATA -----------------------------------------------------------
//------------------------------------------------------------------------
ScMarkArray::ScMarkArray() :
nCount( 0 ),
nLimit( 0 ),
pData( NULL )
{
// special case "no marks" with pData = NULL
}
//------------------------------------------------------------------------
ScMarkArray::~ScMarkArray()
{
delete[] pData;
}
//------------------------------------------------------------------------
void ScMarkArray::Reset( sal_Bool bMarked )
{
// always create pData here
// (or have separate method to ensure pData)
delete[] pData;
nCount = nLimit = 1;
pData = new ScMarkEntry[1];
pData[0].nRow = MAXROW;
pData[0].bMarked = bMarked;
}
//------------------------------------------------------------------------
sal_Bool ScMarkArray::Search( SCROW nRow, SCSIZE& nIndex ) const
{
long nHi = static_cast<long>(nCount) - 1;
long i = 0;
sal_Bool bFound = (nCount == 1);
if (pData)
{
long nLo = 0;
long nStartRow = 0;
while ( !bFound && nLo <= nHi )
{
i = (nLo + nHi) / 2;
if (i > 0)
nStartRow = (long) pData[i - 1].nRow;
else
nStartRow = -1;
long nEndRow = (long) pData[i].nRow;
if (nEndRow < (long) nRow)
nLo = ++i;
else
if (nStartRow >= (long) nRow)
nHi = --i;
else
bFound = sal_True;
}
}
else
bFound = false;
if (bFound)
nIndex=(SCSIZE)i;
else
nIndex=0;
return bFound;
}
sal_Bool ScMarkArray::GetMark( SCROW nRow ) const
{
SCSIZE i;
if (Search( nRow, i ))
return pData[i].bMarked;
else
return false;
}
//------------------------------------------------------------------------
void ScMarkArray::SetMarkArea( SCROW nStartRow, SCROW nEndRow, sal_Bool bMarked )
{
if (ValidRow(nStartRow) && ValidRow(nEndRow))
{
if ((nStartRow == 0) && (nEndRow == MAXROW))
{
Reset(bMarked);
}
else
{
if (!pData)
Reset(false); // create pData for further processing - could use special case handling!
SCSIZE nNeeded = nCount + 2;
if ( nLimit < nNeeded )
{
nLimit += SC_MARKARRAY_DELTA;
if ( nLimit < nNeeded )
nLimit = nNeeded;
ScMarkEntry* pNewData = new ScMarkEntry[nLimit];
memcpy( pNewData, pData, nCount*sizeof(ScMarkEntry) );
delete[] pData;
pData = pNewData;
}
SCSIZE ni; // number of entries in beginning
SCSIZE nInsert; // insert position (MAXROW+1 := no insert)
sal_Bool bCombined = false;
sal_Bool bSplit = false;
if ( nStartRow > 0 )
{
// skip beginning
SCSIZE nIndex;
Search( nStartRow, nIndex );
ni = nIndex;
nInsert = MAXROWCOUNT;
if ( pData[ni].bMarked != bMarked )
{
if ( ni == 0 || (pData[ni-1].nRow < nStartRow - 1) )
{ // may be a split or a simple insert or just a shrink,
// row adjustment is done further down
if ( pData[ni].nRow > nEndRow )
bSplit = sal_True;
ni++;
nInsert = ni;
}
else if ( ni > 0 && pData[ni-1].nRow == nStartRow - 1 )
nInsert = ni;
}
if ( ni > 0 && pData[ni-1].bMarked == bMarked )
{ // combine
pData[ni-1].nRow = nEndRow;
nInsert = MAXROWCOUNT;
bCombined = sal_True;
}
}
else
{
nInsert = 0;
ni = 0;
}
SCSIZE nj = ni; // stop position of range to replace
while ( nj < nCount && pData[nj].nRow <= nEndRow )
nj++;
if ( !bSplit )
{
if ( nj < nCount && pData[nj].bMarked == bMarked )
{ // combine
if ( ni > 0 )
{
if ( pData[ni-1].bMarked == bMarked )
{ // adjacent entries
pData[ni-1].nRow = pData[nj].nRow;
nj++;
}
else if ( ni == nInsert )
pData[ni-1].nRow = nStartRow - 1; // shrink
}
nInsert = MAXROWCOUNT;
bCombined = sal_True;
}
else if ( ni > 0 && ni == nInsert )
pData[ni-1].nRow = nStartRow - 1; // shrink
}
if ( ni < nj )
{ // remove middle entries
if ( !bCombined )
{ // replace one entry
pData[ni].nRow = nEndRow;
pData[ni].bMarked = bMarked;
ni++;
nInsert = MAXROWCOUNT;
}
if ( ni < nj )
{ // remove entries
memmove( pData + ni, pData + nj, (nCount - nj) * sizeof(ScMarkEntry) );
nCount -= nj - ni;
}
}
if ( nInsert < sal::static_int_cast<SCSIZE>(MAXROWCOUNT) )
{ // insert or append new entry
if ( nInsert <= nCount )
{
if ( !bSplit )
memmove( pData + nInsert + 1, pData + nInsert,
(nCount - nInsert) * sizeof(ScMarkEntry) );
else
{
memmove( pData + nInsert + 2, pData + nInsert,
(nCount - nInsert) * sizeof(ScMarkEntry) );
pData[nInsert+1] = pData[nInsert-1];
nCount++;
}
}
if ( nInsert )
pData[nInsert-1].nRow = nStartRow - 1;
pData[nInsert].nRow = nEndRow;
pData[nInsert].bMarked = bMarked;
nCount++;
}
}
}
}
sal_Bool ScMarkArray::IsAllMarked( SCROW nStartRow, SCROW nEndRow ) const
{
SCSIZE nStartIndex;
SCSIZE nEndIndex;
if (Search( nStartRow, nStartIndex ))
if (pData[nStartIndex].bMarked)
if (Search( nEndRow, nEndIndex ))
if (nEndIndex==nStartIndex)
return sal_True;
return false;
}
sal_Bool ScMarkArray::HasOneMark( SCROW& rStartRow, SCROW& rEndRow ) const
{
sal_Bool bRet = false;
if ( nCount == 1 )
{
if ( pData[0].bMarked )
{
rStartRow = 0;
rEndRow = MAXROW;
bRet = sal_True;
}
}
else if ( nCount == 2 )
{
if ( pData[0].bMarked )
{
rStartRow = 0;
rEndRow = pData[0].nRow;
}
else
{
rStartRow = pData[0].nRow + 1;
rEndRow = MAXROW;
}
bRet = sal_True;
}
else if ( nCount == 3 )
{
if ( pData[1].bMarked )
{
rStartRow = pData[0].nRow + 1;
rEndRow = pData[1].nRow;
bRet = sal_True;
}
}
return bRet;
}
void ScMarkArray::CopyMarksTo( ScMarkArray& rDestMarkArray ) const
{
delete[] rDestMarkArray.pData;
if (pData)
{
rDestMarkArray.pData = new ScMarkEntry[nCount];
memcpy( rDestMarkArray.pData, pData, nCount * sizeof(ScMarkEntry) );
}
else
rDestMarkArray.pData = NULL;
rDestMarkArray.nCount = rDestMarkArray.nLimit = nCount;
}
SCsROW ScMarkArray::GetNextMarked( SCsROW nRow, sal_Bool bUp ) const
{
if (!pData)
const_cast<ScMarkArray*>(this)->Reset(false); // create pData for further processing
SCsROW nRet = nRow;
if (ValidRow(nRow))
{
SCSIZE nIndex;
Search(nRow, nIndex);
if (!pData[nIndex].bMarked)
{
if (bUp)
{
if (nIndex>0)
nRet = pData[nIndex-1].nRow;
else
nRet = -1;
}
else
nRet = pData[nIndex].nRow + 1;
}
}
return nRet;
}
SCROW ScMarkArray::GetMarkEnd( SCROW nRow, sal_Bool bUp ) const
{
if (!pData)
const_cast<ScMarkArray*>(this)->Reset(false); // create pData for further processing
SCROW nRet;
SCSIZE nIndex;
Search(nRow, nIndex);
OSL_ENSURE( pData[nIndex].bMarked, "GetMarkEnd without bMarked" );
if (bUp)
{
if (nIndex>0)
nRet = pData[nIndex-1].nRow + 1;
else
nRet = 0;
}
else
nRet = pData[nIndex].nRow;
return nRet;
}
//
// -------------- Iterator ----------------------------------------------
//
ScMarkArrayIter::ScMarkArrayIter( const ScMarkArray* pNewArray ) :
pArray( pNewArray ),
nPos( 0 )
{
}
ScMarkArrayIter::~ScMarkArrayIter()
{
}
sal_Bool ScMarkArrayIter::Next( SCROW& rTop, SCROW& rBottom )
{
if ( nPos >= pArray->nCount )
return false;
while (!pArray->pData[nPos].bMarked)
{
++nPos;
if ( nPos >= pArray->nCount )
return false;
}
rBottom = pArray->pData[nPos].nRow;
if (nPos==0)
rTop = 0;
else
rTop = pArray->pData[nPos-1].nRow + 1;
++nPos;
return sal_True;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
