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
|
/*
Ousía
Copyright (C) 2014, 2015 Benjamin Paaßen, Andreas Stöckel
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#include "Rtti.hpp"
namespace ousia {
/* Class RttiStore */
std::unordered_map<std::type_index, const RttiBase *> &RttiStore::table()
{
static std::unordered_map<std::type_index, const RttiBase *> table;
return table;
}
void RttiStore::store(const std::type_info &native, const RttiBase *rtti)
{
table().emplace(std::type_index{native}, rtti);
}
const RttiBase &RttiStore::lookup(const std::type_info &native)
{
const auto &tbl = table();
auto it = tbl.find(std::type_index{native});
if (it == tbl.end()) {
return RttiTypes::None;
} else {
return *(it->second);
}
}
/* Class RttiBase */
void RttiBase::initialize() const
{
// Only run this function exactly once -- directly set the initialized flag
// to prevent unwanted recursion
if (!initialized) {
initialized = true;
// Insert the parent types of the parent types and the aggregated types
// of the parents
{
std::unordered_set<const RttiBase *> origParents = parents;
for (const RttiBase *parent : origParents) {
parent->initialize();
parents.insert(parent->parents.begin(), parent->parents.end());
}
for (const RttiBase *parent : parents) {
parent->initialize();
aggregatedTypes.insert(parent->aggregatedTypes.begin(),
parent->aggregatedTypes.end());
}
parents.insert(this);
}
// Insert the aggregated types of the aggregated types and the parents
// of each aggregated type
{
std::unordered_set<const RttiBase *> origAggregatedTypes =
aggregatedTypes;
for (const RttiBase *aggregatedType : origAggregatedTypes) {
aggregatedType->initialize();
aggregatedTypes.insert(aggregatedType->aggregatedTypes.begin(),
aggregatedType->aggregatedTypes.end());
aggregatedTypes.insert(aggregatedType->parents.begin(),
aggregatedType->parents.end());
}
}
}
}
bool RttiBase::isa(const RttiBase &other) const
{
initialize();
return parents.count(&other) > 0;
}
bool RttiBase::aggregatedOf(const RttiBase &other) const
{
initialize();
return aggregatedTypes.count(&other) > 0;
}
/* Constant initialization */
const RttiBase RttiTypes::None;
}
|
