exercise-6-4.hpp File Reference

Solution to Exercise 6-4. More...

#include "chapter-5-tree.hpp"
#include "exercise-6-3.hpp"
#include <boost/mpl/end.hpp>
#include <boost/mpl/equal_to.hpp>
#include <boost/mpl/greater.hpp>
#include <boost/mpl/if.hpp>

Go to the source code of this file.

Classes
struct	exercise_6_4::tree_end
	Quick and dirty (non-iterator, I know) way to mark the end of the tree sequence... More...
struct	boost::mpl::end_impl< chapter5::tree_tag >
	Pass along our special "end" type. More...
struct	boost::mpl::end_impl< chapter5::tree_tag >::apply
struct	exercise_6_4::binary_tree_search< S, Elem >
	Perform a search on a binary tree structure. More...
struct	exercise_6_4::binary_tree_search< boost::mpl::void_, Elem >
	If we get an empty subtree, indicate that there is nothing found. More...
struct	exercise_6_4::binary_tree_search< chapter5::tree< Cur, L, R >, Elem >
	The usual binary tree logic. More...

Namespaces
namespace	exercise_6_4
	Encapsulate solution for Exercise 6-4.
namespace	boost
	Exists to inject functionality into the Boost namespace.
namespace	boost::mpl
	Exists to inject functionality into the Boost MPL namespace.

Detailed Description

Solution to Exercise 6-4.

Author

Matt Bisson

Definition in file exercise-6-4.hpp.