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
|
#include "DataItem.h"
#include <algorithm>
#include <iterator>
using namespace Qt::Literals::StringLiterals;
namespace TESData
{
QString DataItem::makeName(TESFile::Type signature, const QString& name)
{
const QByteArray sig =
QByteArray(signature.data(), signature.size()).toPercentEncoding("@"_ba);
if (!name.isEmpty()) {
return QStringLiteral("%1 - %2").arg(QString::fromLatin1(sig), name);
} else {
return QString::fromLatin1(sig);
}
}
QVariant DataItem::data(int fileIndex) const
{
if (fileIndex < m_Data.size()) {
return m_Data[fileIndex];
}
return QVariant();
}
QVariant DataItem::displayData(int fileIndex) const
{
if (fileIndex < m_DisplayData.size()) {
const auto& displayData = m_DisplayData[fileIndex];
if (displayData.isValid()) {
return displayData;
}
}
return data(fileIndex);
}
bool DataItem::isLosingConflict(int fileIndex, int fileCount) const
{
if (m_ConflictType == ConflictType::Ignore ||
m_ConflictType == ConflictType::Benign ||
m_ConflictType == ConflictType::BenignIfAdded) {
return false;
}
if (!m_Data.isEmpty()) {
if (fileIndex >= m_Data.length()) {
return false;
} else if (fileCount > m_Data.length() &&
m_ConflictType != ConflictType::NormalIgnoreEmpty) {
return true;
}
for (int i = fileIndex + 1; i < m_Data.length(); ++i) {
if (hasConflict(m_Data[i], m_Data[fileIndex])) {
return true;
}
}
}
for (const auto& child : m_Children) {
if (child->isLosingConflict(fileIndex, fileCount)) {
return true;
}
}
return false;
}
bool DataItem::isOverriding(int fileIndex) const
{
if (m_ConflictType == ConflictType::Ignore) {
return false;
}
if (!m_Data.isEmpty()) {
if (fileIndex >= m_Data.length() &&
m_ConflictType != ConflictType::NormalIgnoreEmpty) {
return m_ConflictType != ConflictType::Benign;
}
for (int i = 0; i < std::min(fileIndex, static_cast<int>(m_Data.length())); ++i) {
if (m_ConflictType == ConflictType::Benign && !m_Data[i].isValid()) {
continue;
}
if (hasConflict(m_Data[i], m_Data[fileIndex])) {
return true;
}
}
}
for (const auto& child : m_Children) {
if (child->isOverriding(fileIndex)) {
return true;
}
}
return false;
}
bool DataItem::isConflicted(int fileCount) const
{
if (m_ConflictType == ConflictType::Ignore) {
return false;
}
if (!m_Data.isEmpty()) {
if (fileCount > m_Data.length() &&
m_ConflictType != ConflictType::NormalIgnoreEmpty) {
return true;
}
for (int i = 1; i < m_Data.length(); ++i) {
if (hasConflict(m_Data[i], m_Data[0])) {
return true;
}
}
}
for (const auto& child : m_Children) {
if (child->isConflicted(fileCount)) {
return true;
}
}
return false;
}
DataItem* DataItem::findChild(TESFile::Type signature) const
{
const auto it = std::ranges::find_if(m_Children, [&](auto&& child) {
return child->signature() == signature;
});
return it != std::end(m_Children) ? it->get() : nullptr;
}
QVariant DataItem::childData(TESFile::Type signature, int fileIndex) const
{
const auto it = std::ranges::find_if(m_Children, [&](auto&& child) {
return child->signature() == signature;
});
if (it == std::end(m_Children)) {
return QVariant();
}
return (*it)->data(fileIndex);
}
QVariant DataItem::childData(const QString& name, int fileIndex) const
{
const auto it = std::ranges::find_if(m_Children, [&](auto&& child) {
return child->name() == name;
});
if (it == std::end(m_Children)) {
return QVariant();
}
return (*it)->data(fileIndex);
}
int DataItem::indexOf(const DataItem* child) const
{
const auto it = std::ranges::find(m_Children, child, &std::shared_ptr<DataItem>::get);
if (it == std::end(m_Children)) {
return -1;
}
return std::distance(std::begin(m_Children), it);
}
DataItem* DataItem::getOrInsertChild(int index, const QString& name,
ConflictType conflictType)
{
if (index < m_Children.size()) {
const auto& child = m_Children[index];
if (child->name() == name) {
return child.get();
}
}
return insertChild(index, name, conflictType);
}
DataItem* DataItem::getOrInsertChild(int index, TESFile::Type signature,
const QString& name, ConflictType conflictType)
{
if (index < m_Children.size()) {
const auto& child = m_Children[index];
if (child->signature() == signature) {
return child.get();
}
}
return insertChild(index, signature, name, conflictType);
}
void DataItem::setData(int fileIndex, const QVariant& data, bool caseSensitive)
{
if (m_Data.size() <= fileIndex) {
m_Data.resize(fileIndex + 1);
}
m_Data[fileIndex] = data;
m_CaseSensitive = caseSensitive;
}
void DataItem::setDisplayData(int fileIndex, const QVariant& data)
{
if (m_DisplayData.size() <= fileIndex) {
m_DisplayData.resize(fileIndex + 1);
}
m_DisplayData[fileIndex] = data;
}
bool DataItem::hasConflict(const QVariant& var1, const QVariant& var2) const
{
if (!m_CaseSensitive && var1.userType() == QMetaType::QString &&
var2.userType() == QMetaType::QString) {
return var1.toString().compare(var2.toString(), Qt::CaseInsensitive) != 0;
} else {
return var1 != var2;
}
}
} // namespace TESData
|
