📄 for_each_s.cpp
字号:
/*============================================================================= Copyright (c) 2001-2006 Joel de Guzman, 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 <boost/detail/lightweight_test.hpp>#include <boost/fusion/container/vector/vector.hpp>#include <boost/fusion/adapted/mpl.hpp>#include <boost/fusion/sequence/io/out.hpp>#include <boost/fusion/algorithm/iteration/ext_/for_each_s.hpp>#include <boost/mpl/vector_c.hpp>#include <boost/fusion/container/generation/make_vector.hpp>#include <boost/fusion/container/ext_/tree.hpp>struct print{ template <typename T> void operator()(T const& v) const { std::cout << "[ " << v << " ] "; }};struct increment{ template <typename T> void operator()(T& v) const { ++v; }};intmain(){ using namespace boost::fusion; using boost::mpl::vector_c; namespace fusion = boost::fusion; { typedef vector<int, char, double, char const*> vector_type; vector_type v(1, 'x', 3.3, "Ruby"); for_each_s(v, print()); std::cout << std::endl; } { typedef vector<int, char, double, char const*> vector_type; vector_type v(1, 'x', 3.3, "Ruby"); for_each_s(v, increment()); std::cout << v << std::endl; } { typedef vector_c<int, 2, 3, 4, 5, 6> mpl_vec; fusion::for_each_s(mpl_vec(), print()); std::cout << std::endl; } { fusion::for_each_s( 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();}
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -