blob: 5f91dd8c601a4dca52a74b572179cad6d1f20f80 (
plain)
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
|
/* -*- 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/.
*/
#include <columnset.hxx>
#include <algorithm>
namespace sc {
void ColumnSet::set(SCTAB nTab, SCCOL nCol)
{
TabsType::iterator itTab = maTabs.find(nTab);
if (itTab == maTabs.end())
{
std::pair<TabsType::iterator,bool> r =
maTabs.emplace(nTab, ColsType());
if (!r.second)
// insertion failed.
return;
itTab = r.first;
}
ColsType& rCols = itTab->second;
rCols.insert(nCol);
}
void ColumnSet::getColumns(SCTAB nTab, std::vector<SCCOL>& rCols) const
{
std::vector<SCCOL> aCols;
TabsType::const_iterator itTab = maTabs.find(nTab);
if (itTab == maTabs.end())
{
rCols.swap(aCols); // empty it.
return;
}
const ColsType& rTabCols = itTab->second;
aCols.assign(rTabCols.begin(), rTabCols.end());
// Sort and remove duplicates.
std::sort(aCols.begin(), aCols.end());
std::vector<SCCOL>::iterator itCol = std::unique(aCols.begin(), aCols.end());
aCols.erase(itCol, aCols.end());
rCols.swap(aCols);
}
bool ColumnSet::hasTab(SCTAB nTab) const
{
return maTabs.find(nTab) != maTabs.end();
}
bool ColumnSet::empty() const
{
return maTabs.empty();
}
}
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
