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
|
/*
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 "Document.hpp"
#include <core/common/Exceptions.hpp>
#include <core/common/Rtti.hpp>
namespace ousia {
namespace model {
/* Class DocumentEntity */
int DocumentEntity::getFieldDescriptorIndex(const std::string &fieldName,
bool enforce) const
{
const NodeVector<FieldDescriptor> &fds = descriptor->getFieldDescriptors();
unsigned int f = 0;
// look if we have an empty name.
if (fieldName == "") {
// in that case we look for a default field.
// First: Do we only have one field?
if (fds.size() == 1) {
// if so we return that one.
return f;
}
// Second: Do we have a TREE field?
for (auto &fd : fds) {
if (fd->getFieldType() == FieldDescriptor::FieldType::TREE) {
return f;
}
f++;
}
} else {
// otherwise we return the FieldDescriptor with the correct name (if
// such a descriptor exists).
for (auto &fd : fds) {
if (fd->getName() == fieldName) {
return f;
}
f++;
}
}
if (enforce) {
throw OusiaException(descriptor->getName() +
" has no field with name " + fieldName);
} else {
return -1;
}
}
int DocumentEntity::getFieldDescriptorIndex(
Handle<FieldDescriptor> fieldDescriptor, bool enforce) const
{
if (fieldDescriptor.isNull()) {
throw OusiaException("The given FieldDescriptor handle is null!");
}
const NodeVector<FieldDescriptor> &fds = descriptor->getFieldDescriptors();
int f = 0;
for (auto &fd : fds) {
if (fd->getName() == fieldDescriptor->getName() &&
fd->getFieldType() == fieldDescriptor->getFieldType()) {
return f;
}
f++;
}
if (enforce) {
throw OusiaException(descriptor->getName() +
" has no field with name " +
fieldDescriptor->getName());
} else {
return -1;
}
}
/* Class AnnotationEntity */
AnnotationEntity::AnnotationEntity(Manager &mgr, Handle<Document> parent,
Handle<AnnotationClass> descriptor, Handle<Anchor> start,
Handle<Anchor> end, Variant attributes, std::string name)
: Node(mgr, std::move(name), parent),
DocumentEntity(this, descriptor, attributes),
start(acquire(start)),
end(acquire(end))
{
parent->annotations.push_back(this);
}
/* Class Document */
void Document::continueResolve(ResolutionState &state)
{
continueResolveComposita(annotations, annotations.getIndex(), state);
if (root != nullptr) {
continueResolveCompositum(root, state);
}
continueResolveReferences(domains, state);
}
}
/* Type registrations */
namespace RttiTypes {
const Rtti<model::Document> Document =
RttiBuilder("Document").parent(&Node).composedOf(
{&AnnotationEntity, &StructuredEntity});
const Rtti<model::StructureNode> StructureNode =
RttiBuilder("StructureNode").parent(&Node);
const Rtti<model::AnnotationEntity> AnnotationEntity =
RttiBuilder("AnnotationEntity").parent(&Node).composedOf(&StructureNode);
const Rtti<model::StructuredEntity> StructuredEntity =
RttiBuilder("StructuredEntity").parent(&StructureNode).composedOf(
{&StructureNode});
const Rtti<model::DocumentPrimitive> DocumentPrimitive =
RttiBuilder("DocumentPrimitive").parent(&StructureNode);
const Rtti<model::AnnotationEntity::Anchor> Anchor =
RttiBuilder("Anchor").parent(&StructureNode);
}
}
|
