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
|
// file : CCF/IDL2/SemanticGraph/Graph.tpp
// author : Boris Kolpackov <boris@dre.vanderbilt.edu>
// cvs-id : $Id$
namespace CCF
{
namespace IDL2
{
namespace SemanticGraph
{
// Graph
//
//
template <typename N, typename E>
template <typename T>
T& Graph<N, E>::
new_node ()
{
T* n (new T); //@@ auto
nodes_.insert (n);
return *n;
}
template <typename N, typename E>
template <typename T, typename A0>
T& Graph<N, E>::
new_node (A0 const& a0)
{
T* n (new T (a0)); //@@ auto
nodes_.insert (n);
return *n;
}
template <typename N, typename E>
template <typename T, typename A0, typename A1>
T& Graph<N, E>::
new_node (A0 const& a0, A1 const& a1)
{
T* n (new T (a0, a1)); //@@ auto
nodes_.insert (n);
return *n;
}
template <typename N, typename E>
template <typename T, typename A0, typename A1, typename A2>
T& Graph<N, E>::
new_node (A0 const& a0, A1 const& a1, A2 const& a2)
{
T* n (new T (a0, a1, a2)); //@@ auto
nodes_.insert (n);
return *n;
}
template <typename N, typename E>
template <typename T,
typename A0,
typename A1,
typename A2,
typename A3>
T& Graph<N, E>::
new_node (A0 const& a0, A1 const& a1, A2 const& a2, A3 const& a3)
{
T* n (new T (a0, a1, a2, a3)); //@@ auto
nodes_.insert (n);
return *n;
}
template <typename N, typename E>
void Graph<N, E>::
delete_node (N const& nr)
{
N* n (&nr);
for (E* e (n->remove_edge_ ()); e != 0; e = n->remove_edge_ ())
{
// One endpoint of the edge has removed this edge from
// its edge set. Now handle the other endpoint.
//
if (e->left_ () == n) e->right_ ()->remove_edge_ (e);
else e->left_ ()->remove_edge_ (e);
// Delete the edge.
//
edges_.erase (e);
delete e; //@@ auto
}
nodes_.erase (n);
delete n; //@@ auto
}
template <typename N, typename E>
template <typename T, typename X, typename Y>
T& Graph<N, E>::
new_edge (X& left, Y& right)
{
T* e (new T); //@@ auto
e->set_left_node (left);
e->set_right_node (right);
left.add_edge_left (*e);
right.add_edge_right (*e);
edges_.insert (e);
return *e;
}
template <typename N, typename E>
template <typename T, typename X, typename Y,
typename A0>
T& Graph<N, E>::
new_edge (X& left, Y& right, A0 const& a0)
{
T* e (new T (a0)); //@@ auto
e->set_left_node (left);
e->set_right_node (right);
left.add_edge_left (*e);
right.add_edge_right (*e);
edges_.insert (e);
return *e;
}
template <typename N, typename E>
template <typename T, typename X, typename Y,
typename A0,
typename A1>
T& Graph<N, E>::
new_edge (X& left, Y& right, A0 const& a0, A1 const& a1)
{
T* e (new T (a0, a1)); //@@ auto
e->set_left_node (left);
e->set_right_node (right);
left.add_edge_left (*e);
right.add_edge_right (*e);
edges_.insert (e);
return *e;
}
template <typename N, typename E>
void Graph<N, E>::
delete_edge (E const& er)
{
E* e (&er);
e->left_ ()->remove_edge_ (e);
e->right_ ()->remove_edge_ (e);
edges_.erase (e);
delete e; //@@ auto
}
template <typename N, typename E>
Graph<N, E>::
~Graph ()
{
//@@ auto
for (typename Edges_::iterator i (edges_.begin ()), end (edges_.end ());
i != end;
++i) delete *i;
for (typename Nodes_::iterator i (nodes_.begin ()), end (nodes_.end ());
i != end;
++i) delete *i;
}
}
}
}
|
