blob: baf2e5afe708d88e042ebc0bd338b2f817c57bdb (
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
|
// file : CCF/IDL2/SemanticGraph/Array.hpp
// author : Boris Kolpackov <boris@dre.vanderbilt.edu>
// cvs-id : $Id$
#ifndef CCF_IDL2_SEMANTIC_GRAPH_ARRAY_HPP
#define CCF_IDL2_SEMANTIC_GRAPH_ARRAY_HPP
#include "CCF/IDL2/SemanticGraph/Elements.hpp"
namespace CCF
{
namespace IDL2
{
namespace SemanticGraph
{
//
//
//
class Array : public virtual Specialization
{
public:
Type&
type () const
{
return
dynamic_cast<ArgumentsWithType&> (**arguments_begin ()).type ();
}
// You will have to iterate through Arguments edges starting
// from begin + 1 to get to the list of bounds. I suggest that
// you use traversal instead.
//
virtual bool
complete () const
{
// Is this the right semantic for arrays?
//
return type ().complete ();
}
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
Array (Path const& path, unsigned long line)
: Node (path, line)
{
type_info (static_type_info ());
}
};
}
}
}
#endif // CCF_IDL2_SEMANTIC_GRAPH_ARRAY_HPP
|
