blob: 5f913bc47daea90674472529efcfff8108190c79 (
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
/* -*- 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 .
*/
#pragma once
#include "scdllapi.h"
#include <rtl/ustring.hxx>
#include <vector>
/**
* Stores individual user-defined sort list.
*/
class SC_DLLPUBLIC ScUserListData final
{
private:
struct SAL_DLLPRIVATE SubStr
{
OUString maReal;
OUString maUpper;
SubStr(OUString&& aReal);
};
std::vector<SubStr> maSubStrings;
OUString aStr;
SAL_DLLPRIVATE void InitTokens();
public:
ScUserListData(OUString aStr);
const OUString& GetString() const { return aStr; }
void SetString(const OUString& rStr);
size_t GetSubCount() const { return maSubStrings.size(); }
bool GetSubIndex(const OUString& rSubStr, sal_uInt16& rIndex, bool& bMatchCase) const;
OUString GetSubStr(sal_uInt16 nIndex) const;
sal_Int32 Compare(const OUString& rSubStr1, const OUString& rSubStr2) const;
sal_Int32 ICompare(const OUString& rSubStr1, const OUString& rSubStr2) const;
};
/**
* Collection of user-defined sort lists.
*/
class SC_DLLPUBLIC ScUserList
{
typedef std::vector<ScUserListData> DataType;
DataType maData;
public:
explicit ScUserList(bool initDefault = true);
ScUserList(const ScUserList& r) = default;
void AddDefaults();
void EraseData(size_t nIndex) { maData.erase(maData.cbegin() + nIndex); }
const ScUserListData* GetData(const OUString& rSubStr) const;
/// If the list in rStr is already inserted
bool HasEntry(std::u16string_view rStr) const;
const ScUserListData& operator[](size_t nIndex) const { return maData[nIndex]; }
ScUserListData& operator[](size_t nIndex) { return maData[nIndex]; }
ScUserList& operator=(const ScUserList& r) = default;
bool operator==(const ScUserList& r) const;
bool operator!=(const ScUserList& r) const { return !operator==(r); }
void clear() { maData.clear(); }
size_t size() const { return maData.size(); }
template <class... Args> void emplace_back(Args&&... args)
{
maData.emplace_back(std::forward<Args>(args)...);
}
};
/* vim:set shiftwidth=4 softtabstop=4 expandtab: */
|
