blob: df48de443c9da99c60143af0119e90669758e9cd (
plain)
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
|
// file : xsd-frontend/semantic-graph/particle.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_PARTICLE_HXX
#define XSD_FRONTEND_SEMANTIC_GRAPH_PARTICLE_HXX
#include <xsd-frontend/semantic-graph/elements.hxx>
namespace XSDFrontend
{
namespace SemanticGraph
{
//
//
class Particle;
class Compositor;
//
//
class ContainsParticle: public virtual Edge
{
public:
Particle&
particle () const
{
return *particle_;
}
Compositor&
compositor () const
{
return *compositor_;
}
public:
UnsignedLong
min () const
{
return min_;
}
UnsignedLong
max () const
{
return max_;
}
protected:
friend class Bits::Graph<Node, Edge>;
ContainsParticle (UnsignedLong min, UnsignedLong max);
Void
set_left_node (Compositor& n)
{
compositor_ = &n;
}
Void
set_right_node (Particle& n)
{
particle_ = &n;
}
Void
clear_left_node (Compositor& n)
{
assert (compositor_ == &n);
compositor_ = 0;
}
Void
clear_right_node (Particle& n)
{
assert (particle_ == &n);
particle_ = 0;
}
private:
Particle* particle_;
Compositor* compositor_;
UnsignedLong min_, max_;
};
//
//
class Particle: public virtual Node
{
public:
Boolean
contained_particle_p ()
{
return contained_particle_ != 0;
}
ContainsParticle&
contained_particle ()
{
assert (contained_particle_ != 0);
return *contained_particle_;
}
public:
UnsignedLong
min () const
{
assert (contained_particle_ != 0);
return contained_particle_->min ();
}
UnsignedLong
max () const
{
assert (contained_particle_ != 0);
return contained_particle_->max ();
}
protected:
friend class Bits::Graph<Node, Edge>;
Particle ();
Void
add_edge_right (ContainsParticle& e)
{
contained_particle_ = &e;
}
Void
remove_edge_right (ContainsParticle& e)
{
assert (contained_particle_ == &e);
contained_particle_ = 0;
}
private:
ContainsParticle* contained_particle_;
};
}
}
#endif // XSD_FRONTEND_SEMANTIC_GRAPH_PARTICLE_HXX
|
