-
Notifications
You must be signed in to change notification settings - Fork 13
/
Copy pathscriptingVisitor.h
290 lines (225 loc) · 6.83 KB
/
scriptingVisitor.h
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
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
/*
Written by Antoine Savine in 2018
This code is the strict IP of Antoine Savine
License to use and alter this code for personal and commercial applications
is freely granted to any person or company who purchased a copy of the book
Modern Computational Finance: Scripting for Derivatives and XVA
Jesper Andreasen & Antoine Savine
Wiley, 2018
As long as this comment is preserved at the top of the file
*/
#pragma once
#include "visitorList.h"
struct Node;
// Base visitors
// V = concrete visitor (CRTP)
// V overloads visits to particular node types
// Other visits are caught in the base visitor
template <class V>
struct Visitor
{
// Visit a node with concrete visitor
// use this to hide the statc_cast
void visitNode(Node& node)
{
// static_cast : visit as concrete visitor
node.accept(static_cast<V&> (*this));
}
// Visit all the arguments with concrete (type V) visitor
void visitArguments(Node& node)
{
for (auto& arg : node.arguments)
{
// static_cast : visit as concrete visitor
arg->accept(static_cast<V&> (*this));
}
}
// Default catch all = visit arguments
void visit(Node& node)
{
// V does not declare a visit to that node type,
// either const or non const - fall back to default visit arguments
visitArguments(node);
}
};
// Const visitor
template <class V>
struct constVisitor
{
void visitNode(const Node& node)
{
// static_cast : visit as concrete visitor
node.accept(static_cast<V&> (*this));
}
void visitArguments(const Node& node)
{
for (const auto& arg : node.arguments)
{
// static_cast : visit as visitor of type V
arg->accept(static_cast<V&> (*this));
}
}
template <class NODE>
void visit(const NODE& node)
{
// Const visitors cannot declare non const visits: we check that and produce a compilation error
static_assert(!hasNonConstVisit<V>::forNodeType<NODE>(), "CONST VISITOR DECLARES A NON-CONST VISIT");
// V does not declare a visit to that node type,
// either const or non const - fall back to visiting arguments
visitArguments(node);
}
};
// Visitable classes
// Base Node must inherit visitableBase
// so it (automatically) declares pure virtual accept methods for all visitors on the list
// Concrete Nodes must inherit Visitable
// so they (automatically) declare overrides accepts for all visitors on the list
/*
Note that despite the complexity of that meta code, its use is trivial:
To declare struct Node : VisitableBase<Visitor1, Visitor2, ...> {};
is only sugar for :
struct Node
{
virtual void accept(Visitor1&) = 0;
virtual void accept(Visitor2&) = 0;
...
};
And to declare a concrete node (say, NodeAdd) as NodeAdd : Visitable<Node, AddNode, Visitor1, Visitor2, ...> {};
is sugar for:
struct NodeAdd : Node
{
void accept(Visitor1& v) override
{
v.visit(*this);
}
void accept(Visitor2& v) override
{
v.visit(*this);
}
...
};
*/
// Visitable Base
template <typename V, bool CONST>
struct BaseImpl;
template <typename V>
struct BaseImpl<V, false>
{
virtual void accept(V& visitor) = 0;
};
template <typename V>
struct BaseImpl<V, true>
{
virtual void accept(V& visitor) const = 0;
};
template <typename... Vs>
struct VisitableBase;
template <typename V>
struct VisitableBase<V> : BaseImpl<V, isVisitorConst<V>()>
{
using BaseImpl<V, isVisitorConst<V>()>::accept;
};
template <typename V, typename... Vs>
struct VisitableBase<V, Vs...> : VisitableBase<V>, VisitableBase<Vs...>
{
using VisitableBase<V>::accept;
using VisitableBase<Vs...>::accept;
};
// Visitable
template <typename V, typename Base, typename Concrete, bool CONST, typename... Vs>
struct DerImpl;
template <typename V, typename Base, typename Concrete>
struct DerImpl<V, Base, Concrete, false> : Base
{
void accept(V& visitor) override
{
visitor.visit(static_cast<Concrete&>(*this));
}
};
template <typename V, typename Base, typename Concrete>
struct DerImpl<V, Base, Concrete, true> : Base
{
void accept(V& visitor) const override
{
visitor.visit(static_cast<const Concrete&>(*this));
}
};
template <typename Base, typename Concrete, typename... Vs>
struct Visitable;
template <typename Base, typename Concrete, typename V>
struct Visitable<Base, Concrete, V> : DerImpl<V, Base, Concrete, isVisitorConst<V>()>
{
using DerImpl<V, Base, Concrete, isVisitorConst<V>()>::accept;
};
template <typename V, typename Base, typename Concrete, typename... Vs>
struct DerImpl<V, Base, Concrete, false, Vs...> : Visitable<Base, Concrete, Vs...>
{
using Visitable<Base, Concrete, Vs...>::accept;
void accept(V& visitor) override
{
visitor.visit(static_cast<Concrete&>(*this));
}
};
template <typename V, typename Base, typename Concrete, typename... Vs>
struct DerImpl<V, Base, Concrete, true, Vs...> : Visitable<Base, Concrete, Vs...>
{
using Visitable<Base, Concrete, Vs...>::accept;
void accept(V& visitor) const override
{
visitor.visit(static_cast<const Concrete&>(*this));
}
};
template <typename Base, typename Concrete, typename V, typename... Vs>
struct Visitable<Base, Concrete, V, Vs...> : DerImpl<V, Base, Concrete, isVisitorConst<V>(), Vs...>
{
using DerImpl<V, Base, Concrete, isVisitorConst<V>(), Vs...>::accept;
};
/*
Without const correctness : to be removed
// Visitablebase classes
// Base Node must inherit visitableBase
// Concrete Nodes must inherit Visitable
template <typename... Vs>
struct VisitableBase;
template <typename V>
struct VisitableBase<V>
{
virtual void accept(V& visitor) = 0;
virtual void accept(V& visitor) const = 0;
};
template <typename V, typename... Vs>
struct VisitableBase<V, Vs...> : VisitableBase<Vs...>
{
using VisitableBase<Vs...>::accept;
virtual void accept(V& visitor) = 0;
virtual void accept(V& visitor) const = 0;
};
// Visitable
template <typename Base, typename Concrete, typename... Vs>
struct Visitable;
template <typename Base, typename Concrete, typename V>
struct Visitable<Base, Concrete, V> : Base
{
void accept(V& visitor) override
{
visitor.visit(static_cast<Concrete&>(*this));
}
void accept(V& visitor) const override
{
visitor.visit(static_cast<const Concrete&>(*this));
}
};
template <typename Base, typename Concrete, typename V, typename... Vs>
struct Visitable<Base, Concrete, V, Vs...> : Visitable<Base, Concrete, Vs...>
{
using Visitable<Base, Concrete, Vs...>::accept;
void accept(V& visitor) override
{
visitor.visit(static_cast<Concrete&>(*this));
}
void accept(V& visitor) const override
{
visitor.visit(static_cast<const Concrete&>(*this));
}
};
*/