Ticket #4444: seq_push_back.cpp

//Purpose:
//  See if empty list can be created and then
//  have elements appended to it.
//
//Without variadic fusion and with gcc4_4n.
//
#include <boost/fusion/container/list.hpp>
#include <boost/fusion/include/size.hpp>
#include <boost/fusion/algorithm/transformation/push_back.hpp>
#include <boost/fusion/sequence/io.hpp>

#include <iostream>
#include <typeinfo>

namespace boost
{
namespace fusion
{
namespace sandbox
{
    struct joint_like
    {
        int m0;
        int m1;
        joint_like(int a0, int a1)
        : m0(a0)
        , m1(a1)
        {}
    };

    void run(void)
    {
        typedef list<> seq_t0;
        seq_t0 seq_v0;
        std::cout<<"size(seq_v0)="<<size(seq_v0)<<"\n";
            typedef
        #if 1
          result_of::push_back<seq_t0,int>::type
        #else
          list<int>
        #endif
        seq_t1;
        #if 1
          seq_t1
        #else
          auto
        #endif 
        seq_v1(push_back(seq_v0,int(1)));
        std::cout<<"seq_v1="<<seq_v1<<"\n";
        std::cout<<"typeid(seq_v1)="<<typeid(seq_v1).name()<<"\n";
        joint_like j0(2,3);
        joint_like j1(j0);
        std::cout<<"j1.m0="<<j1.m0<<"\n";
    }
}//exit sandbox
}//exit fusion
}//exit boost
int main(void)
{
    boost::fusion::sandbox::run();
    return 0;
}