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
|
// file : xsd-frontend/semantic-graph/compositors.hxx
// author : Boris Kolpackov <boris@codesynthesis.com>
// copyright : Copyright (c) 2006-2010 Code Synthesis Tools CC
// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
#ifndef XSD_FRONTEND_SEMANTIC_GRAPH_COMPOSITORS_HXX
#define XSD_FRONTEND_SEMANTIC_GRAPH_COMPOSITORS_HXX
#include <cult/containers/list.hxx>
#include <xsd-frontend/semantic-graph/elements.hxx>
#include <xsd-frontend/semantic-graph/particle.hxx>
namespace XSDFrontend
{
namespace SemanticGraph
{
//
//
class ContainsCompositor: public virtual Edge
{
public:
Compositor&
compositor () const
{
return *compositor_;
}
Node&
container () const
{
return *container_;
}
public:
UnsignedLong
min () const
{
return min_;
}
UnsignedLong
max () const
{
return max_;
}
protected:
friend class Bits::Graph<Node, Edge>;
ContainsCompositor (UnsignedLong min, UnsignedLong max);
Void
set_left_node (Node& n)
{
container_ = &n;
}
Void
set_right_node (Compositor& n)
{
compositor_ = &n;
}
Void
clear_left_node (Node& n)
{
assert (container_ == &n);
container_ = 0;
}
Void
clear_right_node (Compositor& n)
{
assert (compositor_ == &n);
compositor_ = 0;
}
private:
Compositor* compositor_;
Node* container_;
UnsignedLong min_, max_;
};
//
//
class Compositor: public virtual Particle
{
typedef
Cult::Containers::List<ContainsParticle*>
ContainsList;
public:
typedef
Bits::PointerIterator<ContainsList::Iterator>
ContainsIterator;
typedef
Bits::PointerIterator<ContainsList::ConstIterator>
ContainsConstIterator;
ContainsIterator
contains_begin ()
{
return contains_.begin ();
}
ContainsIterator
contains_end ()
{
return contains_.end ();
}
ContainsConstIterator
contains_begin () const
{
return contains_.begin ();
}
ContainsConstIterator
contains_end () const
{
return contains_.end ();
}
public:
Boolean
contained_compositor_p ()
{
return contained_compositor_ != 0;
}
ContainsCompositor&
contained_compositor ()
{
assert (contained_compositor_ != 0);
return *contained_compositor_;
}
public:
UnsignedLong
min () const
{
if (contained_compositor_ != 0)
return contained_compositor_->min ();
else
return Particle::min ();
}
UnsignedLong
max () const
{
if (contained_compositor_ != 0)
return contained_compositor_->max ();
else
return Particle::max ();
}
protected:
friend class Bits::Graph<Node, Edge>;
Compositor ()
: contained_compositor_ (0)
{
}
Void
add_edge_left (ContainsParticle& e)
{
contains_.push_back (&e);
}
Void
remove_edge_left (ContainsParticle& e)
{
for (ContainsList::Iterator i (contains_.begin ());
i != contains_.end (); ++i)
{
if (*i == &e)
{
contains_.erase (i);
break;
}
}
}
//@@ Ideally should be protected but then NodeArg has no way to
// access it. Maybe when (if) I move NodeArg into Grpah I can
// resolve this.
//
public:
Void
add_edge_left (ContainsParticle& e, ContainsIterator const& after)
{
if (after.base () == contains_.end ())
contains_.push_front (&e);
else
{
ContainsList::Iterator i (after.base ());
contains_.insert (++i, &e);
}
}
protected:
using Node::add_edge_right;
using Particle::add_edge_right;
using Particle::remove_edge_right;
Void
add_edge_right (ContainsCompositor& e)
{
contained_compositor_ = &e;
}
Void
remove_edge_right (ContainsCompositor& e)
{
assert (contained_compositor_ == &e);
contained_compositor_ = 0;
}
private:
ContainsList contains_;
ContainsCompositor* contained_compositor_;
};
//
//
class All: public virtual Compositor
{
protected:
friend class Bits::Graph<Node, Edge>;
All (Path const& file, UnsignedLong line, UnsignedLong column);
};
//
//
class Choice: public virtual Compositor
{
protected:
friend class Bits::Graph<Node, Edge>;
Choice (Path const& file, UnsignedLong line, UnsignedLong column);
};
//
//
class Sequence: public virtual Compositor
{
protected:
friend class Bits::Graph<Node, Edge>;
Sequence (Path const& file, UnsignedLong line, UnsignedLong column);
};
}
}
#endif // XSD_FRONTEND_SEMANTIC_GRAPH_COMPOSITORS_HXX
|
