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
|
#include "helpers.hpp"
#include <unordered_map>
ref operator-(ref a, ref b)
{
return ref(a.name() + "-" + b.name());
}
concept ref::operator=(ref other)
{
// if this is link-type, make new concept
concept ret;
ret.link(*this, other);
return ret;
}
ref ref::operator[](concept links) {
ptr->links.insert(links.links.begin(), links.links.end());
return *this;
}
concept operator,(concept a, concept b)
{
concept ret;
ret.links.insert(a.links.begin(), a.links.end());
ret.links.insert(b.links.begin(), b.links.end());
return ret;
}
// concept names are for bootstrapping convenience,
// to make hardcoding structures easier.
// hence there is just one single list of them
concept namesByConcept;
std::unordered_map<value<std::string>,concept,std::hash<std::string>> conceptsByName;
ref::ref(std::string const & s)
{
try {
ptr = &conceptsByName.at(value<std::string>(s));
} catch (std::out_of_range) {
auto insertion = conceptsByName.emplace(value<std::string>(s), concept());
ref con = &insertion.first->second;
ref nam = const_cast<concept *>((concept const *)&insertion.first->first);
namesByConcept.link(con, nam);
ptr = con.ptr;
}
}
value<std::string> & ref::name() const
{
return value<std::string>::of(namesByConcept.get(*this));
}
ref::operator const char *() const {
return name().c_str();
}
ref a(ref what)
{
static unsigned long long gid = 0;
declrefs(is);
return ref(what.name() + "-" + std::to_string(gid++))[is = what];
}
ref an(ref what)
{
return a(what);
}
bool ref::isa(ref what) const
{
declrefs(is);
for (auto group : ptr->getAll(is)) {
if (group == what) return true;
if (group.isa(what)) return true;
}
return false;
}
bool ref::isan(ref what) const
{
return isa(what);
}
|
