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
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
|
// file : xsd-frontend/semantic-graph/schema.hxx
// author : Boris Kolpackov <boris@codesynthesis.com>
// copyright : Copyright (c) 2005-2010 Code Synthesis Tools CC
// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
#ifndef XSD_FRONTEND_SEMANTIC_GRAPH_SCHEMA_HXX
#define XSD_FRONTEND_SEMANTIC_GRAPH_SCHEMA_HXX
#include <cult/containers/set.hxx>
#include <xsd-frontend/semantic-graph/elements.hxx>
#include <xsd-frontend/semantic-graph/namespace.hxx>
namespace XSDFrontend
{
namespace SemanticGraph
{
//
//
class Schema;
class Uses: public virtual Edge
{
public:
Schema&
user () const
{
return *user_;
}
Schema&
schema () const
{
return *schema_;
}
Path
path () const
{
return path_;
}
protected:
friend class Bits::Graph<Node, Edge>;
Uses (Path const& path)
: path_ (path)
{
}
Void
set_left_node (Schema& s)
{
user_ = &s;
}
Void
set_right_node (Schema& s)
{
schema_ = &s;
}
private:
Path path_;
Schema* user_;
Schema* schema_;
};
//
//
class Implies: public virtual Uses
{
protected:
friend class Bits::Graph<Node, Edge>;
Implies (Path const& path)
: Uses (path)
{
}
};
//
//
class Sources: public virtual Uses
{
protected:
friend class Bits::Graph<Node, Edge>;
Sources (Path const& path)
: Uses (path)
{
}
};
//
//
class Includes: public virtual Uses
{
protected:
friend class Bits::Graph<Node, Edge>;
Includes (Path const& path)
: Uses (path)
{
}
};
//
//
class Imports: public virtual Uses
{
protected:
friend class Bits::Graph<Node, Edge>;
Imports (Path const& path)
: Uses (path)
{
}
};
//
//
class Schema: public virtual Scope,
private Bits::Graph<Node, Edge>,
public NonCopyable
{
typedef
Cult::Containers::Vector<Uses*>
UsesList;
typedef
Cult::Containers::Vector<Uses*>
UsedList;
public:
Schema (Path const& file, UnsignedLong line, UnsignedLong column)
: SemanticGraph::Node (file, line, column)
{
}
public:
typedef
Bits::PointerIterator<UsesList::ConstIterator>
UsesIterator;
UsesIterator
uses_begin () const
{
return uses_.begin ();
}
UsesIterator
uses_end () const
{
return uses_.end ();
}
typedef
Bits::PointerIterator<UsedList::ConstIterator>
UsedIterator;
UsedIterator
used_begin () const
{
return used_.begin ();
}
UsedIterator
used_end () const
{
return used_.end ();
}
Boolean
used_p () const
{
return used_begin () != used_end ();
}
virtual NamesIteratorPair
find (Name const& name) const;
public:
using Bits::Graph<SemanticGraph::Node, Edge>::new_edge;
using Bits::Graph<SemanticGraph::Node, Edge>::reset_left_node;
using Bits::Graph<SemanticGraph::Node, Edge>::reset_right_node;
using Bits::Graph<SemanticGraph::Node, Edge>::add_edge_left;
using Bits::Graph<SemanticGraph::Node, Edge>::add_edge_right;
using Bits::Graph<SemanticGraph::Node, Edge>::delete_node;
using Bits::Graph<SemanticGraph::Node, Edge>::delete_edge;
template <typename T>
T&
new_node (Path const& file, UnsignedLong line, UnsignedLong column)
{
return graph ().new_node<T> (file, line, column);
}
template <typename T, typename A0>
T&
new_node (Path const& file, UnsignedLong line, UnsignedLong column,
A0 const& a0)
{
return graph ().new_node<T> (file, line, column, a0);
}
template <typename T, typename A0, typename A1>
T&
new_node (Path const& file, UnsignedLong line, UnsignedLong column,
A0 const& a0, A1 const& a1)
{
return graph ().new_node<T> (file, line, column, a0, a1);
}
template <typename T, typename A0, typename A1, typename A2>
T&
new_node (Path const& file, UnsignedLong line, UnsignedLong column,
A0 const& a0, A1 const& a1, A2 const& a2)
{
return graph ().new_node<T> (file, line, column, a0, a1, a2);
}
template <typename T, typename A0, typename A1, typename A2,
typename A3>
T&
new_node (Path const& file, UnsignedLong line, UnsignedLong column,
A0 const& a0, A1 const& a1, A2 const& a2, A3 const& a3)
{
return graph ().new_node<T> (file, line, column, a0, a1, a2, a3);
}
protected:
//@@ gcc bug #21146
//
friend class Bits::Graph<SemanticGraph::Node, Edge>;
using Scope::add_edge_left;
using Node::add_edge_right;
Void
add_edge_left (Uses& e)
{
uses_.push_back (&e);
}
Void
add_edge_right (Uses& e)
{
used_.push_back (&e);
}
private:
Bits::Graph<SemanticGraph::Node, Edge>&
graph ()
{
return *this;
}
private:
UsesList uses_;
UsedList used_;
private:
typedef Cult::Containers::Set<Schema const*> SchemaSet;
Void
find_ (Name const& name, NamesList&, SchemaSet&) const;
mutable NamesList names_;
mutable SchemaSet schemas_;
};
}
}
#endif // XSD_FRONTEND_SEMANTIC_GRAPH_SCHEMA_HXX
|
