blob: c11697ca7b5f58ffa6a13fdf05f2e96a6af674c9 (
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
92
93
94
95
96
97
98
99
100
|
#include "AssociatedEntry.h"
#include <mutex>
#include <shared_mutex>
#include <vector>
namespace TESData
{
AuxItem::AuxItem(const std::string& name, const AuxItem* parent)
: m_Name{name}, m_Parent{parent}
{}
std::shared_ptr<AuxItem> AuxItem::getByIndex(int index) const
{
std::shared_lock lk{m_Mutex};
if (index < 0 || index >= m_Children.size()) {
return nullptr;
}
return m_Children.nth(index)->second;
}
std::shared_ptr<AuxItem> AuxItem::getByName(const std::string& name) const
{
std::shared_lock lk{m_Mutex};
const auto it = m_Children.find(name);
if (it == m_Children.end()) {
return nullptr;
}
return it->second;
}
int AuxItem::indexOf(const AuxItem* item) const
{
std::shared_lock lk{m_Mutex};
const auto it = std::ranges::find(m_Children, item, [&](auto&& pair) {
return pair.second.get();
});
return static_cast<int>(m_Children.index_of(it));
}
std::shared_ptr<AuxItem> AuxItem::insert(const std::string& name)
{
std::unique_lock lk{m_Mutex};
const auto [it, inserted] =
m_Children.try_emplace(name, std::make_shared<AuxItem>(name, this));
return it->second;
}
std::shared_ptr<AuxMember> AuxItem::createMember(const std::string& path)
{
std::unique_lock lk{m_Mutex};
auto& item = m_Member;
if (item != nullptr) {
return item;
}
item = std::make_shared<AuxMember>();
item->path = path;
return item;
}
void AuxItem::setMember(std::shared_ptr<AuxMember> item)
{
m_Member = item;
}
AssociatedEntry::AssociatedEntry(const std::string& rootName)
: m_Root{std::make_shared<AuxItem>(rootName)}
{}
void AssociatedEntry::forEachMember(
std::function<void(const std::shared_ptr<const AuxMember>&)> func) const
{
std::vector<std::shared_ptr<AuxItem>> stack{m_Root};
while (!stack.empty()) {
const auto item = std::move(stack.back());
stack.pop_back();
if (const auto member = item->member()) {
func(member);
}
for (int i = 0; i < item->numChildren(); ++i) {
const auto child = item->getByIndex(i);
stack.push_back(child);
}
}
}
} // namespace TESData
|
