blob: eade5244bb3b752d79aee837588b9fb2bc8b0741 (
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
|
/*
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 RttiBase::None;
} else {
return *(it->second);
}
}
/* Class RttiBase */
const RttiBase RttiBase::None;
bool RttiBase::isa(const RttiBase &other) const
{
if (&other == this) {
return true;
}
for (auto t : parents) {
if (t->isa(other)) {
return true;
}
}
return false;
}
}
|
