blob: 333b55fed2aca873e6a1237416bced248cf37f29 (
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
|
// file : CCF/IDL2/SemanticGraph/Sequence.hpp
// author : Boris Kolpackov <boris@dre.vanderbilt.edu>
// cvs-id : $Id$
#ifndef CCF_IDL2_SEMANTIC_GRAPH_SEQUENCE_HPP
#define CCF_IDL2_SEMANTIC_GRAPH_SEQUENCE_HPP
#include "CCF/IDL2/SemanticGraph/Elements.hpp"
#include "CCF/IDL2/SemanticGraph/IntExpression.hpp"
namespace CCF
{
namespace IDL2
{
namespace SemanticGraph
{
//
//
//
class Sequence : public virtual Specialization
{
public:
Type&
type () const
{
return
dynamic_cast<ArgumentsWithType&> (**arguments_begin ()).type ();
}
virtual bool
complete () const
{
return type ().complete ();
}
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
Sequence () // For virtual inheritance only.
{
type_info (static_type_info ());
}
virtual
~Sequence () = 0;
};
//
//
//
class UnboundedSequence : public virtual Sequence
{
public:
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
UnboundedSequence (Path const& path, unsigned long line)
: Node (path, line)
{
type_info (static_type_info ());
}
};
//
//
//
class BoundedSequence : public virtual Sequence
{
public:
IntExpression&
bound () const
{
ArgumentsIterator i (arguments_begin ());
++i; // Bound is always second to the type.
return
dynamic_cast<IntExpression&> (
dynamic_cast<ArgumentsWithValue&> (**i).value ());
}
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
BoundedSequence (Path const& path, unsigned long line)
: Node (path, line)
{
type_info (static_type_info ());
}
};
}
}
}
#endif // CCF_IDL2_SEMANTIC_GRAPH_SEQUENCE_HPP
|
