1 /*=============================================================================
2 Copyright (c) 2001-2011 Joel de Guzman
3
4 Distributed under the Boost Software License, Version 1.0. (See accompanying
5 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
6 ==============================================================================*/
7 #include <boost/detail/lightweight_test.hpp>
8 #include <boost/fusion/container/vector/vector.hpp>
9 #include <boost/fusion/container/list/list.hpp>
10 #include <boost/fusion/adapted/mpl.hpp>
11 #include <boost/fusion/sequence/io/out.hpp>
12 #include <boost/fusion/sequence/comparison/equal_to.hpp>
13 #include <boost/fusion/container/generation/make_vector.hpp>
14 #include <boost/fusion/container/generation/make_list.hpp>
15 #include <boost/fusion/algorithm/transformation/pop_back.hpp>
16 #include <boost/fusion/algorithm/transformation/push_back.hpp>
17 #include <boost/fusion/algorithm/query/find.hpp>
18 #include <boost/fusion/include/back.hpp>
19 #include <boost/fusion/include/array.hpp>
20 #include <boost/array.hpp>
21 #include <boost/mpl/vector_c.hpp>
22
23 int
main()24 main()
25 {
26 using namespace boost::fusion;
27
28 std::cout << tuple_open('[');
29 std::cout << tuple_close(']');
30 std::cout << tuple_delimiter(", ");
31
32 /// Testing pop_back
33
34 {
35 char const* s = "Ruby";
36 typedef vector<int, char, double, char const*> vector_type;
37 vector_type t1(1, 'x', 3.3, s);
38
39 {
40 std::cout << pop_back(t1) << std::endl;
41 BOOST_TEST((pop_back(t1) == make_vector(1, 'x', 3.3)));
42 }
43 }
44
45 {
46 typedef boost::mpl::vector_c<int, 1, 2, 3, 4, 5> mpl_vec;
47 std::cout << boost::fusion::pop_back(mpl_vec()) << std::endl;
48 BOOST_TEST((boost::fusion::pop_back(mpl_vec()) == make_vector(1, 2, 3, 4)));
49 }
50
51 {
52 list<int, int> l(1, 2);
53 std::cout << pop_back(l) << std::endl;
54 BOOST_TEST((pop_back(l) == make_list(1)));
55 }
56
57 { // make sure empty sequences are OK
58 list<int> l(1);
59 std::cout << pop_back(l) << std::endl;
60 BOOST_TEST((pop_back(l) == make_list()));
61 }
62
63 {
64 single_view<int> sv(1);
65 std::cout << pop_back(sv) << std::endl;
66
67 // Compile check only
68 (void)(begin(pop_back(sv)) == end(sv));
69 (void)(end(pop_back(sv)) == begin(sv));
70 }
71
72 // $$$ JDG: TODO add compile fail facility $$$
73 //~ { // compile fail check (Disabled for now)
74 //~ list<> l;
75 //~ std::cout << pop_back(l) << std::endl;
76 //~ }
77
78 #ifndef BOOST_NO_CXX11_AUTO_DECLARATIONS
79 {
80 auto vec = make_vector(1, 3.14, "hello");
81
82 // Compile check only
83 auto popv = pop_back(vec);
84 std::cout << popv << std::endl;
85
86 auto push = push_back(vec, 42);
87 auto pop = pop_back(vec);
88 auto i1 = find<int>(popv);
89 auto i2 = find<double>(pop);
90
91 (void)push;
92 BOOST_TEST(i1 != end(pop));
93 BOOST_TEST(i2 != end(pop));
94 BOOST_TEST(i1 != i2);
95 }
96 #endif
97
98 {
99 boost::array<std::size_t, 2> a = {{ 10, 50 }};
100 BOOST_TEST(back(pop_back(a)) == 10);
101 }
102
103 return boost::report_errors();
104 }
105
106