C++ Template Metaprogramming
Solutions to the exercises throughout the book
|
Tests functionality from Exercise 6-4. More...
Typedefs | |
typedef boost::mpl::copy< boost::mpl::vector_c< int, 17, 25, 10, 2, 11 >, binary_tree_inserter< tree<> > >::type | bst |
typedef binary_tree_search< bst, boost::mpl::int_< 20 > > | |
typedef binary_tree_search< bst, boost::mpl::int_< 11 > >::type | pos1 |
typedef binary_tree_search< bst, boost::mpl::int_< 20 > >::type | pos2 |
typedef boost::mpl::end< bst >::type | end_pos |
Functions | |
BOOST_STATIC_ASSERT ((!boost::mpl::equal_to< boost::mpl::int_< 11 >, boost::mpl::int_< 20 > >::value)) | |
BOOST_STATIC_ASSERT ((!boost::is_same< pos1, end_pos >::value)) | |
BOOST_STATIC_ASSERT ((boost::is_same< pos2, end_pos >::value)) | |
Tests functionality from Exercise 6-4.
typedef boost::mpl::copy<boost::mpl::vector_c<int,17,25,10,2,11>,binary_tree_inserter<tree<>>>::type anonymous_namespace{chapter-6.cpp}::test_6_4::bst |
Definition at line 134 of file chapter-6.cpp.
typedef boost::mpl::end<bst>::type anonymous_namespace{chapter-6.cpp}::test_6_4::end_pos |
Definition at line 138 of file chapter-6.cpp.
typedef binary_tree_search<bst,boost::mpl::int_<11>>::type anonymous_namespace{chapter-6.cpp}::test_6_4::pos1 |
Definition at line 136 of file chapter-6.cpp.
typedef binary_tree_search<bst,boost::mpl::int_<20>>::type anonymous_namespace{chapter-6.cpp}::test_6_4::pos2 |
Definition at line 137 of file chapter-6.cpp.
typedef binary_tree_search< bst, boost::mpl::int_<20> > anonymous_namespace{chapter-6.cpp}::test_6_4::qq |
Definition at line 135 of file chapter-6.cpp.
anonymous_namespace{chapter-6.cpp}::test_6_4::BOOST_STATIC_ASSERT | ( | (!boost::is_same< pos1, end_pos >::value) | ) |
anonymous_namespace{chapter-6.cpp}::test_6_4::BOOST_STATIC_ASSERT | ( | (!boost::mpl::equal_to< boost::mpl::int_< 11 >, boost::mpl::int_< 20 > >::value) | ) |