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
|
/***************************************************************************
* Copyright (c) Johan Mabille, Sylvain Corlay and Wolf Vollprecht *
* Copyright (c) QuantStack *
* *
* Distributed under the terms of the BSD 3-Clause License. *
* *
* The full license is in the file LICENSE, distributed with this software. *
****************************************************************************/
#include "xtl/xvisitor.hpp"
#include "gtest/gtest.h"
namespace xtl
{
class root : public base_visitable<int, false>
{
public:
XTL_DEFINE_VISITABLE()
};
class leaf_one : public root
{
public:
XTL_DEFINE_VISITABLE()
};
class leaf_two : public root
{
public:
XTL_DEFINE_VISITABLE()
};
class acyclic_visitor_tester
: public base_visitor
, public visitor<mpl::vector<leaf_one, leaf_two>, int, false>
{
public:
int visit(leaf_one&) override
{
return 1;
}
int visit(leaf_two&) override
{
return 2;
}
};
TEST(visitor, acyclic_visitor)
{
leaf_one l1;
leaf_two l2;
root* r1 = &l1;
root* r2 = &l2;
acyclic_visitor_tester t;
int res1 = r1->accept(t);
EXPECT_EQ(res1, 1);
int res2 = r2->accept(t);
EXPECT_EQ(res2, 2);
}
class const_root : public base_visitable<int, true>
{
public:
XTL_DEFINE_CONST_VISITABLE()
};
class const_leaf_one : public const_root
{
public:
XTL_DEFINE_CONST_VISITABLE()
};
class const_leaf_two : public const_root
{
public:
XTL_DEFINE_CONST_VISITABLE()
};
class const_acyclic_visitor_tester
: public base_visitor
, public visitor<mpl::vector<const_leaf_one, const_leaf_two>, int, true>
{
public:
int visit(const const_leaf_one&) override
{
return 1;
}
int visit(const const_leaf_two&) override
{
return 2;
}
};
TEST(visitor, const_acyclic_visitor)
{
const_leaf_one l1;
const_leaf_two l2;
const_root* r1 = &l1;
const_root* r2 = &l2;
const_acyclic_visitor_tester t;
int res1 = r1->accept(t);
EXPECT_EQ(res1, 1);
int res2 = r2->accept(t);
EXPECT_EQ(res2, 2);
}
class cleaf_one;
class cleaf_two;
class cyclic_visitor_tester
: public cyclic_visitor<mpl::vector<cleaf_one, cleaf_two>, int, false>
{
public:
int visit(cleaf_one&) override
{
return 1;
}
int visit(cleaf_two&) override
{
return 2;
}
};
class croot
{
public:
virtual int accept(cyclic_visitor_tester&) = 0;
};
class cleaf_one : public croot
{
public:
XTL_DEFINE_CYCLIC_VISITABLE(cyclic_visitor_tester)
};
class cleaf_two : public croot
{
public:
XTL_DEFINE_CYCLIC_VISITABLE(cyclic_visitor_tester)
};
TEST(visitor, cyclic_visitor)
{
cleaf_one l1;
cleaf_two l2;
croot* r1 = &l1;
croot* r2 = &l2;
cyclic_visitor_tester t;
int res1 = r1->accept(t);
EXPECT_EQ(res1, 1);
int res2 = r2->accept(t);
EXPECT_EQ(res2, 2);
}
class ccleaf_one;
class ccleaf_two;
class ccyclic_visitor_tester
: public cyclic_visitor<mpl::vector<ccleaf_one, ccleaf_two>, int, true>
{
public:
int visit(const ccleaf_one&) override
{
return 1;
}
int visit(const ccleaf_two&) override
{
return 2;
}
};
class ccroot
{
public:
virtual int accept(ccyclic_visitor_tester&) const = 0;
};
class ccleaf_one : public ccroot
{
public:
XTL_DEFINE_CONST_CYCLIC_VISITABLE(ccyclic_visitor_tester)
};
class ccleaf_two : public ccroot
{
public:
XTL_DEFINE_CONST_CYCLIC_VISITABLE(ccyclic_visitor_tester)
};
TEST(visitor, const_cyclic_visitor)
{
ccleaf_one l1;
ccleaf_two l2;
ccroot* r1 = &l1;
ccroot* r2 = &l2;
ccyclic_visitor_tester t;
int res1 = r1->accept(t);
EXPECT_EQ(res1, 1);
int res2 = r2->accept(t);
EXPECT_EQ(res2, 2);
}
}
|
