blob: 40327bcc5854de22953ddc682129e24ca8ada270 (
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
|
// file : xsd-frontend/semantic-graph/complex.hxx
// author : Boris Kolpackov <boris@codesynthesis.com>
// copyright : Copyright (c) 2005-2010 Code Synthesis Tools CC
// license : GNU GPL v2 + exceptions; see accompanying LICENSE file
#ifndef XSD_FRONTEND_SEMANTIC_GRAPH_COMPLEX_HXX
#define XSD_FRONTEND_SEMANTIC_GRAPH_COMPLEX_HXX
#include <xsd-frontend/semantic-graph/elements.hxx>
#include <xsd-frontend/semantic-graph/compositors.hxx>
#include <cult/containers/vector.hxx>
namespace XSDFrontend
{
namespace SemanticGraph
{
class Complex: public virtual Type, public virtual Scope
{
public:
Boolean
mixed_p () const
{
return mixed_;
}
public:
Boolean
contains_compositor_p ()
{
return contains_compositor_ != 0;
}
ContainsCompositor&
contains_compositor ()
{
assert (contains_compositor_ != 0);
return *contains_compositor_;
}
public:
Void
mixed_p (Boolean m)
{
mixed_ = m;
}
protected:
friend class Bits::Graph<Node, Edge>;
Complex (); // Virtual inheritance (Enumeration).
Complex (Path const& file, UnsignedLong line, UnsignedLong column);
using Type::add_edge_right;
using Type::add_edge_left;
using Scope::add_edge_left;
Void
add_edge_left (ContainsCompositor& e)
{
contains_compositor_ = &e;
}
Void
remove_edge_left (ContainsCompositor& e)
{
assert (contains_compositor_ == &e);
contains_compositor_ = 0;
}
private:
Boolean mixed_;
ContainsCompositor* contains_compositor_;
};
}
}
#endif // XSD_FRONTEND_SEMANTIC_GRAPH_COMPLEX_HXX
|
