exercise-5-9.hpp File Reference

Solution to Exercise 5-9. More...

#include "exercise-5-8.hpp"

Go to the source code of this file.

Classes
struct	boost::mpl::next< exercise_5_8::fibonacci_series_iterator< 1134903170, 701408733 > >
	Establish an end (based on 32-bit signed int size). More...
struct	boost::mpl::prior< exercise_5_8::fibonacci_series_iterator< N, LastN > >
	Backward iteration is computable easily. More...
struct	boost::mpl::prior< exercise_5_8::fibonacci_series_iterator< 1, 1 > >
	Special case because we chose an irregular "begin" iterator value. More...
struct	boost::mpl::prior< exercise_5_8::fibonacci_series_iterator< 0, 1 > >
	Don't go before 0... More...

Namespaces
namespace	boost
	Exists to inject functionality into the Boost namespace.
namespace	boost::mpl
	Exists to inject functionality into the Boost MPL namespace.

Variables
static size_t const	sMaxFibForInt32 = 45
	For a 32-bit signed integer, the max Fibonacci sequence seems to be this.

Detailed Description

Solution to Exercise 5-9.

Author

Matt Bisson

Definition in file exercise-5-9.hpp.

Variable Documentation

sMaxFibForInt32

size_t const sMaxFibForInt32 = 45

static

For a 32-bit signed integer, the max Fibonacci sequence seems to be this.

Definition at line 33 of file exercise-5-9.hpp.