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
|
#include "helpers.hpp"
#include "memorystore.hpp"
#include <unordered_map>
ref operator-(ref a, ref b)
{
return ref(a.name() + "-" + b.name());
}
ref ref::operator=(ref other)
{
// if this is not anonymous, and other is, then we are naming it
/*declrefs(anonymous);
if (other->linked(anonymous, true) && !ptr->linked(anonymous, true)) {
return;
}*/
// if this is link-type, make new concept [not checked, might want to assume]
ref ret = alloc();
ret->link(*this, other);
return ret;
}
ref ref::operator[](ref links) {
ptr->links.insert(links->links.begin(), links->links.end());
dealloc(links);
return *this;
}
ref operator,(ref a, ref b)
{
a->links.insert(b->links.begin(), b->links.end());
dealloc(b);
return a;
}
// concept names are for bootstrapping convenience,
// to make hardcoding structures easier.
// hence there is just one single list of them
std::unordered_map<std::string,concept*,std::hash<std::string>,std::equal_to<std::string>> conceptsByName;
struct name_t : public ref
{
name_t();
} name;
name_t::name_t()
: ref(alloc())
{
auto nam = valloc(std::string("name"));
ptr->link(::name, nam);
conceptsByName.emplace(nam, ptr);
}
ref::ref(std::string const & s)
{
auto res = conceptsByName.find(s);
if (res != conceptsByName.end()) {
ptr = res->second;
} else {
ref con = alloc();
auto nam = valloc<std::string>(s);
conceptsByName.emplace(nam, con.ptr);
con->link(::name, nam);
ptr = con.ptr;
}
}
value<std::string> & ref::name() const
{
return *ptr->vget<std::string>(::name).ptr;
}
ref::operator const char *() const {
return name().c_str();
}
ref a(ref what)
{
static unsigned long long gid = 0;
declrefs(is, anonymous);
return ref(what.name() + "-" + std::to_string(gid++))[is = what, anonymous = true];
}
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);
}
|
