14#include <boost/mpl/copy.hpp>
15#include <boost/mpl/placeholders.hpp>
16#include <boost/mpl/vector_c.hpp>
17using namespace boost::mpl::placeholders;
58template <
typename S,
typename Op = boost::mpl::push_back<_, _> >
66typedef boost::mpl::copy<
67 boost::mpl::vector_c<int, 17, 25, 10, 2, 11>,
Augment the chapter5::tree sequence API to allow addition of elements.
Encapsulate solution for Exercise 6-3.
boost::mpl::copy< boost::mpl::vector_c< int, 17, 25, 10, 2, 11 >, binary_tree_inserter< chapter5::tree<> > >::type bst
A sorted binary tree copied from the source vector.
Basically indistinguishable from from any other inserter since we have a generic insert metafunction.