Files
fusion/test/algorithm/segmented_for_each.cpp
T

50 lines
1.4 KiB
C++
Raw Normal View History

2006-10-05 01:25:32 +00:00
/*=============================================================================
2011-09-16 05:27:16 +00:00
Copyright (c) 2001-2011 Joel de Guzman
Copyright (c) 2011 Eric Niebler
2006-10-05 01:25:32 +00:00
2007-03-02 10:44:14 +00:00
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)
2006-10-05 01:25:32 +00:00
==============================================================================*/
#include <boost/detail/lightweight_test.hpp>
2007-10-24 02:32:28 +00:00
#include <boost/fusion/container/vector/vector.hpp>
2011-08-18 22:09:59 +00:00
#include <boost/fusion/algorithm/iteration/for_each.hpp>
2007-11-06 12:13:52 +00:00
#include <boost/fusion/container/generation/make_vector.hpp>
2011-08-16 23:43:24 +00:00
#include "../sequence/tree.hpp"
2006-10-05 01:25:32 +00:00
struct print
{
template <typename T>
void operator()(T const& v) const
{
std::cout << "[ " << v << " ] ";
}
};
int
main()
{
using namespace boost::fusion;
{
2011-08-18 22:09:59 +00:00
for_each(
2006-10-05 01:25:32 +00:00
make_tree(
make_vector(double(0),'B')
, make_tree(
make_vector(1,2,long(3))
, make_tree(make_vector('a','b','c'))
, make_tree(make_vector(short('d'),'e','f'))
)
, make_tree(
make_vector(4,5,6)
, make_tree(make_vector(float(1),'h','i'))
, make_tree(make_vector('j','k','l'))
)
)
, print()
);
}
return boost::report_errors();
}