Node Algorithms

Classes
class	dancing_links
	An optimized implementation of the 1-cover problem [class under review]. More...

Functions
template<typename I>
I	reverse_append (I first, I last, I result)
template<typename R, typename I>
I	reverse_append (R &range, I result)
template<typename I>
I	reverse_nodes (I first, I last)
template<typename R>
boost::range_iterator< R >::type	reverse_nodes (R &range)

Detailed Description

Function Documentation

reverse_append() [1/2]

template<typename I>

I reverse_append	(	I	first,
		I	last,
		I	result )

Definition at line 45 of file reverse.hpp.

reverse_append() [2/2]

template<typename R, typename I>

I reverse_append	(	R &	range,
		I	result )

Definition at line 61 of file reverse.hpp.

reverse_nodes() [1/2]

template<typename I>

I reverse_nodes	(	I	first,
		I	last )

Definition at line 69 of file reverse.hpp.

reverse_nodes() [2/2]

template<typename R>

boost::range_iterator< R >::type reverse_nodes

(

R &

range

)

Definition at line 77 of file reverse.hpp.