Exercise 5-5

Add algorithms for tiny. More...

Classes
struct	chapter5::tiny_erase< S, First, Last >
	Erase a range of elements from a tiny sequence. More...
struct	chapter5::tiny_erase< S, 0, 1 >
struct	chapter5::tiny_erase< S, 0, 2 >
struct	chapter5::tiny_erase< S, 0, 3 >
struct	chapter5::tiny_erase< S, 1, 2 >
struct	chapter5::tiny_erase< S, 1, 3 >
struct	chapter5::tiny_erase< S, 2, 3 >
struct	boost::mpl::erase_impl< chapter5::tiny_tag >
	Use our tiny_erase to form the new sequence in O(1) time. More...
struct	boost::mpl::pop_back_impl< chapter5::tiny_tag >
	This forwards operation to the erase metafunction. More...
struct	boost::mpl::pop_front_impl< chapter5::tiny_tag >
	This forwards operation to the erase metafunction. More...

Functions
static void	anonymous_namespace{chapter-5.cpp}::test_exercise_5_5 ()
	Tests for Exercise 5-5.

Detailed Description

Add algorithms for tiny.

5-5. Implement the pop_front, pop_back, and erase algorithms for tiny.

Function Documentation

test_exercise_5_5()

static void anonymous_namespace{chapter-5.cpp}::test_exercise_5_5 ( )

static

Tests for Exercise 5-5.

Definition at line 239 of file chapter-5.cpp.