Node Algorithms [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)

---

Function Documentation

I adobe::unsafe::reverse_append	(	I	first,
		I	last,
		I	result
	)

Definition at line 45 of file reverse.hpp.

I adobe::unsafe::reverse_append	(	R &	range,
		I	result
	)

Definition at line 62 of file reverse.hpp.

I adobe::unsafe::reverse_nodes	(	I	first,
		I	last
	)

Definition at line 71 of file reverse.hpp.

boost::range_iterator<R>::type adobe::unsafe::reverse_nodes

(

R &

range )

Definition at line 80 of file reverse.hpp.