File: cons.cpp

package info (click to toggle)
boost1.74 1.74.0-9
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 464,084 kB
  • sloc: cpp: 3,338,324; xml: 131,293; python: 33,088; ansic: 14,336; asm: 4,034; sh: 3,351; makefile: 1,193; perl: 1,036; yacc: 478; php: 212; ruby: 102; lisp: 24; sql: 13; csh: 6
file content (95 lines) | stat: -rw-r--r-- 2,843 bytes parent folder | download | duplicates (13)
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
/*=============================================================================
    Copyright (c) 2001-2011 Joel de Guzman
    Copyright (c) 2005 Eric Niebler

    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 <string>
#include <boost/detail/lightweight_test.hpp>
#include <boost/fusion/container/list/cons.hpp>
#include <boost/fusion/container/generation/make_cons.hpp>
#include <boost/fusion/container/generation/cons_tie.hpp>
#include <boost/fusion/container/vector/vector.hpp>
#include <boost/fusion/container/generation/make_vector.hpp>
#include <boost/fusion/sequence/comparison/equal_to.hpp>
#include <boost/lambda/lambda.hpp>
#include <boost/fusion/algorithm/iteration/for_each.hpp>
#include <boost/fusion/algorithm/transformation/filter_if.hpp>
#include <boost/fusion/algorithm/transformation/push_front.hpp>
#include <boost/fusion/sequence/io/out.hpp>

#include <boost/type_traits/is_same.hpp>
#include <boost/mpl/lambda.hpp>

int
main()
{
    using namespace boost::fusion;
    using boost::is_same;
    namespace fusion = boost::fusion;

    std::cout << tuple_open('[');
    std::cout << tuple_close(']');
    std::cout << tuple_delimiter(", ");

/// Testing cons
    
    {
        std::string hello("hello");
        cons<int, cons<std::string> > ns =
            make_cons(1, make_cons(hello));

        BOOST_TEST((*begin(ns) == 1));
        BOOST_TEST((*fusion::next(begin(ns)) == hello));

        *begin(ns) += 1;
        *fusion::next(begin(ns)) += ' ';

        BOOST_TEST((*begin(ns) == 2));
        BOOST_TEST((*fusion::next(begin(ns)) == hello + ' '));

        for_each(ns, boost::lambda::_1 += ' ');

        BOOST_TEST((*begin(ns) == 2 + ' '));
        BOOST_TEST((*fusion::next(begin(ns)) == hello + ' ' + ' '));
    }

    {
        BOOST_TEST(
            make_cons("hello") == make_vector(std::string("hello"))
        );

        BOOST_TEST(
            make_cons(123, make_cons("hello")) == 
            make_vector(123, std::string("hello"))
        );
    }

    {
        vector<int, float> t(1, 1.1f);
        cons<int, cons<float> > nf =
            make_cons(1, make_cons(1.1f));

        BOOST_TEST((t == nf));
        BOOST_TEST((vector<int>(1) == filter_if<is_same<boost::mpl::_, int> >(nf)));

        std::cout << nf << std::endl;
        std::cout << filter_if<is_same<boost::mpl::_, int> >(nf) << std::endl;
    }
    
    {
        int i = 3;
        cons<int&> tie(cons_tie(i));
        BOOST_TEST((*begin(tie) == 3));
    }

    {
        // This used to trigger a hard compilation error:
        cons<cons<int> > xs;
        begin(push_front(xs, 3));
    }

    return boost::report_errors();
}