blob: 484a8a778ecaa3de0dc797f35beefb54e8cc213e (
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
|
// file : CCF/IDL2/SemanticGraph/String.hpp
// author : Boris Kolpackov <boris@dre.vanderbilt.edu>
// cvs-id : $Id$
#ifndef CCF_IDL2_SEMANTIC_GRAPH_STRING_HPP
#define CCF_IDL2_SEMANTIC_GRAPH_STRING_HPP
#include "CCF/IDL2/SemanticGraph/Elements.hpp"
#include "CCF/IDL2/SemanticGraph/IntExpression.hpp"
namespace CCF
{
namespace IDL2
{
namespace SemanticGraph
{
//
//
class BoundedString : public virtual Specialization
{
public:
IntExpression&
bound () const
{
return
dynamic_cast<IntExpression&> (
dynamic_cast<ArgumentsWithValue&> (
**arguments_begin ()).value ());
}
virtual bool
complete () const
{
return true;
}
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
BoundedString (Path const& path, unsigned long line)
: Node (path, line)
{
type_info (static_type_info ());
}
};
//
//
class BoundedWideString : public virtual Specialization
{
public:
IntExpression&
bound () const
{
return
dynamic_cast<IntExpression&> (
dynamic_cast<ArgumentsWithValue&> (
**arguments_begin ()).value ());
}
virtual bool
complete () const
{
return true;
}
static Introspection::TypeInfo const&
static_type_info ();
protected:
friend class Graph<Node, Edge>;
BoundedWideString (Path const& path, unsigned long line)
: Node (path, line)
{
type_info (static_type_info ());
}
};
}
}
}
#endif // CCF_IDL2_SEMANTIC_GRAPH_STRING_HPP
|
