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
|
/*=============================================================================
Copyright (c) 2009 Hartmut Kaiser
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
==============================================================================*/
#include <boost/detail/lightweight_test.hpp>
#include <boost/fusion/include/vector.hpp>
#include <boost/fusion/include/struct.hpp>
#include <boost/fusion/include/equal_to.hpp>
#include <boost/fusion/include/io.hpp>
#include <boost/fusion/include/nview.hpp>
#include <string>
#include <iostream>
struct test {
int int_;
std::string string_;
double double_;
};
BOOST_FUSION_ADAPT_STRUCT(
test,
(int, int_)
(std::string, string_)
(double, double_)
)
namespace fusion = boost::fusion;
template <typename Sequence>
bool check_size(Sequence const& s, int seqsize)
{
return fusion::size(s) == seqsize;
}
template <typename Sequence, typename T>
bool check_deref_begin(Sequence const& s, T val)
{
return fusion::deref(fusion::begin(s)) == val;
}
template <typename Sequence, typename T>
bool check_deref_next(Sequence const& s, T val)
{
return fusion::deref(fusion::next(fusion::begin(s))) == val;
}
template <int N, typename Sequence, typename T>
bool check_deref_advance(Sequence const& s, T val)
{
return fusion::deref(fusion::advance_c<N>(fusion::begin(s))) == val;
}
template <typename Sequence, typename T>
bool check_deref_prior(Sequence const& s, T val)
{
return fusion::deref(fusion::prior(fusion::end(s))) == val;
}
template <int N, typename Sequence, typename T>
bool check_at(Sequence const& s, T val)
{
return fusion::at_c<N>(s) == val;
}
template <typename Sequence>
bool check_distance(Sequence const& s, int val)
{
return fusion::distance(fusion::begin(s), fusion::end(s)) == val;
}
int main()
{
test t;
t.int_ = 1;
t.string_ = "test";
t.double_ = 2.0;
using fusion::as_nview;
// check size()
{
BOOST_TEST(check_size(as_nview<0>(t), 1));
BOOST_TEST(check_size(as_nview<2, 1>(t), 2));
BOOST_TEST(check_size(as_nview<2, 1, 0>(t), 3));
BOOST_TEST(check_size(as_nview<2, 1, 0, 2, 0>(t), 5));
}
// check deref/begin
{
BOOST_TEST(check_deref_begin(as_nview<0>(t), 1));
BOOST_TEST(check_deref_begin(as_nview<2, 1>(t), 2.0));
BOOST_TEST(check_deref_begin(as_nview<1, 2, 0>(t), "test"));
BOOST_TEST(check_deref_begin(as_nview<2, 1, 0, 2, 0>(t), 2.0));
}
// check deref/next
{
BOOST_TEST(check_deref_next(as_nview<2, 1>(t), "test"));
BOOST_TEST(check_deref_next(as_nview<1, 2, 0>(t), 2.0));
BOOST_TEST(check_deref_next(as_nview<2, 0, 1, 2, 0>(t), 1));
}
// check deref/advance
{
BOOST_TEST(check_deref_advance<0>(as_nview<2, 1>(t), 2.0));
BOOST_TEST(check_deref_advance<2>(as_nview<1, 2, 0>(t), 1));
BOOST_TEST(check_deref_advance<4>(as_nview<2, 0, 1, 2, 0>(t), 1));
}
// check deref/prior
{
BOOST_TEST(check_deref_prior(as_nview<2, 1>(t), "test"));
BOOST_TEST(check_deref_prior(as_nview<1, 2, 0>(t), 1));
BOOST_TEST(check_deref_prior(as_nview<2, 0, 1, 2, 0>(t), 1));
}
// check at
{
BOOST_TEST(check_at<0>(as_nview<0>(t), 1));
BOOST_TEST(check_at<1>(as_nview<2, 1>(t), "test"));
BOOST_TEST(check_at<2>(as_nview<1, 2, 0>(t), 1));
BOOST_TEST(check_at<4>(as_nview<2, 1, 0, 2, 0>(t), 1));
}
// check distance
{
BOOST_TEST(check_distance(as_nview<0>(t), 1));
BOOST_TEST(check_distance(as_nview<2, 1>(t), 2));
BOOST_TEST(check_distance(as_nview<1, 2, 0>(t), 3));
BOOST_TEST(check_distance(as_nview<2, 1, 0, 2, 0>(t), 5));
}
return boost::report_errors();
}
|
