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
|
/* -*- 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 "markmulti.hxx"
#include "markarr.hxx"
#include "segmenttree.hxx"
#include <algorithm>
ScMultiSel::ScMultiSel():
aMultiSelContainer(),
aRowSel()
{
}
ScMultiSel::ScMultiSel( const ScMultiSel& rMultiSel )
{
MapType::iterator aDestEnd = aMultiSelContainer.end();
MapType::iterator aDestIter = aDestEnd;
for ( const auto& aSourcePair : rMultiSel.aMultiSelContainer )
{
// correct hint is always aDestEnd as keys come in ascending order
// Amortized constant time operation as we always give the correct hint
aDestIter = aMultiSelContainer.emplace_hint( aDestEnd, aSourcePair.first, ScMarkArray() );
aSourcePair.second.CopyMarksTo( aDestIter->second );
}
rMultiSel.aRowSel.CopyMarksTo( aRowSel );
}
ScMultiSel::~ScMultiSel()
{
}
ScMultiSel& ScMultiSel::operator=(const ScMultiSel& rMultiSel)
{
Clear();
MapType::iterator aDestEnd = aMultiSelContainer.end();
MapType::iterator aDestIter = aDestEnd;
for ( const auto& aSourcePair : rMultiSel.aMultiSelContainer )
{
// correct hint is always aDestEnd as keys come in ascending order
// Amortized constant time operation as we always give the correct hint
aDestIter = aMultiSelContainer.emplace_hint( aDestEnd, aSourcePair.first, ScMarkArray() );
aSourcePair.second.CopyMarksTo( aDestIter->second );
}
rMultiSel.aRowSel.CopyMarksTo( aRowSel );
return *this;
}
void ScMultiSel::Clear()
{
aMultiSelContainer.clear();
aRowSel.Reset();
}
bool ScMultiSel::HasMarks( SCCOL nCol ) const
{
if ( aRowSel.HasMarks() )
return true;
MapType::const_iterator aIter = aMultiSelContainer.find( nCol );
if ( aIter == aMultiSelContainer.end() )
return false;
return aIter->second.HasMarks();
}
bool ScMultiSel::HasOneMark( SCCOL nCol, SCROW& rStartRow, SCROW& rEndRow ) const
{
bool aResult1 = false, aResult2 = false;
SCROW nRow1 = -1, nRow2 = -1, nRow3 = -1, nRow4 = -1;
aResult1 = aRowSel.HasOneMark( nRow1, nRow2 );
MapType::const_iterator aIter = aMultiSelContainer.find( nCol );
if ( aIter != aMultiSelContainer.end() )
aResult2 = aIter->second.HasOneMark( nRow3, nRow4 );
if ( aResult1 || aResult2 )
{
if ( aResult1 && aResult2 )
{
if ( ( nRow2 + 1 ) < nRow3 )
return false;
if ( ( nRow4 + 1 ) < nRow1 )
return false;
auto aRows = std::minmax( { nRow1, nRow2, nRow3, nRow4 } );
rStartRow = aRows.first;
rEndRow = aRows.second;
return true;
}
if ( aResult1 )
{
rStartRow = nRow1;
rEndRow = nRow2;
return true;
}
rStartRow = nRow3;
rEndRow = nRow4;
return true;
}
return false;
}
bool ScMultiSel::GetMark( SCCOL nCol, SCROW nRow ) const
{
if ( aRowSel.GetMark( nRow ) )
return true;
MapType::const_iterator aIter = aMultiSelContainer.find( nCol );
if ( aIter != aMultiSelContainer.end() )
return aIter->second.GetMark( nRow );
return false;
}
bool ScMultiSel::IsAllMarked( SCCOL nCol, SCROW nStartRow, SCROW nEndRow ) const
{
bool bHasMarks1 = aRowSel.HasMarks();
MapType::const_iterator aIter = aMultiSelContainer.find( nCol );
bool bHasMarks2 = ( aIter != aMultiSelContainer.end() && aIter->second.HasMarks() );
if ( !bHasMarks1 && !bHasMarks2 )
return false;
if ( bHasMarks1 && bHasMarks2 )
{
if ( aRowSel.IsAllMarked( nStartRow, nEndRow ) ||
aIter->second.IsAllMarked( nStartRow, nEndRow ) )
return true;
ScMultiSelIter aMultiIter( *this, nCol );
ScFlatBoolRowSegments::RangeData aRowRange;
bool bRet = aMultiIter.GetRowSegments().getRangeData( nStartRow, aRowRange );
return bRet && aRowRange.mbValue && aRowRange.mnRow2 >= nEndRow;
}
if ( bHasMarks1 )
return aRowSel.IsAllMarked( nStartRow, nEndRow );
return aIter->second.IsAllMarked( nStartRow, nEndRow );
}
bool ScMultiSel::HasEqualRowsMarked( SCCOL nCol1, SCCOL nCol2 ) const
{
MapType::const_iterator aIter1 = aMultiSelContainer.find( nCol1 );
MapType::const_iterator aIter2 = aMultiSelContainer.find( nCol2 );
MapType::const_iterator aEnd = aMultiSelContainer.end();
bool bCol1Exists = ( aIter1 != aEnd );
bool bCol2Exists = ( aIter2 != aEnd );
if ( bCol1Exists || bCol2Exists )
{
if ( bCol1Exists && bCol2Exists )
return aIter1->second.HasEqualRowsMarked( aIter2->second );
else if ( bCol1Exists )
return !aIter1->second.HasMarks();
else
return !aIter2->second.HasMarks();
}
return true;
}
SCsROW ScMultiSel::GetNextMarked( SCCOL nCol, SCsROW nRow, bool bUp ) const
{
MapType::const_iterator aIter = aMultiSelContainer.find( nCol );
if ( aIter == aMultiSelContainer.end() )
return aRowSel.GetNextMarked( nRow, bUp );
SCsROW nRow1, nRow2;
nRow1 = aRowSel.GetNextMarked( nRow, bUp );
nRow2 = aIter->second.GetNextMarked( nRow, bUp );
if ( nRow1 == nRow2 )
return nRow1;
if ( nRow1 == -1 )
return nRow2;
if ( nRow2 == -1 )
return nRow1;
PutInOrder( nRow1, nRow2 );
return ( bUp ? nRow2 : nRow1 );
}
void ScMultiSel::MarkAllCols( SCROW nStartRow, SCROW nEndRow )
{
MapType::iterator aIter = aMultiSelContainer.end();
for ( SCCOL nCol = MAXCOL; nCol >= 0; --nCol )
{
aIter = aMultiSelContainer.emplace_hint( aIter, nCol, ScMarkArray() );
aIter->second.SetMarkArea( nStartRow, nEndRow, true );
}
}
void ScMultiSel::SetMarkArea( SCCOL nStartCol, SCCOL nEndCol, SCROW nStartRow, SCROW nEndRow, bool bMark )
{
if ( nStartCol == 0 && nEndCol == MAXCOL )
{
aRowSel.SetMarkArea( nStartRow, nEndRow, bMark );
if ( !bMark )
{
// Remove any per column marks for the row range.
for ( auto& aIter : aMultiSelContainer )
if ( aIter.second.HasMarks() )
aIter.second.SetMarkArea( nStartRow, nEndRow, false );
}
return;
}
// Bad case - we need to extend aMultiSelContainer size to MAXCOL
// and move row marks from aRowSel to aMultiSelContainer
if ( !bMark && aRowSel.HasMarks() )
{
SCROW nBeg, nLast = nEndRow;
if ( aRowSel.GetMark( nStartRow ) )
{
nBeg = nStartRow;
nLast = aRowSel.GetMarkEnd( nStartRow, false );
}
else
{
nBeg = aRowSel.GetNextMarked( nStartRow, false );
if ( nBeg != MAXROWCOUNT )
nLast = aRowSel.GetMarkEnd( nBeg, false );
}
if ( nBeg != MAXROWCOUNT && nLast >= nEndRow )
MarkAllCols( nBeg, nEndRow );
else
{
while ( nBeg != MAXROWCOUNT && nLast < nEndRow )
{
MarkAllCols( nBeg, nLast );
nBeg = aRowSel.GetNextMarked( nLast + 1, false );
if ( nBeg != MAXROWCOUNT )
nLast = aRowSel.GetMarkEnd( nBeg, false );
}
if ( nBeg != MAXROWCOUNT && nLast >= nEndRow )
MarkAllCols( nBeg, nEndRow );
}
aRowSel.SetMarkArea( nStartRow, nEndRow, false );
}
MapType::iterator aIter = aMultiSelContainer.end();
for ( SCCOL nColIter = nEndCol; nColIter >= nStartCol; --nColIter )
{
// First hint is usually off, so the first emplace operation will take up to
// logarithmic in map size, all other iterations will take only constant time.
aIter = aMultiSelContainer.emplace_hint( aIter, nColIter, ScMarkArray() );
aIter->second.SetMarkArea( nStartRow, nEndRow, bMark );
}
}
bool ScMultiSel::IsRowMarked( SCROW nRow ) const
{
return aRowSel.GetMark( nRow );
}
bool ScMultiSel::IsRowRangeMarked( SCROW nStartRow, SCROW nEndRow ) const
{
if ( !aRowSel.GetMark( nStartRow ) )
return false;
SCROW nLast = aRowSel.GetMarkEnd( nStartRow, false );
return ( nLast >= nEndRow );
}
ScMarkArray ScMultiSel::GetMarkArray( SCCOL nCol ) const
{
ScMultiSelIter aMultiIter( *this, nCol );
ScMarkArray aMarkArray;
SCROW nTop, nBottom;
while( aMultiIter.Next( nTop, nBottom ) )
aMarkArray.SetMarkArea( nTop, nBottom, true );
return aMarkArray;
}
bool ScMultiSel::HasAnyMarks() const
{
if ( aRowSel.HasMarks() )
return true;
for ( const auto& aPair : aMultiSelContainer )
if ( aPair.second.HasMarks() )
return true;
return false;
}
ScMultiSelIter::ScMultiSelIter( const ScMultiSel& rMultiSel, SCCOL nCol ) :
aRowSegs(),
nNextSegmentStart(0)
{
aRowSegs.setFalse( 0, MAXROW );
bool bHasMarks1 = rMultiSel.aRowSel.HasMarks();
ScMultiSel::MapType::const_iterator aIter = rMultiSel.aMultiSelContainer.find( nCol );
bool bHasMarks2 = ( ( aIter != rMultiSel.aMultiSelContainer.end() ) && aIter->second.HasMarks() );
if ( bHasMarks1 )
{
ScMarkArrayIter aMarkIter( &rMultiSel.aRowSel );
SCROW nTop, nBottom;
while ( aMarkIter.Next( nTop, nBottom ) )
aRowSegs.setTrue( nTop, nBottom );
}
if ( bHasMarks2 )
{
ScMarkArrayIter aMarkIter( &aIter->second );
SCROW nTop, nBottom;
while ( aMarkIter.Next( nTop, nBottom ) )
aRowSegs.setTrue( nTop, nBottom );
}
}
ScMultiSelIter::~ScMultiSelIter()
{
}
bool ScMultiSelIter::Next( SCROW& rTop, SCROW& rBottom )
{
ScFlatBoolRowSegments::RangeData aRowRange;
bool bRet = aRowSegs.getRangeData( nNextSegmentStart, aRowRange );
if ( bRet && !aRowRange.mbValue )
{
nNextSegmentStart = aRowRange.mnRow2 + 1;
bRet = aRowSegs.getRangeData( nNextSegmentStart, aRowRange );
}
if ( bRet )
{
rTop = aRowRange.mnRow1;
rBottom = aRowRange.mnRow2;
nNextSegmentStart = rBottom + 1;
}
return bRet;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
