iterator_pair.h File Reference

#include <boost/iterator/iterator_adaptor.hpp>
#include <boost/tuple/tuple.hpp>
#include "source.h"

Include dependency graph for iterator_pair.h:

Go to the source code of this file.

Classes
struct	iterator_pair_types< sort_iter_type_, perm_iter_type_ >
	Helper class holding type definitions. More...
class	IteratorPair< sort_iter_type_, perm_iter_type_ >
	A combinator of two iterators that can be used to apply permutations on a second container when sorting the first. More...
struct	rightshift_iterator_pair
	A rightshift functor for tuples to be used with Boost's sorting function. More...

Namespaces
namespace	boost
namespace	boost::tuples

Functions
template<typename T , typename U >
void	boost::tuples::swap (boost::tuple< T &, U & > a, boost::tuple< T &, U & > b) noexcept
	Exchanges values of two two-element tuples.
template<class T1 , class T2 , class S1 , class S2 >
bool	boost::tuples::operator< (const cons< T1, T2 > &lhs, const cons< S1, S2 > &rhs)
	Less than relational operator for Boost tuples.
template<class sort_iter_type_ , class perm_iter_type_ >
IteratorPair< sort_iter_type_, perm_iter_type_ >	make_iterator_pair (sort_iter_type_ sort_iter, perm_iter_type_ perm_iter)
	Creates an IteratorPair object, deducing iterator types from the types of arguments.

Function Documentation

make_iterator_pair()

template<class sort_iter_type_ , class perm_iter_type_ >

IteratorPair< sort_iter_type_, perm_iter_type_ > make_iterator_pair	(	sort_iter_type_	sort_iter,
		perm_iter_type_	perm_iter
	)

Creates an IteratorPair object, deducing iterator types from the types of arguments.

Template Parameters

sort_iter_type_	Iterator type of the container being sorted.
perm_iter_type_	Iterator type of the container being permuted.

Referenced by nest::sort().

Here is the caller graph for this function: