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
|
// file : CCF/IDL2/SemanticGraph/Interface.hpp
// author : Boris Kolpackov <boris@dre.vanderbilt.edu>
// cvs-id : $Id$
#ifndef CCF_IDL2_SEMANTIC_GRAPH_INTERFACE_HPP
#define CCF_IDL2_SEMANTIC_GRAPH_INTERFACE_HPP
#include "CCF/IDL2/SemanticGraph/Elements.hpp"
#include "CCF/IDL2/SemanticGraph/Operation.hpp"
namespace CCF
{
namespace IDL2
{
namespace SemanticGraph
{
//
//
//
class Interface : public virtual Type, public virtual Scope
{
typedef
std::vector <Inherits*>
Inherits_;
public:
typedef
Inherits_::const_iterator
InheritsIterator;
InheritsIterator
inherits_begin () const
{
return inherits_.begin ();
}
InheritsIterator
inherits_end () const
{
return inherits_.end ();
}
virtual bool
complete () const
{
return true;
}
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
Interface () // For virtual inheritance only.
{
type_info (static_type_info ());
}
virtual
~Interface () = 0;
using Type::add_edge_right;
using Scope::add_edge_left;
void
add_edge_left (Inherits& e)
{
inherits_.push_back (&e);
}
void
add_edge_right (Inherits&)
{
}
private:
Inherits_ inherits_;
};
//
//
//
class Supports : public virtual IsA
{
public:
virtual Type&
supporter () const
{
return subject ();
}
virtual Type&
supportee () const
{
return object ();
}
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
Supports ()
{
type_info (static_type_info ());
}
void
set_right_node (Interface& n)
{
IsA::set_right_node (n);
}
};
//
//
//
class AbstractInterface : public virtual Interface
{
public:
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
AbstractInterface (Path const& path, unsigned long line)
: Node (path, line)
{
type_info (static_type_info ());
}
};
//
//
//
class LocalInterface : public virtual Interface
{
public:
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
LocalInterface (Path const& path, unsigned long line)
: Node (path, line)
{
type_info (static_type_info ());
}
};
//
//
//
class UnconstrainedInterface : public virtual Interface
{
public:
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
UnconstrainedInterface (Path const& path, unsigned long line)
: Node (path, line)
{
type_info (static_type_info ());
}
};
}
}
}
#endif // CCF_IDL2_SEMANTIC_GRAPH_INTERFACE_HPP
|
