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
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
|
// file : cutl/container/graph.hxx
// copyright : Copyright (c) 2009-2013 Code Synthesis Tools CC
// license : MIT; see accompanying LICENSE file
#ifndef CUTL_CONTAINER_GRAPH_HXX
#define CUTL_CONTAINER_GRAPH_HXX
#include <map>
#include <cutl/exception.hxx>
#include <cutl/shared-ptr.hxx>
#include <cutl/details/export.hxx>
namespace cutl
{
namespace container
{
struct LIBCUTL_EXPORT no_edge: exception {};
struct LIBCUTL_EXPORT no_node: exception {};
template <typename N, typename E>
class graph
{
public:
typedef N node_base;
typedef E edge_base;
public:
template <typename T>
T&
new_node ();
template <typename T, typename A0>
T&
new_node (A0 const&);
template <typename T, typename A0, typename A1>
T&
new_node (A0 const&, A1 const&);
template <typename T, typename A0, typename A1, typename A2>
T&
new_node (A0 const&, A1 const&, A2 const&);
template <typename T, typename A0, typename A1, typename A2,
typename A3>
T&
new_node (A0 const&, A1 const&, A2 const&, A3 const&);
template <typename T, typename A0, typename A1, typename A2,
typename A3, typename A4>
T&
new_node (A0 const&, A1 const&, A2 const&, A3 const&, A4 const&);
template <typename T, typename A0, typename A1, typename A2,
typename A3, typename A4, typename A5>
T&
new_node (A0 const&, A1 const&, A2 const&, A3 const&, A4 const&,
A5 const&);
template <typename T, typename A0, typename A1, typename A2,
typename A3, typename A4, typename A5, typename A6>
T&
new_node (A0 const&, A1 const&, A2 const&, A3 const&, A4 const&,
A5 const&, A6 const&);
template <typename T, typename A0, typename A1, typename A2,
typename A3, typename A4, typename A5, typename A6,
typename A7>
T&
new_node (A0 const&, A1 const&, A2 const&, A3 const&, A4 const&,
A5 const&, A6 const&, A7 const&);
template <typename T, typename A0, typename A1, typename A2,
typename A3, typename A4, typename A5, typename A6,
typename A7, typename A8>
T&
new_node (A0 const&, A1 const&, A2 const&, A3 const&, A4 const&,
A5 const&, A6 const&, A7 const&, A8 const&);
template <typename T, typename A0, typename A1, typename A2,
typename A3, typename A4, typename A5, typename A6,
typename A7, typename A8, typename A9>
T&
new_node (A0 const&, A1 const&, A2 const&, A3 const&, A4 const&,
A5 const&, A6 const&, A7 const&, A8 const&, A9 const&);
// Non-const versions.
//
template <typename T, typename A0>
T&
new_node (A0&);
template <typename T, typename A0, typename A1>
T&
new_node (A0&, A1&);
template <typename T, typename A0, typename A1, typename A2>
T&
new_node (A0&, A1&, A2&);
public:
template <typename T, typename L, typename R>
T&
new_edge (L&, R&);
template <typename T, typename L, typename R,
typename A0>
T&
new_edge (L&, R&, A0 const&);
template <typename T, typename L, typename R,
typename A0, typename A1>
T&
new_edge (L&, R&, A0 const&, A1 const&);
template <typename T, typename L, typename R,
typename A0, typename A1, typename A2>
T&
new_edge (L&, R&, A0 const&, A1 const&, A2 const&);
template <typename T, typename L, typename R,
typename A0, typename A1, typename A2, typename A3>
T&
new_edge (L&, R&, A0 const&, A1 const&, A2 const&, A3 const&);
template <typename T, typename L, typename R,
typename A0, typename A1, typename A2, typename A3,
typename A4>
T&
new_edge (L&, R&, A0 const&, A1 const&, A2 const&, A3 const&,
A4 const&);
template <typename T, typename L, typename R,
typename A0, typename A1, typename A2, typename A3,
typename A4, typename A5>
T&
new_edge (L&, R&, A0 const&, A1 const&, A2 const&, A3 const&,
A4 const&, A5 const&);
// Functions to reset edge's nodes.
//
public:
template <typename TE, typename TN>
void
reset_left_node (TE& edge, TN& node)
{
edge.set_left_node (node);
}
template <typename TE, typename TN>
void
reset_right_node (TE& edge, TN& node)
{
edge.set_right_node (node);
}
// Functions to add edges to a node.
//
public:
template <typename TN, typename TE>
void
add_edge_left (TN& node, TE& edge)
{
node.add_edge_left (edge);
}
template <typename TN, typename TE>
void
add_edge_right (TN& node, TE& edge)
{
node.add_edge_right (edge);
}
// Functions to delete edges and nodes. In order to delete a
// a node without leaving any dangling edges you need to make
// sure that each edge pointing to it is either deleted or reset
// to some other node.
//
public:
template <typename T, typename L, typename R>
void
delete_edge (L& left_node, R& right_node, T& edge);
void
delete_node (node_base& node)
{
if (nodes_.erase (&node) == 0)
throw no_node ();
}
public:
graph () {}
private:
graph (graph const&);
graph&
operator= (graph const&);
protected:
typedef shared_ptr<node_base> node_ptr;
typedef shared_ptr<edge_base> edge_ptr;
typedef std::map<node_base*, node_ptr> nodes;
typedef std::map<edge_base*, edge_ptr> edges;
nodes nodes_;
edges edges_;
};
}
}
#include <cutl/container/graph.txx>
#endif // CUTL_CONTAINER_GRAPH_HXX
|
