#include <iostream>

#ifndef RECURSIVE
#include "product_view.h"
#else
#include "recursive_product_view.h"
#endif

#include <boost/mpl/list.hpp>
#include <boost/mpl/vector.hpp>
#include <boost/mpl/vector_c.hpp>
#include <boost/mpl/list_c.hpp>
#include <boost/mpl/for_each.hpp>
#include <boost/mpl/eval_if.hpp>

#include <boost/preprocessor/repetition/enum.hpp>
#include <boost/preprocessor/arithmetic/inc.hpp>
#include <boost/preprocessor/arithmetic/mul.hpp>

using namespace boost::mpl;

#define ITEM(_1,n,_3)	list_c< int, BOOST_PP_MUL(n,2), BOOST_PP_INC(BOOST_PP_MUL(n,2)) >

typedef	list<
BOOST_PP_ENUM(COUNT,ITEM,)
>	
	ALot;

struct print
{
	template<typename T, T N> void operator()( integral_c<T,N> )
	{
		std::cout << N << ' ';
	}

	template<typename L> void operator()( L ) {
		std::cout << "[ ";
		for_each<L>( print() );
		std::cout << "] ";
	}
};
int main()
{
	std::cout << "Source list:\n";
	print()( ALot() );
	std::cout << "\nPermutations:\n";
	print()( product_view<ALot>() );
	std::cout << std::endl;

	return 0;
}