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
|
#include "FileEntry.h"
#include <algorithm>
#include <iterator>
#include <mutex>
#include <shared_mutex>
#include <utility>
namespace TESData
{
FileEntry::FileEntry(TESFileHandle handle, const std::string& name)
: m_Handle{handle}, m_Name{name}, m_Root{std::make_shared<TreeItem>()}
{}
void FileEntry::forEachRecord(
std::function<void(const std::shared_ptr<const Record>&)> func) const
{
std::vector<std::shared_ptr<TreeItem>> stack;
stack.push_back(m_Root);
while (!stack.empty()) {
const auto item = std::move(stack.back());
stack.pop_back();
if (item->record) {
func(item->record);
}
for (const auto& [identifier, child] : item->children) {
stack.push_back(child);
}
}
}
std::shared_ptr<Record> FileEntry::createRecord(const RecordPath& path,
const std::string& name,
TESFile::Type formType)
{
const auto item = createHierarchy(path);
std::unique_lock lk{m_Mutex};
if (!item->record) {
item->record = std::make_shared<Record>();
lk.unlock();
item->record->setIdentifier(path.identifier(), path.files());
item->record->addAlternative(m_Handle);
item->name = name;
item->formType = formType;
}
return item->record;
}
void FileEntry::addRecord(const RecordPath& path, const std::string& name,
TESFile::Type formType, std::shared_ptr<Record> record)
{
record->addAlternative(m_Handle);
const auto item = createHierarchy(path);
item->record = record;
item->name = name;
item->formType = formType;
}
void FileEntry::addChildGroup(const RecordPath& path)
{
const auto item = findItem(path);
if (!item || !item->record) {
// no record to add children to
return;
}
TESFile::GroupData group = path.groups().back();
if (group.hasParent()) {
const auto& file = path.files()[group.parent() >> 24];
const std::uint8_t newIndex = static_cast<std::uint8_t>(
std::distance(std::begin(m_Files), TESFile::find(m_Files, file)));
if (newIndex == m_Files.size()) {
m_Files.push_back(file);
}
group.setLocalIndex(newIndex);
}
item->group = group;
}
std::shared_ptr<Record> FileEntry::findRecord(const RecordPath& path) const
{
const auto item = findItem(path);
return item ? item->record : nullptr;
}
std::shared_ptr<FileEntry::TreeItem> FileEntry::findItem(const RecordPath& path) const
{
std::shared_lock lk{m_Mutex};
const auto groups = path.groups();
auto item = m_Root;
for (TESFile::GroupData group : groups) {
if (group.hasParent()) {
const auto& file = path.files()[group.parent() >> 24];
const std::uint8_t newIndex = static_cast<std::uint8_t>(
std::distance(std::begin(m_Files), TESFile::find(m_Files, file)));
if (newIndex == m_Files.size()) {
return nullptr;
}
group.setLocalIndex(newIndex);
}
if (group.hasDirectParent() &&
(!item->record || item->record->formId() != group.parent())) {
if (const auto it = item->children.find(group.parent());
it != item->children.end()) {
item = it->second;
} else {
return nullptr;
}
} else {
if (const auto it = item->children.find(group); it != item->children.end()) {
item = it->second;
} else {
return nullptr;
}
}
}
TreeItem::Key key;
if (path.hasFormId()) {
const auto& file = path.files()[path.formId() >> 24];
const std::uint8_t newIndex = static_cast<std::uint8_t>(
std::distance(std::begin(m_Files), TESFile::find(m_Files, file)));
if (newIndex == m_Files.size()) {
return nullptr;
}
const std::uint32_t formId = (path.formId() & 0xFFFFFFU) | (newIndex << 24U);
key = formId;
} else if (path.hasEditorId()) {
key = path.editorId();
} else if (path.hasTypeId()) {
key = path.typeId();
} else {
return item;
}
const auto it = item->children.find(key);
return it != item->children.end() ? it->second : nullptr;
}
std::shared_ptr<FileEntry::TreeItem> FileEntry::createHierarchy(const RecordPath& path)
{
std::unique_lock lk{m_Mutex};
const auto groups = path.groups();
auto item = m_Root;
for (TESFile::GroupData group : groups) {
if (group.hasParent()) {
const auto& file = path.files()[group.parent() >> 24];
const std::uint8_t newIndex = static_cast<std::uint8_t>(
std::distance(std::begin(m_Files), TESFile::find(m_Files, file)));
if (newIndex == m_Files.size()) {
m_Files.push_back(file);
}
group.setLocalIndex(newIndex);
}
if (group.hasDirectParent() &&
(!item->record || item->record->formId() != group.parent())) {
auto& nextItem = item->children[group.parent()];
if (!nextItem) {
nextItem = std::make_shared<TreeItem>();
nextItem->parent = item.get();
nextItem->record = std::make_shared<Record>();
nextItem->record->setIdentifier(group.parent(), m_Files);
}
nextItem->group = group;
item = nextItem;
} else {
auto& nextItem = item->children[group];
if (!nextItem) {
nextItem = std::make_shared<TreeItem>();
nextItem->parent = item.get();
nextItem->group = group;
}
item = nextItem;
}
}
TreeItem::Key key;
if (path.hasFormId()) {
const auto& file = path.files()[path.formId() >> 24];
const std::uint8_t newIndex = static_cast<std::uint8_t>(
std::distance(std::begin(m_Files), TESFile::find(m_Files, file)));
if (newIndex == m_Files.size()) {
m_Files.push_back(file);
}
const std::uint32_t formId = (path.formId() & 0xFFFFFFU) | (newIndex << 24U);
key = formId;
} else if (path.hasEditorId()) {
key = path.editorId();
} else if (path.hasTypeId()) {
key = path.typeId();
} else {
return item;
}
auto& recordItem = item->children[key];
if (!recordItem) {
recordItem = std::make_shared<TreeItem>();
recordItem->parent = item.get();
}
return recordItem;
}
} // namespace TESData
|
