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 | /* -*- 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 <sal/config.h>
#include <algorithm>
#include <simplerangelist.hxx>
#include <rangelst.hxx>
using ::std::list;
using ::std::pair;
using ::std::max;
ScSimpleRangeList::Range::Range(SCCOL nCol1, SCROW nRow1, SCCOL nCol2, SCROW nRow2) :
mnRow1(nRow1), mnRow2(nRow2), mnCol1(nCol1), mnCol2(nCol2) {}
ScSimpleRangeList::ScSimpleRangeList()
{
}
namespace {
bool maybeJoin(ScSimpleRangeList::Range& rOld, SCCOL nCol1, SCROW nRow1, SCCOL nCol2, SCROW nRow2)
{
if (rOld.mnRow1 == nRow1 && rOld.mnRow2 == nRow2)
{
// Check their column spans to see if they overlap.
if (rOld.mnCol1 == nCol1)
{
// Their share the start column position.
rOld.mnCol2 = max(rOld.mnCol2, nCol2);
return true;
}
else if (rOld.mnCol1 < nCol1)
{
// Old range sits on the left.
if (nCol1 - rOld.mnCol2 <= 1)
{
rOld.mnCol2 = max(rOld.mnCol2, nCol2);
return true;
}
}
else if (nCol1 < rOld.mnCol1)
{
// New range sits on the left.
if (nCol1 - rOld.mnCol2 <= 1)
{
rOld.mnCol1 = nCol1;
rOld.mnCol2 = max(rOld.mnCol2, nCol2);
return true;
}
}
}
if (rOld.mnCol1 == nCol1 && rOld.mnCol2 == nCol2)
{
if (rOld.mnRow1 == nRow1)
{
// Their share the start row position.
rOld.mnRow2 = max(rOld.mnRow2, nRow2);
return true;
}
else if (rOld.mnRow1 < nRow1)
{
// Old range sits above.
if (nRow1 - rOld.mnRow2 <= 1)
{
rOld.mnRow2 = max(rOld.mnRow2, nRow2);
return true;
}
}
else if (nRow1 < rOld.mnRow1)
{
// New range sits above.
if (nRow1 - rOld.mnRow2 <= 1)
{
rOld.mnRow1 = nRow1;
rOld.mnRow2 = max(rOld.mnRow2, nRow2);
return true;
}
}
}
return false;
}
}
void ScSimpleRangeList::addRange(const ScRange& rRange)
{
SCCOL nCol1 = rRange.aStart.Col();
SCROW nRow1 = rRange.aStart.Row();
SCTAB nTab1 = rRange.aStart.Tab();
SCCOL nCol2 = rRange.aEnd.Col();
SCROW nRow2 = rRange.aEnd.Row();
SCTAB nTab2 = rRange.aEnd.Tab();
for (SCTAB nTab = nTab1; nTab <= nTab2; ++nTab)
{
RangeListRef pRef = findTab(nTab);
if (!pRef)
// This should never happen!
return;
if (pRef->empty() || !maybeJoin(pRef->back(), nCol1, nRow1, nCol2, nRow2))
// Not joinable. Append it to the list.
pRef->push_back(Range(nCol1, nRow1, nCol2, nRow2));
}
}
void ScSimpleRangeList::insertCol(SCCOL nCol, SCTAB nTab)
{
RangeListRef pRef = findTab(nTab);
if (!pRef)
// This should never happen!
return;
for (Range& r : *pRef)
{
if (r.mnCol2 < nCol)
// insertion point to the right of the range.
continue;
if (nCol <= r.mnCol1)
{
// insertion point to the left of the range.
++r.mnCol1;
++r.mnCol2;
}
else if (nCol <= r.mnCol2)
{
// insertion point cuts through the range.
++r.mnCol2;
}
}
}
void ScSimpleRangeList::getRangeList(list<ScRange>& rList) const
{
list<ScRange> aList;
for (const auto& [nTab, pRanges] : maTabs)
{
for (const Range& r : *pRanges)
{
aList.emplace_back(r.mnCol1, r.mnRow1, nTab, r.mnCol2, r.mnRow2, nTab);<--- Consider using std::transform algorithm instead of a raw loop.
}
}
rList.swap(aList);
}
void ScSimpleRangeList::clear()
{
maTabs.clear();
}
ScSimpleRangeList::RangeListRef ScSimpleRangeList::findTab(SCTAB nTab)
{
TabType::iterator itr = maTabs.find(nTab);
if (itr == maTabs.end())
{
RangeListRef p = std::make_shared<list<Range>>();
pair<TabType::iterator, bool> r = maTabs.emplace(nTab, p);
if (!r.second)
return RangeListRef();
itr = r.first;
}
return itr->second;
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|