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
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
|
/*
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 <core/common/Rtti.hpp>
#include <core/common/Exceptions.hpp>
#include "Domain.hpp"
namespace ousia {
namespace model {
/* Class FieldDescriptor */
/* Class Descriptor */
void Descriptor::continueResolve(ResolutionState &state)
{
if (attributesDescriptor != nullptr) {
const NodeVector<Attribute> &attributes =
attributesDescriptor->getAttributes();
continueResolveComposita(attributes, attributes.getIndex(), state);
}
continueResolveComposita(fieldDescriptors, fieldDescriptors.getIndex(),
state);
}
std::vector<Rooted<Node>> Descriptor::pathTo(
Handle<StructuredClass> target) const
{
std::vector<Rooted<Node>> path;
continuePath(target, path);
return path;
}
static bool pathEquals(const Descriptor& a, const Descriptor& b)
{
// We assume that two Descriptors are equal if their names and domain names
// are equal.
if (a.getName() != b.getName()) {
return false;
}
Handle<Domain> aDom = a.getParent().cast<Domain>();
Handle<Domain> bDom = b.getParent().cast<Domain>();
return aDom->getName() == bDom->getName();
}
//TODO: isa-handling.
bool Descriptor::continuePath(Handle<StructuredClass> target,
std::vector<Rooted<Node>> &path) const
{
// look if our current node is reachable using the parent references
for (auto &pfd : target->getParents()) {
Handle<Descriptor> p = pfd->getParent().cast<Descriptor>();
if (pathEquals(*this, *p)) {
// if we have made the connection, stop the search.
path.push_back(pfd);
return true;
}
// look for transparent intermediate nodes.
if (!p->isa(RttiTypes::StructuredClass)) {
continue;
}
Handle<StructuredClass> pc = p.cast<StructuredClass>();
if (pc->transparent) {
// recursion
std::vector<Rooted<Node>> cPath = path;
if (continuePath(pc, cPath)) {
path = std::move(cPath);
path.push_back(pc);
path.push_back(pfd);
return true;
}
}
}
// use recursive depth-first search from the top to reach the given child
for (auto &fd : fieldDescriptors) {
for (auto &c : fd->getChildren()) {
if (pathEquals(*c, *target)) {
// if we have made the connection, stop the search.
path.push_back(fd);
return true;
}
// look for transparent intermediate nodes.
if (c->transparent) {
// copy the path.
std::vector<Rooted<Node>> cPath = path;
cPath.push_back(fd);
cPath.push_back(c);
// recursion.
if (c->continuePath(target, cPath)) {
path = std::move(cPath);
return true;
}
}
}
}
return false;
}
/* Class Domain */
void Domain::continueResolve(ResolutionState &state)
{
if (!continueResolveComposita(structuredClasses,
structuredClasses.getIndex(), state) |
continueResolveComposita(annotationClasses,
annotationClasses.getIndex(), state)) {
continueResolveReferences(typesystems, state);
}
}
}
/* Type registrations */
namespace RttiTypes {
const Rtti<model::FieldDescriptor> FieldDescriptor =
RttiBuilder("FieldDescriptor").parent(&Node);
const Rtti<model::Descriptor> Descriptor =
RttiBuilder("Descriptor").parent(&Node);
const Rtti<model::StructuredClass> StructuredClass =
RttiBuilder("StructuredClass").parent(&Descriptor).composedOf(
&FieldDescriptor);
const Rtti<model::AnnotationClass> AnnotationClass =
RttiBuilder("AnnotationClass").parent(&Descriptor);
const Rtti<model::Domain> Domain =
RttiBuilder("Domain").parent(&Node).composedOf(
{&StructuredClass, &AnnotationClass});
}
}
|
