All about the MPL algorithms. More...

Modules
	Exercise 6-0
	Find the smallest type in a sequence with `boost::mpl::copy`.

	Exercise 6-1
	Implement a binary to decimal converter as a sequence of binary digits.

	Exercise 6-2
	Why is there no `for_each`?

	Exercise 6-3
	Insert into a binary tree.

	Exercise 6-4
	Search a binary tree structure using an inserter.

	Exercise 6-5
	Differences between STL algorithms and MPL ones.

Files
file	chapter-6-tree.hpp
	Augment the chapter5::tree sequence API to allow addition of elements.

file	chapter-6.cpp
	Test application for Chapter 6.

Classes
struct	boost::mpl::push_back_impl< chapter5::tree_tag >
	Alter a tree structure by adding an element with sorted placement. More...

Detailed Description

All about the MPL algorithms.

C++ Template Metaprogramming: Concepts, Tools, and Techniques from Boost and Beyond.

Modules