Classes
class	combined_range

class	index_value

class	joined_range

Functions
template<typename ForwardRange >
range_iterator< ForwardRange > ::type	adjacent_find (ForwardRange &rng)
	template function adjacent_find More...

template<typename ForwardRange >
range_iterator< const ForwardRange >::type	adjacent_find (const ForwardRange &rng)

template<typename ForwardRange , typename BinaryPredicate >
range_iterator< ForwardRange > ::type	adjacent_find (ForwardRange &rng, BinaryPredicate pred)

template<typename ForwardRange , typename BinaryPredicate >
range_iterator< const ForwardRange >::type	adjacent_find (const ForwardRange &rng, BinaryPredicate pred)

template<range_return_value re, typename ForwardRange >
range_return< ForwardRange, re > ::type	adjacent_find (ForwardRange &rng)

template<range_return_value re, typename ForwardRange >
range_return< const ForwardRange, re >::type	adjacent_find (const ForwardRange &rng)

template<range_return_value re, typename ForwardRange , typename BinaryPredicate >
range_return< ForwardRange, re > ::type	adjacent_find (ForwardRange &rng, BinaryPredicate pred)

template<range_return_value re, typename ForwardRange , typename BinaryPredicate >
range_return< const ForwardRange, re >::type	adjacent_find (const ForwardRange &rng, BinaryPredicate pred)

template<class ForwardRange , class Value >
bool	binary_search (const ForwardRange &rng, const Value &val)
	template function binary_search More...

template<class ForwardRange , class Value , class BinaryPredicate >
bool	binary_search (const ForwardRange &rng, const Value &val, BinaryPredicate pred)

template<class SinglePassRange , class OutputIterator >
OutputIterator	copy (const SinglePassRange &rng, OutputIterator out)
	template function copy More...

template<class BidirectionalRange , class BidirectionalTraversalWriteableIterator >
BidirectionalTraversalWriteableIterator	copy_backward (const BidirectionalRange &rng, BidirectionalTraversalWriteableIterator out)
	template function copy_backward More...

template<class SinglePassRange , class Value >
BOOST_DEDUCED_TYPENAME range_difference < SinglePassRange >::type	count (SinglePassRange &rng, const Value &val)
	template function count More...

template<class SinglePassRange , class Value >
BOOST_DEDUCED_TYPENAME range_difference < SinglePassRange const > ::type	count (const SinglePassRange &rng, const Value &val)

template<class SinglePassRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME boost::range_difference < SinglePassRange >::type	count_if (SinglePassRange &rng, UnaryPredicate pred)
	template function count_if More...

template<class SinglePassRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME boost::range_difference< const SinglePassRange >::type	count_if (const SinglePassRange &rng, UnaryPredicate pred)

template<class SinglePassRange1 , class SinglePassRange2 >
bool	equal (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2)
	template function equal More...

template<class SinglePassRange1 , class SinglePassRange2 , class BinaryPredicate >
bool	equal (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, BinaryPredicate pred)

template<class ForwardRange , class Value >
std::pair < BOOST_DEDUCED_TYPENAME boost::range_iterator < ForwardRange >::type, BOOST_DEDUCED_TYPENAME boost::range_iterator < ForwardRange >::type >	equal_range (ForwardRange &rng, const Value &val)
	template function equal_range More...

template<class ForwardRange , class Value >
std::pair < BOOST_DEDUCED_TYPENAME boost::range_iterator< const ForwardRange >::type, BOOST_DEDUCED_TYPENAME boost::range_iterator< const ForwardRange >::type >	equal_range (const ForwardRange &rng, const Value &val)

template<class ForwardRange , class Value , class SortPredicate >
std::pair < BOOST_DEDUCED_TYPENAME boost::range_iterator < ForwardRange >::type, BOOST_DEDUCED_TYPENAME boost::range_iterator < ForwardRange >::type >	equal_range (ForwardRange &rng, const Value &val, SortPredicate pred)

template<class ForwardRange , class Value , class SortPredicate >
std::pair < BOOST_DEDUCED_TYPENAME boost::range_iterator< const ForwardRange >::type, BOOST_DEDUCED_TYPENAME boost::range_iterator< const ForwardRange >::type >	equal_range (const ForwardRange &rng, const Value &val, SortPredicate pred)

template<class ForwardRange , class Value >
ForwardRange &	fill (ForwardRange &rng, const Value &val)
	template function fill More...

template<class ForwardRange , class Value >
const ForwardRange &	fill (const ForwardRange &rng, const Value &val)

template<class ForwardRange , class Size , class Value >
ForwardRange &	fill_n (ForwardRange &rng, Size n, const Value &val)
	template function fill_n More...

template<class ForwardRange , class Size , class Value >
const ForwardRange &	fill_n (const ForwardRange &rng, Size n, const Value &val)

template<class SinglePassRange , class Value >
BOOST_DEDUCED_TYPENAME disable_if< is_const < SinglePassRange > , BOOST_DEDUCED_TYPENAME range_iterator < SinglePassRange >::type > ::type	find (SinglePassRange &rng, const Value &val)
	template function find More...

template<class SinglePassRange , class Value >
BOOST_DEDUCED_TYPENAME range_iterator< const SinglePassRange >::type	find (const SinglePassRange &rng, const Value &val)

template<range_return_value re, class SinglePassRange , class Value >
BOOST_DEDUCED_TYPENAME disable_if< is_const < SinglePassRange > , BOOST_DEDUCED_TYPENAME range_return< SinglePassRange, re >::type >::type	find (SinglePassRange &rng, const Value &val)

template<range_return_value re, class SinglePassRange , class Value >
BOOST_DEDUCED_TYPENAME range_return< const SinglePassRange, re >::type	find (const SinglePassRange &rng, const Value &val)

template<class ForwardRange1 , class ForwardRange2 >
BOOST_DEDUCED_TYPENAME disable_if< is_const < ForwardRange1 > , BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange1 > ::type >::type	find_end (ForwardRange1 &rng1, const ForwardRange2 &rng2)
	template function find_end More...

template<class ForwardRange1 , class ForwardRange2 >
BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange1 >::type	find_end (const ForwardRange1 &rng1, const ForwardRange2 &rng2)

template<class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME disable_if< is_const < ForwardRange1 > , BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange1 > ::type >::type	find_end (ForwardRange1 &rng1, const ForwardRange2 &rng2, BinaryPredicate pred)

template<class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange1 >::type	find_end (const ForwardRange1 &rng1, const ForwardRange2 &rng2, BinaryPredicate pred)

template<range_return_value re, class ForwardRange1 , class ForwardRange2 >
BOOST_DEDUCED_TYPENAME disable_if< is_const < ForwardRange1 > , BOOST_DEDUCED_TYPENAME range_return< ForwardRange1, re >::type >::type	find_end (ForwardRange1 &rng1, const ForwardRange2 &rng2)

template<range_return_value re, class ForwardRange1 , class ForwardRange2 >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange1, re >::type	find_end (const ForwardRange1 &rng1, const ForwardRange2 &rng2)

template<range_return_value re, class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME disable_if< is_const < ForwardRange1 > , BOOST_DEDUCED_TYPENAME range_return< ForwardRange1, re >::type >::type	find_end (ForwardRange1 &rng1, const ForwardRange2 &rng2, BinaryPredicate pred)

template<range_return_value re, class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange1, re >::type	find_end (const ForwardRange1 &rng1, const ForwardRange2 &rng2, BinaryPredicate pred)

template<class SinglePassRange1 , class ForwardRange2 >
BOOST_DEDUCED_TYPENAME disable_if< is_const < SinglePassRange1 > , BOOST_DEDUCED_TYPENAME range_iterator < SinglePassRange1 >::type > ::type	find_first_of (SinglePassRange1 &rng1, ForwardRange2 const &rng2)
	template function find_first_of More...

template<class SinglePassRange1 , class ForwardRange2 >
BOOST_DEDUCED_TYPENAME range_iterator< const SinglePassRange1 >::type	find_first_of (const SinglePassRange1 &rng1, const ForwardRange2 &rng2)

template<class SinglePassRange1 , class ForwardRange2 , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME disable_if< is_const < SinglePassRange1 > , BOOST_DEDUCED_TYPENAME range_iterator < SinglePassRange1 >::type > ::type	find_first_of (SinglePassRange1 &rng1, ForwardRange2 const &rng2, BinaryPredicate pred)

template<class SinglePassRange1 , class ForwardRange2 , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< const SinglePassRange1 >::type	find_first_of (const SinglePassRange1 &rng1, const ForwardRange2 &rng2, BinaryPredicate pred)

template<range_return_value re, class SinglePassRange1 , class ForwardRange2 >
BOOST_DEDUCED_TYPENAME disable_if< is_const < SinglePassRange1 > , BOOST_DEDUCED_TYPENAME range_return< SinglePassRange1, re >::type >::type	find_first_of (SinglePassRange1 &rng1, const ForwardRange2 &rng2)

template<range_return_value re, class SinglePassRange1 , class ForwardRange2 >
BOOST_DEDUCED_TYPENAME range_return< const SinglePassRange1, re >::type	find_first_of (const SinglePassRange1 &rng1, const ForwardRange2 &rng2)

template<range_return_value re, class SinglePassRange1 , class ForwardRange2 , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME disable_if< is_const < SinglePassRange1 > , BOOST_DEDUCED_TYPENAME range_return< SinglePassRange1, re >::type >::type	find_first_of (SinglePassRange1 &rng1, const ForwardRange2 &rng2, BinaryPredicate pred)

template<range_return_value re, class SinglePassRange1 , class ForwardRange2 , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< const SinglePassRange1, re >::type	find_first_of (const SinglePassRange1 &rng1, const ForwardRange2 &rng2, BinaryPredicate pred)

template<class SinglePassRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME disable_if< is_const < SinglePassRange > , BOOST_DEDUCED_TYPENAME range_iterator < SinglePassRange >::type > ::type	find_if (SinglePassRange &rng, UnaryPredicate pred)
	template function find_if More...

template<class SinglePassRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< const SinglePassRange >::type	find_if (const SinglePassRange &rng, UnaryPredicate pred)

template<range_return_value re, class SinglePassRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME disable_if< is_const < SinglePassRange > , BOOST_DEDUCED_TYPENAME range_return< SinglePassRange, re >::type >::type	find_if (SinglePassRange &rng, UnaryPredicate pred)

template<range_return_value re, class SinglePassRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< const SinglePassRange, re >::type	find_if (const SinglePassRange &rng, UnaryPredicate pred)

template<class SinglePassRange , class UnaryFunction >
UnaryFunction	for_each (SinglePassRange &rng, UnaryFunction fun)
	template function for_each More...

template<class SinglePassRange , class UnaryFunction >
UnaryFunction	for_each (const SinglePassRange &rng, UnaryFunction fun)

template<class ForwardRange , class Generator >
ForwardRange &	generate (ForwardRange &rng, Generator gen)
	template function generate More...

template<class ForwardRange , class Generator >
const ForwardRange &	generate (const ForwardRange &rng, Generator gen)

template<class RandomAccessRange >
RandomAccessRange &	push_heap (RandomAccessRange &rng)
	template function push_heap More...

template<class RandomAccessRange >
const RandomAccessRange &	push_heap (const RandomAccessRange &rng)

template<class RandomAccessRange , class Compare >
RandomAccessRange &	push_heap (RandomAccessRange &rng, Compare comp_pred)

template<class RandomAccessRange , class Compare >
const RandomAccessRange &	push_heap (const RandomAccessRange &rng, Compare comp_pred)

template<class RandomAccessRange >
RandomAccessRange &	pop_heap (RandomAccessRange &rng)
	template function pop_heap More...

template<class RandomAccessRange >
const RandomAccessRange &	pop_heap (const RandomAccessRange &rng)

template<class RandomAccessRange , class Compare >
RandomAccessRange &	pop_heap (RandomAccessRange &rng, Compare comp_pred)

template<class RandomAccessRange , class Compare >
const RandomAccessRange &	pop_heap (const RandomAccessRange &rng, Compare comp_pred)

template<class RandomAccessRange >
RandomAccessRange &	make_heap (RandomAccessRange &rng)
	template function make_heap More...

template<class RandomAccessRange >
const RandomAccessRange &	make_heap (const RandomAccessRange &rng)

template<class RandomAccessRange , class Compare >
RandomAccessRange &	make_heap (RandomAccessRange &rng, Compare comp_pred)

template<class RandomAccessRange , class Compare >
const RandomAccessRange &	make_heap (const RandomAccessRange &rng, Compare comp_pred)

template<class RandomAccessRange >
RandomAccessRange &	sort_heap (RandomAccessRange &rng)
	template function sort_heap More...

template<class RandomAccessRange >
const RandomAccessRange &	sort_heap (const RandomAccessRange &rng)

template<class RandomAccessRange , class Compare >
RandomAccessRange &	sort_heap (RandomAccessRange &rng, Compare comp_pred)

template<class RandomAccessRange , class Compare >
const RandomAccessRange &	sort_heap (const RandomAccessRange &rng, Compare comp_pred)

template<class BidirectionalRange >
BidirectionalRange &	inplace_merge (BidirectionalRange &rng, BOOST_DEDUCED_TYPENAME range_iterator< BidirectionalRange >::type middle)
	template function inplace_merge More...

template<class BidirectionalRange >
const BidirectionalRange &	inplace_merge (const BidirectionalRange &rng, BOOST_DEDUCED_TYPENAME boost::range_iterator< const BidirectionalRange >::type middle)

template<class BidirectionalRange , class BinaryPredicate >
BidirectionalRange &	inplace_merge (BidirectionalRange &rng, BOOST_DEDUCED_TYPENAME boost::range_iterator< BidirectionalRange >::type middle, BinaryPredicate pred)

template<class BidirectionalRange , class BinaryPredicate >
const BidirectionalRange &	inplace_merge (const BidirectionalRange &rng, BOOST_DEDUCED_TYPENAME boost::range_iterator< const BidirectionalRange >::type middle, BinaryPredicate pred)

template<class SinglePassRange1 , class SinglePassRange2 >
bool	lexicographical_compare (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2)
	template function lexicographic_compare More...

template<class SinglePassRange1 , class SinglePassRange2 , class BinaryPredicate >
bool	lexicographical_compare (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, BinaryPredicate pred)

template<class ForwardRange , class Value >
BOOST_DEDUCED_TYPENAME disable_if< is_const < ForwardRange > , BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange > ::type >::type	lower_bound (ForwardRange &rng, Value val)
	template function lower_bound More...

template<class ForwardRange , class Value >
BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type	lower_bound (const ForwardRange &rng, Value val)

template<class ForwardRange , class Value , class SortPredicate >
BOOST_DEDUCED_TYPENAME disable_if< is_const < ForwardRange > , BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange > ::type >::type	lower_bound (ForwardRange &rng, Value val, SortPredicate pred)

template<class ForwardRange , class Value , class SortPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type	lower_bound (const ForwardRange &rng, Value val, SortPredicate pred)

template<range_return_value re, class ForwardRange , class Value >
BOOST_DEDUCED_TYPENAME disable_if< is_const < ForwardRange > , BOOST_DEDUCED_TYPENAME range_return< ForwardRange, re > ::type >::type	lower_bound (ForwardRange &rng, Value val)

template<range_return_value re, class ForwardRange , class Value >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, re >::type	lower_bound (const ForwardRange &rng, Value val)

template<range_return_value re, class ForwardRange , class Value , class SortPredicate >
BOOST_DEDUCED_TYPENAME disable_if< is_const < ForwardRange > , BOOST_DEDUCED_TYPENAME range_return< ForwardRange, re > ::type >::type	lower_bound (ForwardRange &rng, Value val, SortPredicate pred)

template<range_return_value re, class ForwardRange , class Value , class SortPredicate >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, re >::type	lower_bound (const ForwardRange &rng, Value val, SortPredicate pred)

template<class ForwardRange >
BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange > ::type	max_element (ForwardRange &rng)
	template function max_element More...

template<class ForwardRange >
BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type	max_element (const ForwardRange &rng)

template<class ForwardRange , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange > ::type	max_element (ForwardRange &rng, BinaryPredicate pred)

template<class ForwardRange , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type	max_element (const ForwardRange &rng, BinaryPredicate pred)

template<range_return_value re, class ForwardRange >
BOOST_DEDUCED_TYPENAME range_return< ForwardRange, re > ::type	max_element (ForwardRange &rng)

template<range_return_value re, class ForwardRange >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, re >::type	max_element (const ForwardRange &rng)

template<range_return_value re, class ForwardRange , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< ForwardRange, re > ::type	max_element (ForwardRange &rng, BinaryPredicate pred)

template<range_return_value re, class ForwardRange , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, re >::type	max_element (const ForwardRange &rng, BinaryPredicate pred)

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator >
OutputIterator	merge (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, OutputIterator out)
	template function merge More...

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator , class BinaryPredicate >
OutputIterator	merge (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, OutputIterator out, BinaryPredicate pred)

template<class ForwardRange >
BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange > ::type	min_element (ForwardRange &rng)
	template function min_element More...

template<class ForwardRange >
BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type	min_element (const ForwardRange &rng)

template<class ForwardRange , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange > ::type	min_element (ForwardRange &rng, BinaryPredicate pred)

template<class ForwardRange , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type	min_element (const ForwardRange &rng, BinaryPredicate pred)

template<range_return_value re, class ForwardRange >
BOOST_DEDUCED_TYPENAME range_return< ForwardRange, re > ::type	min_element (ForwardRange &rng)

template<range_return_value re, class ForwardRange >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, re >::type	min_element (const ForwardRange &rng)

template<range_return_value re, class ForwardRange , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< ForwardRange, re > ::type	min_element (ForwardRange &rng, BinaryPredicate pred)

template<range_return_value re, class ForwardRange , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, re >::type	min_element (const ForwardRange &rng, BinaryPredicate pred)

template<class SinglePassRange1 , class SinglePassRange2 >
std::pair < BOOST_DEDUCED_TYPENAME range_iterator < SinglePassRange1 >::type, BOOST_DEDUCED_TYPENAME range_iterator< const SinglePassRange2 >::type >	mismatch (SinglePassRange1 &rng1, const SinglePassRange2 &rng2)
	template function mismatch More...

template<class SinglePassRange1 , class SinglePassRange2 >
std::pair < BOOST_DEDUCED_TYPENAME range_iterator< const SinglePassRange1 >::type, BOOST_DEDUCED_TYPENAME range_iterator< const SinglePassRange2 >::type >	mismatch (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2)

template<class SinglePassRange1 , class SinglePassRange2 >
std::pair < BOOST_DEDUCED_TYPENAME range_iterator < SinglePassRange1 >::type, BOOST_DEDUCED_TYPENAME range_iterator < SinglePassRange2 >::type >	mismatch (SinglePassRange1 &rng1, SinglePassRange2 &rng2)

template<class SinglePassRange1 , class SinglePassRange2 >
std::pair < BOOST_DEDUCED_TYPENAME range_iterator< const SinglePassRange1 >::type, BOOST_DEDUCED_TYPENAME range_iterator < SinglePassRange2 >::type >	mismatch (const SinglePassRange1 &rng1, SinglePassRange2 &rng2)

template<class SinglePassRange1 , class SinglePassRange2 , class BinaryPredicate >
std::pair < BOOST_DEDUCED_TYPENAME range_iterator < SinglePassRange1 >::type, BOOST_DEDUCED_TYPENAME range_iterator< const SinglePassRange2 >::type >	mismatch (SinglePassRange1 &rng1, const SinglePassRange2 &rng2, BinaryPredicate pred)

template<class SinglePassRange1 , class SinglePassRange2 , class BinaryPredicate >
std::pair < BOOST_DEDUCED_TYPENAME range_iterator< const SinglePassRange1 >::type, BOOST_DEDUCED_TYPENAME range_iterator< const SinglePassRange2 >::type >	mismatch (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, BinaryPredicate pred)

template<class SinglePassRange1 , class SinglePassRange2 , class BinaryPredicate >
std::pair < BOOST_DEDUCED_TYPENAME range_iterator < SinglePassRange1 >::type, BOOST_DEDUCED_TYPENAME range_iterator < SinglePassRange2 >::type >	mismatch (SinglePassRange1 &rng1, SinglePassRange2 &rng2, BinaryPredicate pred)

template<class SinglePassRange1 , class SinglePassRange2 , class BinaryPredicate >
std::pair < BOOST_DEDUCED_TYPENAME range_iterator< const SinglePassRange1 >::type, BOOST_DEDUCED_TYPENAME range_iterator < SinglePassRange2 >::type >	mismatch (const SinglePassRange1 &rng1, SinglePassRange2 &rng2, BinaryPredicate pred)

template<class RandomAccessRange >
RandomAccessRange &	nth_element (RandomAccessRange &rng, BOOST_DEDUCED_TYPENAME range_iterator< RandomAccessRange >::type nth)
	template function nth_element More...

template<class RandomAccessRange >
const RandomAccessRange &	nth_element (const RandomAccessRange &rng, BOOST_DEDUCED_TYPENAME range_iterator< const RandomAccessRange >::type nth)

template<class RandomAccessRange , class BinaryPredicate >
RandomAccessRange &	nth_element (RandomAccessRange &rng, BOOST_DEDUCED_TYPENAME range_iterator< RandomAccessRange >::type nth, BinaryPredicate sort_pred)

template<class RandomAccessRange , class BinaryPredicate >
const RandomAccessRange &	nth_element (const RandomAccessRange &rng, BOOST_DEDUCED_TYPENAME range_iterator< const RandomAccessRange >::type nth, BinaryPredicate sort_pred)

template<class RandomAccessRange >
RandomAccessRange &	partial_sort (RandomAccessRange &rng, BOOST_DEDUCED_TYPENAME range_iterator< RandomAccessRange >::type middle)
	template function partial_sort More...

template<class RandomAccessRange >
const RandomAccessRange &	partial_sort (const RandomAccessRange &rng, BOOST_DEDUCED_TYPENAME range_iterator< const RandomAccessRange >::type middle)

template<class RandomAccessRange , class BinaryPredicate >
RandomAccessRange &	partial_sort (RandomAccessRange &rng, BOOST_DEDUCED_TYPENAME range_iterator< RandomAccessRange >::type middle, BinaryPredicate sort_pred)

template<class RandomAccessRange , class BinaryPredicate >
const RandomAccessRange &	partial_sort (const RandomAccessRange &rng, BOOST_DEDUCED_TYPENAME range_iterator< const RandomAccessRange >::type middle, BinaryPredicate sort_pred)

template<class SinglePassRange , class RandomAccessRange >
BOOST_DEDUCED_TYPENAME range_iterator < RandomAccessRange >::type	partial_sort_copy (const SinglePassRange &rng1, RandomAccessRange &rng2)
	template function partial_sort_copy More...

template<class SinglePassRange , class RandomAccessRange >
BOOST_DEDUCED_TYPENAME range_iterator < RandomAccessRange >::type	partial_sort_copy (const SinglePassRange &rng1, const RandomAccessRange &rng2)

template<class SinglePassRange , class RandomAccessRange , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator < RandomAccessRange >::type	partial_sort_copy (const SinglePassRange &rng1, RandomAccessRange &rng2, BinaryPredicate pred)

template<class SinglePassRange , class RandomAccessRange , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< const RandomAccessRange >::type	partial_sort_copy (const SinglePassRange &rng1, const RandomAccessRange &rng2, BinaryPredicate pred)

template<class ForwardRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange > ::type	partition (ForwardRange &rng, UnaryPredicate pred)
	template function partition More...

template<class ForwardRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange > ::type	partition (const ForwardRange &rng, UnaryPredicate pred)

template<range_return_value re, class ForwardRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< ForwardRange, re > ::type	partition (ForwardRange &rng, UnaryPredicate pred)

template<range_return_value re, class ForwardRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, re >::type	partition (const ForwardRange &rng, UnaryPredicate pred)

template<class BidirectionalRange >
bool	next_permutation (BidirectionalRange &rng)
	template function next_permutation More...

template<class BidirectionalRange >
bool	next_permutation (const BidirectionalRange &rng)

template<class BidirectionalRange , class Compare >
bool	next_permutation (BidirectionalRange &rng, Compare comp_pred)

template<class BidirectionalRange , class Compare >
bool	next_permutation (const BidirectionalRange &rng, Compare comp_pred)

template<class BidirectionalRange >
bool	prev_permutation (BidirectionalRange &rng)
	template function prev_permutation More...

template<class BidirectionalRange >
bool	prev_permutation (const BidirectionalRange &rng)

template<class BidirectionalRange , class Compare >
bool	prev_permutation (BidirectionalRange &rng, Compare comp_pred)

template<class BidirectionalRange , class Compare >
bool	prev_permutation (const BidirectionalRange &rng, Compare comp_pred)

template<class RandomAccessRange >
RandomAccessRange &	random_shuffle (RandomAccessRange &rng)
	template function random_shuffle More...

template<class RandomAccessRange >
const RandomAccessRange &	random_shuffle (const RandomAccessRange &rng)

template<class RandomAccessRange , class Generator >
RandomAccessRange &	random_shuffle (RandomAccessRange &rng, Generator &gen)

template<class RandomAccessRange , class Generator >
const RandomAccessRange &	random_shuffle (const RandomAccessRange &rng, Generator &gen)

template<class ForwardRange , class Value >
BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange > ::type	remove (ForwardRange &rng, const Value &val)
	template function remove More...

template<class ForwardRange , class Value >
BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type	remove (const ForwardRange &rng, const Value &val)

template<range_return_value re, class ForwardRange , class Value >
BOOST_DEDUCED_TYPENAME range_return< ForwardRange, re > ::type	remove (ForwardRange &rng, const Value &val)

template<range_return_value re, class ForwardRange , class Value >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, re >::type	remove (const ForwardRange &rng, const Value &val)

template<class SinglePassRange , class OutputIterator , class Value >
OutputIterator	remove_copy (const SinglePassRange &rng, OutputIterator out_it, const Value &val)
	template function remove_copy More...

template<class ForwardRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME boost::range_iterator < ForwardRange >::type	remove_if (ForwardRange &rng, UnaryPredicate pred)
	template function remove_if More...

template<class ForwardRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME boost::range_iterator< const ForwardRange >::type	remove_if (const ForwardRange &rng, UnaryPredicate pred)

template<range_return_value re, class ForwardRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< ForwardRange, re > ::type	remove_if (ForwardRange &rng, UnaryPredicate pred)

template<range_return_value re, class ForwardRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, re >::type	remove_if (const ForwardRange &rng, UnaryPredicate pred)

template<class ForwardRange , class Value >
ForwardRange &	replace (ForwardRange &rng, const Value &what, const Value &with_what)
	template function replace More...

template<class ForwardRange , class Value >
const ForwardRange &	replace (const ForwardRange &rng, const Value &what, const Value &with_what)

template<class ForwardRange , class OutputIterator , class Value >
OutputIterator	replace_copy (const ForwardRange &rng, OutputIterator out_it, const Value &what, const Value &with_what)
	template function replace_copy More...

template<class ForwardRange , class OutputIterator , class Predicate , class Value >
OutputIterator	replace_copy_if (const ForwardRange &rng, OutputIterator out_it, Predicate pred, const Value &with_what)
	template function replace_copy_if More...

template<class ForwardRange , class UnaryPredicate , class Value >
ForwardRange &	replace_if (ForwardRange &rng, UnaryPredicate pred, const Value &val)
	template function replace_if More...

template<class ForwardRange , class UnaryPredicate , class Value >
const ForwardRange &	replace_if (const ForwardRange &rng, UnaryPredicate pred, const Value &val)

template<class BidirectionalRange >
BidirectionalRange &	reverse (BidirectionalRange &rng)
	template function reverse More...

template<class BidirectionalRange >
const BidirectionalRange &	reverse (const BidirectionalRange &rng)

template<class BidirectionalRange , class OutputIterator >
OutputIterator	reverse_copy (const BidirectionalRange &rng, OutputIterator out)
	template function reverse_copy More...

template<class ForwardRange >
ForwardRange &	rotate (ForwardRange &rng, BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange >::type middle)
	template function rotate More...

template<class ForwardRange >
const ForwardRange &	rotate (const ForwardRange &rng, BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type middle)

template<typename ForwardRange , typename OutputIterator >
OutputIterator	rotate_copy (const ForwardRange &rng, BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type middle, OutputIterator target)
	template function rotate More...

template<class ForwardRange1 , class ForwardRange2 >
BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange1 > ::type	search (ForwardRange1 &rng1, const ForwardRange2 &rng2)
	template function search More...

template<class ForwardRange1 , class ForwardRange2 >
BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange1 >::type	search (const ForwardRange1 &rng1, const ForwardRange2 &rng2)

template<class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange1 > ::type	search (ForwardRange1 &rng1, const ForwardRange2 &rng2, BinaryPredicate pred)

template<class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange1 >::type	search (const ForwardRange1 &rng1, const ForwardRange2 &rng2, BinaryPredicate pred)

template<range_return_value re, class ForwardRange1 , class ForwardRange2 >
BOOST_DEDUCED_TYPENAME range_return< ForwardRange1, re >::type	search (ForwardRange1 &rng1, const ForwardRange2 &rng2)

template<range_return_value re, class ForwardRange1 , class ForwardRange2 >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange1, re >::type	search (const ForwardRange1 &rng1, const ForwardRange2 &rng2)

template<range_return_value re, class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< ForwardRange1, re >::type	search (ForwardRange1 &rng1, const ForwardRange2 &rng2, BinaryPredicate pred)

template<range_return_value re, class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange1, re >::type	search (const ForwardRange1 &rng1, const ForwardRange2 &rng2, BinaryPredicate pred)

template<class ForwardRange , class Integer , class Value >
BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange > ::type	search_n (ForwardRange &rng, Integer count, const Value &value)
	template function search More...

template<class ForwardRange , class Integer , class Value >
BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type	search_n (const ForwardRange &rng, Integer count, const Value &value)

template<class ForwardRange , class Integer , class Value , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange > ::type	search_n (ForwardRange &rng, Integer count, const Value &value, BinaryPredicate binary_pred)

template<class ForwardRange , class Integer , class Value , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type	search_n (const ForwardRange &rng, Integer count, const Value &value, BinaryPredicate binary_pred)

template<range_return_value re, class ForwardRange , class Integer , class Value >
BOOST_DEDUCED_TYPENAME range_return< ForwardRange, re > ::type	search_n (ForwardRange &rng, Integer count, const Value &value)

template<range_return_value re, class ForwardRange , class Integer , class Value >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, re >::type	search_n (const ForwardRange &rng, Integer count, const Value &value)

template<range_return_value re, class ForwardRange , class Integer , class Value , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< ForwardRange, re > ::type	search_n (ForwardRange &rng, Integer count, const Value &value, BinaryPredicate pred)

template<range_return_value re, class ForwardRange , class Integer , class Value , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, re >::type	search_n (const ForwardRange &rng, Integer count, const Value &value, BinaryPredicate pred)

template<class SinglePassRange1 , class SinglePassRange2 >
bool	includes (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2)
	template function includes More...

template<class SinglePassRange1 , class SinglePassRange2 , class BinaryPredicate >
bool	includes (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, BinaryPredicate pred)

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator >
OutputIterator	set_union (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, OutputIterator out)
	template function set_union More...

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator , class BinaryPredicate >
OutputIterator	set_union (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, OutputIterator out, BinaryPredicate pred)

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator >
OutputIterator	set_intersection (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, OutputIterator out)
	template function set_intersection More...

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator , class BinaryPredicate >
OutputIterator	set_intersection (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, OutputIterator out, BinaryPredicate pred)

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator >
OutputIterator	set_difference (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, OutputIterator out)
	template function set_difference More...

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator , class BinaryPredicate >
OutputIterator	set_difference (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, OutputIterator out, BinaryPredicate pred)

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator >
OutputIterator	set_symmetric_difference (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, OutputIterator out)
	template function set_symmetric_difference More...

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator , class BinaryPredicate >
OutputIterator	set_symmetric_difference (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, OutputIterator out, BinaryPredicate pred)

template<class RandomAccessRange >
RandomAccessRange &	sort (RandomAccessRange &rng)
	template function sort More...

template<class RandomAccessRange >
const RandomAccessRange &	sort (const RandomAccessRange &rng)

template<class RandomAccessRange , class BinaryPredicate >
RandomAccessRange &	sort (RandomAccessRange &rng, BinaryPredicate pred)

template<class RandomAccessRange , class BinaryPredicate >
const RandomAccessRange &	sort (const RandomAccessRange &rng, BinaryPredicate pred)

template<class BidirectionalRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator < BidirectionalRange >::type	stable_partition (BidirectionalRange &rng, UnaryPredicate pred)
	template function stable_partition More...

template<class BidirectionalRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< const BidirectionalRange >::type	stable_partition (const BidirectionalRange &rng, UnaryPredicate pred)

template<range_return_value re, class BidirectionalRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME range_return < BidirectionalRange, re > ::type	stable_partition (BidirectionalRange &rng, UnaryPredicate pred)

template<range_return_value re, class BidirectionalRange , class UnaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< const BidirectionalRange, re >::type	stable_partition (const BidirectionalRange &rng, UnaryPredicate pred)

template<class RandomAccessRange >
RandomAccessRange &	stable_sort (RandomAccessRange &rng)
	template function stable_sort More...

template<class RandomAccessRange >
const RandomAccessRange &	stable_sort (const RandomAccessRange &rng)

template<class RandomAccessRange , class BinaryPredicate >
RandomAccessRange &	stable_sort (RandomAccessRange &rng, BinaryPredicate sort_pred)

template<class RandomAccessRange , class BinaryPredicate >
const RandomAccessRange &	stable_sort (const RandomAccessRange &rng, BinaryPredicate sort_pred)

template<class SinglePassRange1 , class SinglePassRange2 >
SinglePassRange2 &	swap_ranges (SinglePassRange1 &range1, SinglePassRange2 &range2)
	template function swap_ranges More...

template<class SinglePassRange1 , class SinglePassRange2 >
SinglePassRange2 &	swap_ranges (const SinglePassRange1 &range1, SinglePassRange2 &range2)

template<class SinglePassRange1 , class SinglePassRange2 >
const SinglePassRange2 &	swap_ranges (SinglePassRange1 &range1, const SinglePassRange2 &range2)

template<class SinglePassRange1 , class SinglePassRange2 >
const SinglePassRange2 &	swap_ranges (const SinglePassRange1 &range1, const SinglePassRange2 &range2)

template<class SinglePassRange1 , class OutputIterator , class UnaryOperation >
OutputIterator	transform (const SinglePassRange1 &rng, OutputIterator out, UnaryOperation fun)
	template function transform More...

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator , class BinaryOperation >
OutputIterator	transform (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, OutputIterator out, BinaryOperation fun)

template<range_return_value re, class ForwardRange >
BOOST_DEDUCED_TYPENAME range_return< ForwardRange, re > ::type	unique (ForwardRange &rng)
	template function unique More...

template<range_return_value re, class ForwardRange >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, re >::type	unique (const ForwardRange &rng)

template<range_return_value re, class ForwardRange , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< ForwardRange, re > ::type	unique (ForwardRange &rng, BinaryPredicate pred)

template<range_return_value re, class ForwardRange , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, re >::type	unique (const ForwardRange &rng, BinaryPredicate pred)

template<class ForwardRange >
BOOST_DEDUCED_TYPENAME range_return< ForwardRange, return_begin_found >::type	unique (ForwardRange &rng)

template<class ForwardRange >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, return_begin_found >::type	unique (const ForwardRange &rng)

template<class ForwardRange , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< ForwardRange, return_begin_found >::type	unique (ForwardRange &rng, BinaryPredicate pred)

template<class ForwardRange , class BinaryPredicate >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, return_begin_found >::type	unique (const ForwardRange &rng, BinaryPredicate pred)

template<class SinglePassRange , class OutputIterator >
OutputIterator	unique_copy (const SinglePassRange &rng, OutputIterator out_it)
	template function unique_copy More...

template<class SinglePassRange , class OutputIterator , class BinaryPredicate >
OutputIterator	unique_copy (const SinglePassRange &rng, OutputIterator out_it, BinaryPredicate pred)

template<class ForwardRange , class Value >
BOOST_DEDUCED_TYPENAME disable_if< is_const < ForwardRange > , BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange > ::type >::type	upper_bound (ForwardRange &rng, Value val)
	template function upper_bound More...

template<class ForwardRange , class Value >
BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type	upper_bound (const ForwardRange &rng, Value val)

template<class ForwardRange , class Value , class SortPredicate >
BOOST_DEDUCED_TYPENAME disable_if< is_const < ForwardRange > , BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange > ::type >::type	upper_bound (ForwardRange &rng, Value val, SortPredicate pred)

template<class ForwardRange , class Value , class SortPredicate >
BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type	upper_bound (const ForwardRange &rng, Value val, SortPredicate pred)

template<range_return_value re, class ForwardRange , class Value >
BOOST_DEDUCED_TYPENAME disable_if< is_const < ForwardRange > , BOOST_DEDUCED_TYPENAME range_return< ForwardRange, re > ::type >::type	upper_bound (ForwardRange &rng, Value val)

template<range_return_value re, class ForwardRange , class Value >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, re >::type	upper_bound (const ForwardRange &rng, Value val)

template<range_return_value re, class ForwardRange , class Value , class SortPredicate >
BOOST_DEDUCED_TYPENAME disable_if< is_const < ForwardRange > , BOOST_DEDUCED_TYPENAME range_return< ForwardRange, re > ::type >::type	upper_bound (ForwardRange &rng, Value val, SortPredicate pred)

template<range_return_value re, class ForwardRange , class Value , class SortPredicate >
BOOST_DEDUCED_TYPENAME range_return< const ForwardRange, re >::type	upper_bound (const ForwardRange &rng, Value val, SortPredicate pred)

template<class SinglePassRange , class Size , class OutputIterator >
OutputIterator	copy_n (const SinglePassRange &rng, Size n, OutputIterator out)
	template function copy More...

template<class Container >
Container &	erase (Container &on, iterator_range< BOOST_DEDUCED_TYPENAME Container::iterator > to_erase)

template<class Container , class T >
Container &	remove_erase (Container &on, const T &val)

template<class Container , class Pred >
Container &	remove_erase_if (Container &on, Pred pred)

template<class SinglePassRange1 , class SinglePassRange2 , class Fn2 >
Fn2	for_each (const SinglePassRange1 &rng1, const SinglePassRange2 &rng2, Fn2 fn)

template<class SinglePassRange1 , class SinglePassRange2 , class Fn2 >
Fn2	for_each (const SinglePassRange1 &rng1, SinglePassRange2 &rng2, Fn2 fn)

template<class SinglePassRange1 , class SinglePassRange2 , class Fn2 >
Fn2	for_each (SinglePassRange1 &rng1, const SinglePassRange2 &rng2, Fn2 fn)

template<class SinglePassRange1 , class SinglePassRange2 , class Fn2 >
Fn2	for_each (SinglePassRange1 &rng1, SinglePassRange2 &rng2, Fn2 fn)

template<class Container , class Range >
Container &	insert (Container &on, BOOST_DEDUCED_TYPENAME Container::iterator before, const Range &from)

template<class Container , class Range >
Container &	insert (Container &on, const Range &from)

template<class ForwardRange , class Value >
ForwardRange &	iota (ForwardRange &rng, Value x)

template<class ForwardRange , class Value >
const ForwardRange &	iota (const ForwardRange &rng, Value x)

template<class SinglePassRange >
bool	is_sorted (const SinglePassRange &rng)
	template function is_sorted More...

template<class SinglePassRange , class BinaryPredicate >
bool	is_sorted (const SinglePassRange &rng, BinaryPredicate pred)

template<class SinglePassRange1 , class SinglePassRange2 >
void	overwrite (const SinglePassRange1 &from, SinglePassRange2 &to)

template<class SinglePassRange1 , class SinglePassRange2 >
void	overwrite (const SinglePassRange1 &from, const SinglePassRange2 &to)

template<class Container , class Range >
Container &	push_back (Container &on, const Range &from)

template<class Container , class Range >
Container &	push_front (Container &on, const Range &from)

template<class Type , class Elem , class Traits >
iterator_range < std::istream_iterator< Type, Elem, Traits > >	istream_range (std::basic_istream< Elem, Traits > &in)

template<class SinglePassRange1 , class SinglePassRange2 >
joined_range< const SinglePassRange1, const SinglePassRange2 >	join (const SinglePassRange1 &r1, const SinglePassRange2 &r2)

template<class SinglePassRange1 , class SinglePassRange2 >
joined_range< SinglePassRange1, SinglePassRange2 >	join (SinglePassRange1 &r1, SinglePassRange2 &r2)

Function Documentation

template<typename ForwardRange >

range_iterator<ForwardRange>::type boost::range::adjacent_find ( ForwardRange & rng )

inline

template function adjacent_find

range-based version of the adjacent_find std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References adjacent_find(), boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by boost::lambda::ll::adjacent_find::operator()(), and boost::phoenix::impl::adjacent_find::operator()().

template<typename ForwardRange >

range_iterator<const ForwardRange>::type boost::range::adjacent_find ( const ForwardRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References adjacent_find(), boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

template<typename ForwardRange , typename BinaryPredicate >

range_iterator<ForwardRange>::type boost::range::adjacent_find	(	ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References adjacent_find(), boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

template<typename ForwardRange , typename BinaryPredicate >

range_iterator<const ForwardRange>::type boost::range::adjacent_find	(	const ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References adjacent_find(), boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

template<range_return_value re, typename ForwardRange >

range_return<ForwardRange,re>::type boost::range::adjacent_find ( ForwardRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References adjacent_find(), boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

template<range_return_value re, typename ForwardRange >

range_return<const ForwardRange,re>::type boost::range::adjacent_find ( const ForwardRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References adjacent_find(), boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

template<range_return_value re, typename ForwardRange , typename BinaryPredicate >

range_return<ForwardRange,re>::type boost::range::adjacent_find	(	ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References adjacent_find(), boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

template<range_return_value re, typename ForwardRange , typename BinaryPredicate >

range_return<const ForwardRange,re>::type boost::range::adjacent_find	(	const ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by adjacent_find().

template<class ForwardRange , class Value >

bool boost::range::binary_search	(	const ForwardRange &	rng,
		const Value &	val
	)

inline

template function binary_search

range-based version of the binary_search std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, binary_search(), BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by boost::phoenix::impl::binary_search::operator()(), and boost::lambda::ll::binary_search::operator()().

template<class ForwardRange , class Value , class BinaryPredicate >

bool boost::range::binary_search	(	const ForwardRange &	rng,
		const Value &	val,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by binary_search().

template<class SinglePassRange , class OutputIterator >

OutputIterator boost::range::copy	(	const SinglePassRange &	rng,
		OutputIterator	out
	)

inline

template function copy

range-based version of the copy std algorithm

Precondition: SinglePassRange is a model of the SinglePassRangeConcept; OutputIterator is a model of the OutputIteratorConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::spirit::qi::copy(), and boost::end.

Referenced by boost::numeric::odeint::detail::do_copying().

template<class BidirectionalRange , class BidirectionalTraversalWriteableIterator >

BidirectionalTraversalWriteableIterator boost::range::copy_backward	(	const BidirectionalRange &	rng,
		BidirectionalTraversalWriteableIterator	out
	)

inline

template function copy_backward

range-based version of the copy_backwards std algorithm

Precondition: BidirectionalRange is a model of the BidirectionalRangeConcept; BidirectionalTraversalWriteableIterator is a model of the BidirectionalIteratorConcept; BidirectionalTraversalWriteableIterator is a model of the WriteableIteratorConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by boost::numeric::ublas::map_array< I, T, ALLOC >::insert(), boost::interprocess::ipcdetail::mq_hdr_t< VoidPointer >::insert_at(), boost::numeric::ublas::compressed_vector< T, IB, IA, TA >::insert_element(), boost::numeric::ublas::compressed_matrix< T, L, IB, IA, TA >::insert_element(), boost::multiprecision::backends::cpp_dec_float< Digits10, ExponentType, Allocator >::mul_unsigned_long_long(), boost::phoenix::impl::copy_backward::operator()(), boost::lambda::ll::copy_backward::operator()(), boost::multiprecision::backends::cpp_dec_float< Digits10, ExponentType, Allocator >::operator*=(), and boost::multiprecision::backends::cpp_dec_float< Digits10, ExponentType, Allocator >::operator+=().

template<class SinglePassRange , class Size , class OutputIterator >

OutputIterator boost::range::copy_n	(	const SinglePassRange &	rng,
		Size	n,
		OutputIterator	out
	)

inline

template function copy

range-based version of the copy std algorithm

Precondition: SinglePassRange is a model of the SinglePassRangeConcept; OutputIterator is a model of the OutputIteratorConcept; 0 <= n <= distance(rng)

References boost::asio::begin, BOOST_ASSERT, BOOST_DEDUCED_TYPENAME, BOOST_RANGE_CONCEPT_ASSERT, boost::distance(), boost::multiprecision::backends::i, boost::n, boost::out, and boost::source().

template<class SinglePassRange , class Value >

BOOST_DEDUCED_TYPENAME range_difference<SinglePassRange>::type boost::range::count	(	SinglePassRange &	rng,
		const Value &	val
	)

inline

template function count

range-based version of the count std algorithm

Precondition: SinglePassRange is a model of the SinglePassRangeConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, count, and boost::end.

template<class SinglePassRange , class Value >

BOOST_DEDUCED_TYPENAME range_difference<SinglePassRange const>::type boost::range::count	(	const SinglePassRange &	rng,
		const Value &	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, count, and boost::end.

template<class SinglePassRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME boost::range_difference<SinglePassRange>::type boost::range::count_if	(	SinglePassRange &	rng,
		UnaryPredicate	pred
	)

inline

template function count_if

range-based version of the count_if std algorithm

Precondition: SinglePassRange is a model of the SinglePassRangeConcept; UnaryPredicate is a model of the UnaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, count_if(), and boost::end.

template<class SinglePassRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME boost::range_difference<const SinglePassRange>::type boost::range::count_if	(	const SinglePassRange &	rng,
		UnaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by count_if(), and boost::fusion::count_if().

template<class SinglePassRange1 , class SinglePassRange2 >

bool boost::range::equal	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2
	)

inline

template function equal

range-based version of the equal std algorithm

Precondition: SinglePassRange1 is a model of the SinglePassRangeConcept; SinglePassRange2 is a model of the SinglePassRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and equal().

template<class SinglePassRange1 , class SinglePassRange2 , class BinaryPredicate >

bool boost::range::equal	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by boost::algorithm::detail::equal(), equal(), and boost::range_detail::equal_impl().

template<class ForwardRange , class Value >

std::pair< BOOST_DEDUCED_TYPENAME boost::range_iterator<ForwardRange>::type, BOOST_DEDUCED_TYPENAME boost::range_iterator<ForwardRange>::type > boost::range::equal_range	(	ForwardRange &	rng,
		const Value &	val
	)

inline

template function equal_range

range-based version of the equal_range std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept; SortPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and equal_range().

template<class ForwardRange , class Value >

std::pair< BOOST_DEDUCED_TYPENAME boost::range_iterator<const ForwardRange>::type, BOOST_DEDUCED_TYPENAME boost::range_iterator<const ForwardRange>::type > boost::range::equal_range	(	const ForwardRange &	rng,
		const Value &	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and equal_range().

template<class ForwardRange , class Value , class SortPredicate >

std::pair< BOOST_DEDUCED_TYPENAME boost::range_iterator<ForwardRange>::type, BOOST_DEDUCED_TYPENAME boost::range_iterator<ForwardRange>::type > boost::range::equal_range	(	ForwardRange &	rng,
		const Value &	val,
		SortPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and equal_range().

template<class ForwardRange , class Value , class SortPredicate >

std::pair< BOOST_DEDUCED_TYPENAME boost::range_iterator<const ForwardRange>::type, BOOST_DEDUCED_TYPENAME boost::range_iterator<const ForwardRange>::type > boost::range::equal_range	(	const ForwardRange &	rng,
		const Value &	val,
		SortPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by equal_range().

template<class Container >

Container& boost::range::erase	(	Container &	on,
		iterator_range< BOOST_DEDUCED_TYPENAME Container::iterator >	to_erase
	)

inline

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

template<class ForwardRange , class Value >

ForwardRange& boost::range::fill	(	ForwardRange &	rng,
		const Value &	val
	)

inline

template function fill

range-based version of the fill std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and fill().

template<class ForwardRange , class Value >

const ForwardRange& boost::range::fill	(	const ForwardRange &	rng,
		const Value &	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by fill().

template<class ForwardRange , class Size , class Value >

ForwardRange& boost::range::fill_n	(	ForwardRange &	rng,
		Size	n,
		const Value &	val
	)

inline

template function fill_n

range-based version of the fill_n std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept; n <= std::distance(boost::begin(rng), boost::end(rng))

References boost::asio::begin, BOOST_ASSERT, BOOST_RANGE_CONCEPT_ASSERT, boost::fusion::distance(), boost::end, and fill_n().

Referenced by boost::const_multi_array_ref< T, NumDims, T * >::const_multi_array_ref(), boost::array< T, i >::fill(), std::fill(), boost::detail::insert_fill_chars(), boost::phoenix::impl::fill_n::operator()(), boost::lambda::ll::fill_n::operator()(), boost::dynamic_bitset< Block, Allocator >::operator<<=(), and boost::dynamic_bitset< Block, Allocator >::operator>>=().

template<class ForwardRange , class Size , class Value >

const ForwardRange& boost::range::fill_n	(	const ForwardRange &	rng,
		Size	n,
		const Value &	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_ASSERT, BOOST_RANGE_CONCEPT_ASSERT, boost::fusion::distance(), and boost::end.

Referenced by fill_n().

template<class SinglePassRange , class Value >

BOOST_DEDUCED_TYPENAME disable_if< is_const<SinglePassRange>, BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange>::type>::type boost::range::find	(	SinglePassRange &	rng,
		const Value &	val
	)

inline

template function find

range-based version of the find std algorithm

Precondition: SinglePassRange is a model of the SinglePassRangeConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find().

template<class SinglePassRange , class Value >

BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange>::type boost::range::find	(	const SinglePassRange &	rng,
		const Value &	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find().

template<range_return_value re, class SinglePassRange , class Value >

BOOST_DEDUCED_TYPENAME disable_if< is_const<SinglePassRange>, BOOST_DEDUCED_TYPENAME range_return<SinglePassRange,re>::type>::type boost::range::find	(	SinglePassRange &	rng,
		const Value &	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find().

template<range_return_value re, class SinglePassRange , class Value >

BOOST_DEDUCED_TYPENAME range_return<const SinglePassRange,re>::type boost::range::find	(	const SinglePassRange &	rng,
		const Value &	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by find(), boost::algorithm::find_first(), boost::algorithm::find_head(), boost::algorithm::find_last(), boost::algorithm::find_nth(), boost::algorithm::find_tail(), boost::algorithm::find_token(), boost::algorithm::ifind_first(), boost::algorithm::ifind_last(), and boost::algorithm::ifind_nth().

template<class ForwardRange1 , class ForwardRange2 >

BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange1>, BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange1 >::type>::type boost::range::find_end	(	ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2
	)

inline

template function find_end

range-based version of the find_end std algorithm

Precondition: ForwardRange1 is a model of the ForwardRangeConcept; ForwardRange2 is a model of the ForwardRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_end().

Referenced by boost::lambda::ll::find_end::operator()(), boost::phoenix::impl::find_end::operator()(), and boost::container::basic_string< CharT, Traits, Allocator >::rfind().

template<class ForwardRange1 , class ForwardRange2 >

BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange1 >::type boost::range::find_end	(	const ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_end().

template<class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange1>, BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange1>::type>::type boost::range::find_end	(	ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_end().

template<class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange1>::type boost::range::find_end	(	const ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_end().

template<range_return_value re, class ForwardRange1 , class ForwardRange2 >

BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange1>, BOOST_DEDUCED_TYPENAME range_return<ForwardRange1,re>::type>::type boost::range::find_end	(	ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_end().

template<range_return_value re, class ForwardRange1 , class ForwardRange2 >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange1,re>::type boost::range::find_end	(	const ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_end().

template<range_return_value re, class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange1>, BOOST_DEDUCED_TYPENAME range_return<ForwardRange1,re>::type>::type boost::range::find_end	(	ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_end().

template<range_return_value re, class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange1,re>::type boost::range::find_end	(	const ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by find_end().

template<class SinglePassRange1 , class ForwardRange2 >

BOOST_DEDUCED_TYPENAME disable_if< is_const<SinglePassRange1>, BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type>::type boost::range::find_first_of	(	SinglePassRange1 &	rng1,
		ForwardRange2 const &	rng2
	)

inline

template function find_first_of

range-based version of the find_first_of std algorithm

Precondition: SinglePassRange1 is a model of the SinglePassRangeConcept; ForwardRange2 is a model of the ForwardRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_first_of().

Referenced by boost::basic_string_ref< charT, traits >::find_first_of(), boost::container::basic_string< CharT, Traits, Allocator >::find_first_of(), boost::wave::util::flex_string< E, T, A, Storage >::find_first_of(), boost::basic_string_ref< charT, traits >::find_last_of(), boost::container::basic_string< CharT, Traits, Allocator >::find_last_of(), boost::lambda::ll::find_first_of::operator()(), boost::phoenix::impl::find_first_of::operator()(), and boost::msm::front::euml::StringFindFirstOf_< Container, Param1, Param2, Param3 >::operator()().

template<class SinglePassRange1 , class ForwardRange2 >

BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type boost::range::find_first_of	(	const SinglePassRange1 &	rng1,
		const ForwardRange2 &	rng2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_first_of().

template<class SinglePassRange1 , class ForwardRange2 , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME disable_if< is_const<SinglePassRange1>, BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type>::type boost::range::find_first_of	(	SinglePassRange1 &	rng1,
		ForwardRange2 const &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_first_of().

template<class SinglePassRange1 , class ForwardRange2 , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type boost::range::find_first_of	(	const SinglePassRange1 &	rng1,
		const ForwardRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_first_of().

template<range_return_value re, class SinglePassRange1 , class ForwardRange2 >

BOOST_DEDUCED_TYPENAME disable_if< is_const<SinglePassRange1>, BOOST_DEDUCED_TYPENAME range_return<SinglePassRange1,re>::type>::type boost::range::find_first_of	(	SinglePassRange1 &	rng1,
		const ForwardRange2 &	rng2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_first_of().

template<range_return_value re, class SinglePassRange1 , class ForwardRange2 >

BOOST_DEDUCED_TYPENAME range_return<const SinglePassRange1,re>::type boost::range::find_first_of	(	const SinglePassRange1 &	rng1,
		const ForwardRange2 &	rng2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_first_of().

template<range_return_value re, class SinglePassRange1 , class ForwardRange2 , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME disable_if< is_const<SinglePassRange1>, BOOST_DEDUCED_TYPENAME range_return<SinglePassRange1,re>::type>::type boost::range::find_first_of	(	SinglePassRange1 &	rng1,
		const ForwardRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_first_of().

template<range_return_value re, class SinglePassRange1 , class ForwardRange2 , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<const SinglePassRange1,re>::type boost::range::find_first_of	(	const SinglePassRange1 &	rng1,
		const ForwardRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by find_first_of().

template<class SinglePassRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME disable_if< is_const<SinglePassRange>, BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange>::type>::type boost::range::find_if	(	SinglePassRange &	rng,
		UnaryPredicate	pred
	)

inline

template function find_if

range-based version of the find_if std algorithm

Precondition: SinglePassRange is a model of the SinglePassRangeConcept; UnaryPredicate is a model of the UnaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_if().

template<class SinglePassRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange>::type boost::range::find_if	(	const SinglePassRange &	rng,
		UnaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_if().

template<range_return_value re, class SinglePassRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME disable_if< is_const<SinglePassRange>, BOOST_DEDUCED_TYPENAME range_return<SinglePassRange,re>::type>::type boost::range::find_if	(	SinglePassRange &	rng,
		UnaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and find_if().

template<range_return_value re, class SinglePassRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<const SinglePassRange,re>::type boost::range::find_if	(	const SinglePassRange &	rng,
		UnaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by find_if().

template<class SinglePassRange1 , class SinglePassRange2 , class Fn2 >

Fn2 boost::range::for_each	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		Fn2	fn
	)

inline

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::for_each_impl().

template<class SinglePassRange1 , class SinglePassRange2 , class Fn2 >

Fn2 boost::range::for_each	(	const SinglePassRange1 &	rng1,
		SinglePassRange2 &	rng2,
		Fn2	fn
	)

inline

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::for_each_impl().

template<class SinglePassRange1 , class SinglePassRange2 , class Fn2 >

Fn2 boost::range::for_each	(	SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		Fn2	fn
	)

inline

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::for_each_impl().

template<class SinglePassRange , class UnaryFunction >

UnaryFunction boost::range::for_each	(	SinglePassRange &	rng,
		UnaryFunction	fun
	)

inline

template function for_each

range-based version of the for_each std algorithm

Precondition: SinglePassRange is a model of the SinglePassRangeConcept; UnaryFunction is a model of the UnaryFunctionConcept

References boost::asio::begin, BOOST_DEDUCED_TYPENAME, BOOST_RANGE_CONCEPT_ASSERT, boost::end, for_each(), and boost::range_detail::for_each_impl().

template<class SinglePassRange1 , class SinglePassRange2 , class Fn2 >

Fn2 boost::range::for_each	(	SinglePassRange1 &	rng1,
		SinglePassRange2 &	rng2,
		Fn2	fn
	)

inline

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::for_each_impl().

Referenced by boost::fusion::for_each(), and for_each().

template<class SinglePassRange , class UnaryFunction >

UnaryFunction boost::range::for_each	(	const SinglePassRange &	rng,
		UnaryFunction	fun
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_DEDUCED_TYPENAME, BOOST_RANGE_CONCEPT_ASSERT, boost::end, for_each(), and boost::range_detail::for_each_impl().

template<class ForwardRange , class Generator >

ForwardRange& boost::range::generate	(	ForwardRange &	rng,
		Generator	gen
	)

inline

template function generate

range-based version of the generate std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept; Generator is a model of the UnaryFunctionConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::spirit::karma::generate().

Referenced by BOOST_PHOENIX_DEFINE_EXPRESSION(), boost::wave::util::macromap< ContextT >::expand_tokensequence(), boost::wave::util::macromap< ContextT >::expand_whole_tokensequence(), boost::random::discard_block_engine< UniformRandomNumberGenerator, p, r >::generate(), boost::gil::generate_pixels(), boost::random::poisson_distribution< IntType, RealType >::operator()(), boost::random::binomial_distribution< IntType, RealType >::operator()(), boost::random::uniform_smallint< IntType >::operator()(), boost::locale::generator::operator()(), boost::phoenix::impl::generate::operator()(), boost::random::uniform_smallint< boost::multiprecision::number< Backend, ExpressionTemplates > >::operator()(), boost::lambda::ll::generate::operator()(), and boost::spirit::post_order::traverse().

template<class ForwardRange , class Generator >

const ForwardRange& boost::range::generate	(	const ForwardRange &	rng,
		Generator	gen
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::spirit::karma::generate().

template<class SinglePassRange1 , class SinglePassRange2 >

bool boost::range::includes	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2
	)

inline

template function includes

range-based version of the includes std algorithm

Precondition: SinglePassRange1 is a model of the SinglePassRangeConcept; SinglePassRange2 is a model of the SinglePassRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and includes().

Referenced by boost::wave::context< IteratorT, LexIteratorT, InputPolicyT, HooksT, DerivedT >::find_include_file(), boost::wave::context< IteratorT, LexIteratorT, InputPolicyT, HooksT, DerivedT >::init_context(), boost::phoenix::impl::includes::operator()(), boost::lambda::ll::includes::operator()(), and boost::wave::context< IteratorT, LexIteratorT, InputPolicyT, HooksT, DerivedT >::set_current_directory().

template<class SinglePassRange1 , class SinglePassRange2 , class BinaryPredicate >

bool boost::range::includes	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by includes().

template<class BidirectionalRange >

BidirectionalRange& boost::range::inplace_merge	(	BidirectionalRange &	rng,
		BOOST_DEDUCED_TYPENAME range_iterator< BidirectionalRange >::type	middle
	)

inline

template function inplace_merge

range-based version of the inplace_merge std algorithm

Precondition: BidirectionalRange is a model of the BidirectionalRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and inplace_merge().

Referenced by boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::ptr_sequence_adapter< T, boost::circular_buffer< void *, Allocator >, CloneAllocator >::merge(), boost::phoenix::impl::inplace_merge::operator()(), boost::lambda::ll::inplace_merge::operator()(), and boost::graph::distributed::cc_detail::parallel_connected_components().

template<class BidirectionalRange >

const BidirectionalRange& boost::range::inplace_merge	(	const BidirectionalRange &	rng,
		BOOST_DEDUCED_TYPENAME boost::range_iterator< const BidirectionalRange >::type	middle
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and inplace_merge().

template<class BidirectionalRange , class BinaryPredicate >

BidirectionalRange& boost::range::inplace_merge	(	BidirectionalRange &	rng,
		BOOST_DEDUCED_TYPENAME boost::range_iterator< BidirectionalRange >::type	middle,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and inplace_merge().

template<class BidirectionalRange , class BinaryPredicate >

const BidirectionalRange& boost::range::inplace_merge	(	const BidirectionalRange &	rng,
		BOOST_DEDUCED_TYPENAME boost::range_iterator< const BidirectionalRange >::type	middle,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by inplace_merge().

template<class Container , class Range >

Container& boost::range::insert	(	Container &	on,
		BOOST_DEDUCED_TYPENAME Container::iterator	before,
		const Range &	from
	)

inline

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

template<class Container , class Range >

Container& boost::range::insert	(	Container &	on,
		const Range &	from
	)

inline

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

template<class ForwardRange , class Value >

ForwardRange& boost::range::iota	(	ForwardRange &	rng,
		Value	x
	)

inline

References boost::asio::begin, boost::BOOST_CONCEPT_ASSERT(), BOOST_DEDUCED_TYPENAME, boost::asio::end, boost::target(), and boost::flyweights::x.

template<class ForwardRange , class Value >

const ForwardRange& boost::range::iota	(	const ForwardRange &	rng,
		Value	x
	)

inline

References boost::asio::begin, boost::BOOST_CONCEPT_ASSERT(), BOOST_DEDUCED_TYPENAME, boost::asio::end, boost::target(), and boost::flyweights::x.

template<class SinglePassRange >

bool boost::range::is_sorted ( const SinglePassRange & rng )

inline

template function is_sorted

range-based version of the is_sorted std algorithm

Precondition: SinglePassRange is a model of the SinglePassRangeConcept

References boost::asio::begin, BOOST_DEDUCED_TYPENAME, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and is_sorted().

template<class SinglePassRange , class BinaryPredicate >

bool boost::range::is_sorted	(	const SinglePassRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_DEDUCED_TYPENAME, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by is_sorted().

template<class Type , class Elem , class Traits >

iterator_range<std::istream_iterator<Type, Elem, Traits> > boost::range::istream_range ( std::basic_istream< Elem, Traits > & in )

inline

References boost::flyweights::in.

template<class SinglePassRange1 , class SinglePassRange2 >

joined_range<const SinglePassRange1, const SinglePassRange2> boost::range::join	(	const SinglePassRange1 &	r1,
		const SinglePassRange2 &	r2
	)

References BOOST_RANGE_CONCEPT_ASSERT.

template<class SinglePassRange1 , class SinglePassRange2 >

joined_range<SinglePassRange1, SinglePassRange2> boost::range::join	(	SinglePassRange1 &	r1,
		SinglePassRange2 &	r2
	)

References BOOST_RANGE_CONCEPT_ASSERT.

template<class SinglePassRange1 , class SinglePassRange2 >

bool boost::range::lexicographical_compare	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2
	)

inline

template function lexicographic_compare

range-based version of the lexicographic_compare std algorithm

Precondition: SinglePassRange1 is a model of the SinglePassRangeConcept; SinglePassRange2 is a model of the SinglePassRangeConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and lexicographical_compare().

template<class SinglePassRange1 , class SinglePassRange2 , class BinaryPredicate >

bool boost::range::lexicographical_compare	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by lexicographical_compare().

template<class ForwardRange , class Value >

BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange>, BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type>::type boost::range::lower_bound	(	ForwardRange &	rng,
		Value	val
	)

inline

template function lower_bound

range-based version of the lower_bound std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and lower_bound().

template<class ForwardRange , class Value >

BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type boost::range::lower_bound	(	const ForwardRange &	rng,
		Value	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and lower_bound().

template<class ForwardRange , class Value , class SortPredicate >

BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange>, BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type>::type boost::range::lower_bound	(	ForwardRange &	rng,
		Value	val,
		SortPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and lower_bound().

template<class ForwardRange , class Value , class SortPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type boost::range::lower_bound	(	const ForwardRange &	rng,
		Value	val,
		SortPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and lower_bound().

template<range_return_value re, class ForwardRange , class Value >

BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange>, BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type>::type boost::range::lower_bound	(	ForwardRange &	rng,
		Value	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and lower_bound().

template<range_return_value re, class ForwardRange , class Value >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type boost::range::lower_bound	(	const ForwardRange &	rng,
		Value	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and lower_bound().

template<range_return_value re, class ForwardRange , class Value , class SortPredicate >

BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange>, BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type>::type boost::range::lower_bound	(	ForwardRange &	rng,
		Value	val,
		SortPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and lower_bound().

template<range_return_value re, class ForwardRange , class Value , class SortPredicate >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type boost::range::lower_bound	(	const ForwardRange &	rng,
		Value	val,
		SortPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by lower_bound().

template<class RandomAccessRange >

RandomAccessRange& boost::range::make_heap ( RandomAccessRange & rng )

inline

template function make_heap

range-based version of the make_heap std algorithm

Precondition: RandomAccessRange is a model of the RandomAccessRangeConcept; Compare is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and make_heap().

Referenced by boost::detail::bfs_king_visitor< OutputIterator, Buffer, Compare, PseudoDegreeMap, VecMap, VertexIndexMap >::finish_vertex(), boost::phoenix::impl::make_heap::operator()(), and boost::lambda::ll::make_heap::operator()().

template<class RandomAccessRange >

const RandomAccessRange& boost::range::make_heap ( const RandomAccessRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and make_heap().

template<class RandomAccessRange , class Compare >

RandomAccessRange& boost::range::make_heap	(	RandomAccessRange &	rng,
		Compare	comp_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and make_heap().

template<class RandomAccessRange , class Compare >

const RandomAccessRange& boost::range::make_heap	(	const RandomAccessRange &	rng,
		Compare	comp_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by make_heap().

template<class ForwardRange >

BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type boost::range::max_element ( ForwardRange & rng )

inline

template function max_element

range-based version of the max_element std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and max_element().

Referenced by boost::betweenness_centrality_clustering(), boost::bucket_sort(), boost::geometry::detail::point_on_surface::calculate_point_on_surface(), boost::geometry::detail::point_on_surface::max_value(), boost::numeric::odeint::vector_space_norm_inf< vex::multivector< T, N > >::operator()(), boost::geometry::detail::point_on_surface::select_below< Dimension, Value >::operator()(), boost::phoenix::impl::max_element::operator()(), and boost::lambda::ll::max_element::operator()().

template<class ForwardRange >

BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type boost::range::max_element ( const ForwardRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and max_element().

template<class ForwardRange , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type boost::range::max_element	(	ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and max_element().

template<class ForwardRange , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type boost::range::max_element	(	const ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and max_element().

template<range_return_value re, class ForwardRange >

BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type boost::range::max_element ( ForwardRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and max_element().

template<range_return_value re, class ForwardRange >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type boost::range::max_element ( const ForwardRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and max_element().

template<range_return_value re, class ForwardRange , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type boost::range::max_element	(	ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and max_element().

template<range_return_value re, class ForwardRange , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type boost::range::max_element	(	const ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by max_element().

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator >

OutputIterator boost::range::merge	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		OutputIterator	out
	)

inline

template function merge

range-based version of the merge std algorithm

Precondition: SinglePassRange1 is a model of the SinglePassRangeConcept; SinglePassRange2 is a model of the SinglePassRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and merge().

Referenced by boost::heap::heap_merge(), boost::heap::detail::heap_merge_same< Heap >::merge(), boost::phoenix::impl::merge::operator()(), and boost::lambda::ll::merge::operator()().

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator , class BinaryPredicate >

OutputIterator boost::range::merge	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		OutputIterator	out,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by merge().

template<class ForwardRange >

BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type boost::range::min_element ( ForwardRange & rng )

inline

template function min_element

range-based version of the min_element std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and min_element().

Referenced by boost::down_heap(), boost::graph::distributed::detail::initialize_min_in_weights(), boost::graph::distributed::detail::initialize_min_out_weights(), boost::accumulators::impl::weighted_p_square_quantile_impl< Sample, Weight, Impl >::operator()(), boost::accumulators::impl::weighted_p_square_cumulative_distribution_impl< Sample, Weight >::operator()(), boost::accumulators::impl::weighted_extended_p_square_impl< Sample, Weight >::operator()(), boost::geometry::detail::point_on_surface::min_of_intruder< Dimension, Value >::operator()(), boost::phoenix::impl::min_element::operator()(), and boost::lambda::ll::min_element::operator()().

template<class ForwardRange >

BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type boost::range::min_element ( const ForwardRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and min_element().

template<class ForwardRange , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type boost::range::min_element	(	ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and min_element().

template<class ForwardRange , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type boost::range::min_element	(	const ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and min_element().

template<range_return_value re, class ForwardRange >

BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type boost::range::min_element ( ForwardRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and min_element().

template<range_return_value re, class ForwardRange >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type boost::range::min_element ( const ForwardRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and min_element().

template<range_return_value re, class ForwardRange , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type boost::range::min_element	(	ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and min_element().

template<range_return_value re, class ForwardRange , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type boost::range::min_element	(	const ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by min_element().

template<class SinglePassRange1 , class SinglePassRange2 >

std::pair< BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type, BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type > boost::range::mismatch	(	SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2
	)

inline

template function mismatch

range-based version of the mismatch std algorithm

Precondition: SinglePassRange1 is a model of the SinglePassRangeConcept; SinglePassRange2 is a model of the SinglePassRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::mismatch_impl().

template<class SinglePassRange1 , class SinglePassRange2 >

std::pair< BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type, BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type > boost::range::mismatch	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::mismatch_impl().

template<class SinglePassRange1 , class SinglePassRange2 >

std::pair< BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type, BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type > boost::range::mismatch	(	SinglePassRange1 &	rng1,
		SinglePassRange2 &	rng2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::mismatch_impl().

template<class SinglePassRange1 , class SinglePassRange2 >

std::pair< BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type, BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type > boost::range::mismatch	(	const SinglePassRange1 &	rng1,
		SinglePassRange2 &	rng2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::mismatch_impl().

template<class SinglePassRange1 , class SinglePassRange2 , class BinaryPredicate >

std::pair< BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type, BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type > boost::range::mismatch	(	SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::mismatch_impl().

template<class SinglePassRange1 , class SinglePassRange2 , class BinaryPredicate >

std::pair< BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type, BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange2>::type > boost::range::mismatch	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::mismatch_impl().

template<class SinglePassRange1 , class SinglePassRange2 , class BinaryPredicate >

std::pair< BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange1>::type, BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type > boost::range::mismatch	(	SinglePassRange1 &	rng1,
		SinglePassRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::mismatch_impl().

template<class SinglePassRange1 , class SinglePassRange2 , class BinaryPredicate >

std::pair< BOOST_DEDUCED_TYPENAME range_iterator<const SinglePassRange1>::type, BOOST_DEDUCED_TYPENAME range_iterator<SinglePassRange2>::type > boost::range::mismatch	(	const SinglePassRange1 &	rng1,
		SinglePassRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::mismatch_impl().

template<class BidirectionalRange >

bool boost::range::next_permutation ( BidirectionalRange & rng )

inline

template function next_permutation

range-based version of the next_permutation std algorithm

Precondition: BidirectionalRange is a model of the BidirectionalRangeConcept; Compare is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and next_permutation().

Referenced by boost::phoenix::impl::next_permutation::operator()(), and boost::lambda::ll::next_permutation::operator()().

template<class BidirectionalRange >

bool boost::range::next_permutation ( const BidirectionalRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and next_permutation().

template<class BidirectionalRange , class Compare >

bool boost::range::next_permutation	(	BidirectionalRange &	rng,
		Compare	comp_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and next_permutation().

template<class BidirectionalRange , class Compare >

bool boost::range::next_permutation	(	const BidirectionalRange &	rng,
		Compare	comp_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by next_permutation().

template<class RandomAccessRange >

RandomAccessRange& boost::range::nth_element	(	RandomAccessRange &	rng,
		BOOST_DEDUCED_TYPENAME range_iterator< RandomAccessRange >::type	nth
	)

inline

template function nth_element

range-based version of the nth_element std algorithm

Precondition: RandomAccessRange is a model of the RandomAccessRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and nth_element().

Referenced by boost::phoenix::impl::nth_element::operator()(), and boost::lambda::ll::nth_element::operator()().

template<class RandomAccessRange >

const RandomAccessRange& boost::range::nth_element	(	const RandomAccessRange &	rng,
		BOOST_DEDUCED_TYPENAME range_iterator< const RandomAccessRange >::type	nth
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and nth_element().

template<class RandomAccessRange , class BinaryPredicate >

RandomAccessRange& boost::range::nth_element	(	RandomAccessRange &	rng,
		BOOST_DEDUCED_TYPENAME range_iterator< RandomAccessRange >::type	nth,
		BinaryPredicate	sort_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and nth_element().

template<class RandomAccessRange , class BinaryPredicate >

const RandomAccessRange& boost::range::nth_element	(	const RandomAccessRange &	rng,
		BOOST_DEDUCED_TYPENAME range_iterator< const RandomAccessRange >::type	nth,
		BinaryPredicate	sort_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by nth_element().

template<class SinglePassRange1 , class SinglePassRange2 >

void boost::range::overwrite	(	const SinglePassRange1 &	from,
		SinglePassRange2 &	to
	)

inline

References boost::asio::begin, BOOST_ASSERT, BOOST_DEDUCED_TYPENAME, BOOST_RANGE_CONCEPT_ASSERT, boost::end, boost::multiprecision::backends::i, and boost::out.

template<class SinglePassRange1 , class SinglePassRange2 >

void boost::range::overwrite	(	const SinglePassRange1 &	from,
		const SinglePassRange2 &	to
	)

inline

References boost::asio::begin, BOOST_ASSERT, BOOST_DEDUCED_TYPENAME, BOOST_RANGE_CONCEPT_ASSERT, boost::end, boost::multiprecision::backends::i, and boost::out.

template<class RandomAccessRange >

RandomAccessRange& boost::range::partial_sort	(	RandomAccessRange &	rng,
		BOOST_DEDUCED_TYPENAME range_iterator< RandomAccessRange >::type	middle
	)

inline

template function partial_sort

range-based version of the partial_sort std algorithm

Precondition: RandomAccessRange is a model of the RandomAccessRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and partial_sort().

Referenced by boost::phoenix::impl::partial_sort::operator()(), and boost::lambda::ll::partial_sort::operator()().

template<class RandomAccessRange >

const RandomAccessRange& boost::range::partial_sort	(	const RandomAccessRange &	rng,
		BOOST_DEDUCED_TYPENAME range_iterator< const RandomAccessRange >::type	middle
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and partial_sort().

template<class RandomAccessRange , class BinaryPredicate >

RandomAccessRange& boost::range::partial_sort	(	RandomAccessRange &	rng,
		BOOST_DEDUCED_TYPENAME range_iterator< RandomAccessRange >::type	middle,
		BinaryPredicate	sort_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and partial_sort().

template<class RandomAccessRange , class BinaryPredicate >

const RandomAccessRange& boost::range::partial_sort	(	const RandomAccessRange &	rng,
		BOOST_DEDUCED_TYPENAME range_iterator< const RandomAccessRange >::type	middle,
		BinaryPredicate	sort_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by partial_sort().

template<class SinglePassRange , class RandomAccessRange >

BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type boost::range::partial_sort_copy	(	const SinglePassRange &	rng1,
		RandomAccessRange &	rng2
	)

inline

template function partial_sort_copy

range-based version of the partial_sort_copy std algorithm

Precondition: SinglePassRange is a model of the SinglePassRangeConcept; RandomAccessRange is a model of the Mutable_RandomAccessRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and partial_sort_copy().

Referenced by boost::phoenix::impl::partial_sort_copy::operator()(), and boost::lambda::ll::partial_sort_copy::operator()().

template<class SinglePassRange , class RandomAccessRange >

BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type boost::range::partial_sort_copy	(	const SinglePassRange &	rng1,
		const RandomAccessRange &	rng2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and partial_sort_copy().

template<class SinglePassRange , class RandomAccessRange , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type boost::range::partial_sort_copy	(	const SinglePassRange &	rng1,
		RandomAccessRange &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and partial_sort_copy().

template<class SinglePassRange , class RandomAccessRange , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type boost::range::partial_sort_copy	(	const SinglePassRange &	rng1,
		const RandomAccessRange &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by partial_sort_copy().

template<class ForwardRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type boost::range::partition	(	ForwardRange &	rng,
		UnaryPredicate	pred
	)

inline

template function partition

range-based version of the partition std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and partition().

Referenced by boost::phoenix::impl::partition::operator()(), and boost::lambda::ll::partition::operator()().

template<class ForwardRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type boost::range::partition	(	const ForwardRange &	rng,
		UnaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and partition().

template<range_return_value re, class ForwardRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type boost::range::partition	(	ForwardRange &	rng,
		UnaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and partition().

template<range_return_value re, class ForwardRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type boost::range::partition	(	const ForwardRange &	rng,
		UnaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by partition().

template<class RandomAccessRange >

RandomAccessRange& boost::range::pop_heap ( RandomAccessRange & rng )

inline

template function pop_heap

range-based version of the pop_heap std algorithm

Precondition: RandomAccessRange is a model of the RandomAccessRangeConcept; Compare is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and pop_heap().

Referenced by boost::accumulators::impl::tail_impl< Sample, LeftRight >::operator()(), boost::phoenix::impl::pop_heap::operator()(), boost::lambda::ll::pop_heap::operator()(), and boost::heap::priority_queue< T, A0, A1, A2, A3 >::pop().

template<class RandomAccessRange >

const RandomAccessRange& boost::range::pop_heap ( const RandomAccessRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and pop_heap().

template<class RandomAccessRange , class Compare >

RandomAccessRange& boost::range::pop_heap	(	RandomAccessRange &	rng,
		Compare	comp_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and pop_heap().

template<class RandomAccessRange , class Compare >

const RandomAccessRange& boost::range::pop_heap	(	const RandomAccessRange &	rng,
		Compare	comp_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by pop_heap().

template<class BidirectionalRange >

bool boost::range::prev_permutation ( BidirectionalRange & rng )

inline

template function prev_permutation

range-based version of the prev_permutation std algorithm

Precondition: BidirectionalRange is a model of the BidirectionalRangeConcept; Compare is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and prev_permutation().

Referenced by boost::phoenix::impl::prev_permutation::operator()(), and boost::lambda::ll::prev_permutation::operator()().

template<class BidirectionalRange >

bool boost::range::prev_permutation ( const BidirectionalRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and prev_permutation().

template<class BidirectionalRange , class Compare >

bool boost::range::prev_permutation	(	BidirectionalRange &	rng,
		Compare	comp_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and prev_permutation().

template<class BidirectionalRange , class Compare >

bool boost::range::prev_permutation	(	const BidirectionalRange &	rng,
		Compare	comp_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by prev_permutation().

template<class Container , class Range >

Container& boost::range::push_back	(	Container &	on,
		const Range &	from
	)

inline

References boost::asio::begin, BOOST_ASSERT_MSG, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

template<class Container , class Range >

Container& boost::range::push_front	(	Container &	on,
		const Range &	from
	)

inline

References boost::asio::begin, BOOST_ASSERT_MSG, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

template<class RandomAccessRange >

RandomAccessRange& boost::range::push_heap ( RandomAccessRange & rng )

inline

template function push_heap

range-based version of the push_heap std algorithm

Precondition: RandomAccessRange is a model of the RandomAccessRangeConcept; Compare is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and push_heap().

Referenced by boost::heap::priority_queue< T, A0, A1, A2, A3 >::emplace(), boost::phoenix::impl::push_heap::operator()(), boost::lambda::ll::push_heap::operator()(), and boost::heap::priority_queue< T, A0, A1, A2, A3 >::push().

template<class RandomAccessRange >

const RandomAccessRange& boost::range::push_heap ( const RandomAccessRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and push_heap().

template<class RandomAccessRange , class Compare >

RandomAccessRange& boost::range::push_heap	(	RandomAccessRange &	rng,
		Compare	comp_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and push_heap().

template<class RandomAccessRange , class Compare >

const RandomAccessRange& boost::range::push_heap	(	const RandomAccessRange &	rng,
		Compare	comp_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by push_heap().

template<class RandomAccessRange >

RandomAccessRange& boost::range::random_shuffle ( RandomAccessRange & rng )

inline

template function random_shuffle

range-based version of the random_shuffle std algorithm

Precondition: RandomAccessRange is a model of the RandomAccessRangeConcept; Generator is a model of the UnaryFunctionConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and random_shuffle().

Referenced by boost::phoenix::impl::random_shuffle::operator()(), boost::lambda::ll::random_shuffle::operator()(), boost::parallel::random_distribution::random_distribution(), and boost::parallel::twod_random::twod_random().

template<class RandomAccessRange >

const RandomAccessRange& boost::range::random_shuffle ( const RandomAccessRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and random_shuffle().

template<class RandomAccessRange , class Generator >

RandomAccessRange& boost::range::random_shuffle	(	RandomAccessRange &	rng,
		Generator &	gen
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and random_shuffle().

template<class RandomAccessRange , class Generator >

const RandomAccessRange& boost::range::random_shuffle	(	const RandomAccessRange &	rng,
		Generator &	gen
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by random_shuffle().

template<class ForwardRange , class Value >

BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type boost::range::remove	(	ForwardRange &	rng,
		const Value &	val
	)

inline

template function remove

range-based version of the remove std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, remove(), and boost::phoenix::val().

template<class ForwardRange , class Value >

BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type boost::range::remove	(	const ForwardRange &	rng,
		const Value &	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, remove(), and boost::phoenix::val().

template<range_return_value re, class ForwardRange , class Value >

BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type boost::range::remove	(	ForwardRange &	rng,
		const Value &	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, remove(), and boost::phoenix::val().

template<range_return_value re, class ForwardRange , class Value >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type boost::range::remove	(	const ForwardRange &	rng,
		const Value &	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::phoenix::val().

Referenced by remove().

template<class SinglePassRange , class OutputIterator , class Value >

OutputIterator boost::range::remove_copy	(	const SinglePassRange &	rng,
		OutputIterator	out_it,
		const Value &	val
	)

inline

template function remove_copy

range-based version of the remove_copy std algorithm

Precondition: SinglePassRange is a model of the SinglePassRangeConcept; OutputIterator is a model of the OutputIteratorConcept; Value is a model of the EqualityComparableConcept; Objects of type Value can be compared for equality with objects of InputIterator's value type.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by boost::phoenix::impl::remove_copy::operator()(), and boost::lambda::ll::remove_copy::operator()().

template<class Container , class T >

Container& boost::range::remove_erase	(	Container &	on,
		const T &	val
	)

inline

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::filesystem::detail::remove().

template<class Container , class Pred >

Container& boost::range::remove_erase_if	(	Container &	on,
		Pred	pred
	)

inline

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::fusion::remove_if().

template<class ForwardRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME boost::range_iterator<ForwardRange>::type boost::range::remove_if	(	ForwardRange &	rng,
		UnaryPredicate	pred
	)

inline

template function remove_if

range-based version of the remove_if std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept; UnaryPredicate is a model of the UnaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and remove_if().

template<class ForwardRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME boost::range_iterator<const ForwardRange>::type boost::range::remove_if	(	const ForwardRange &	rng,
		UnaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and remove_if().

template<range_return_value re, class ForwardRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type boost::range::remove_if	(	ForwardRange &	rng,
		UnaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and remove_if().

template<range_return_value re, class ForwardRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type boost::range::remove_if	(	const ForwardRange &	rng,
		UnaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by remove_if().

template<class ForwardRange , class Value >

ForwardRange& boost::range::replace	(	ForwardRange &	rng,
		const Value &	what,
		const Value &	with_what
	)

inline

template function replace

range-based version of the replace std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and replace().

template<class ForwardRange , class Value >

const ForwardRange& boost::range::replace	(	const ForwardRange &	rng,
		const Value &	what,
		const Value &	with_what
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by replace().

template<class ForwardRange , class OutputIterator , class Value >

OutputIterator boost::range::replace_copy	(	const ForwardRange &	rng,
		OutputIterator	out_it,
		const Value &	what,
		const Value &	with_what
	)

inline

template function replace_copy

range-based version of the replace_copy std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by boost::phoenix::impl::replace_copy::operator()(), and boost::lambda::ll::replace_copy::operator()().

template<class ForwardRange , class OutputIterator , class Predicate , class Value >

OutputIterator boost::range::replace_copy_if	(	const ForwardRange &	rng,
		OutputIterator	out_it,
		Predicate	pred,
		const Value &	with_what
	)

inline

template function replace_copy_if

range-based version of the replace_copy_if std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept; Predicate is a model of the PredicateConcept; Value is convertible to Predicate's argument type; Value is Assignable; Value is convertible to a type in OutputIterator's set of value types.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by boost::phoenix::impl::replace_copy_if::operator()(), and boost::lambda::ll::replace_copy_if::operator()().

template<class ForwardRange , class UnaryPredicate , class Value >

ForwardRange& boost::range::replace_if	(	ForwardRange &	rng,
		UnaryPredicate	pred,
		const Value &	val
	)

inline

template function replace_if

range-based version of the replace_if std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept; UnaryPredicate is a model of the UnaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and replace_if().

template<class ForwardRange , class UnaryPredicate , class Value >

const ForwardRange& boost::range::replace_if	(	const ForwardRange &	rng,
		UnaryPredicate	pred,
		const Value &	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by replace_if().

template<class BidirectionalRange >

BidirectionalRange& boost::range::reverse ( BidirectionalRange & rng )

inline

template function reverse

range-based version of the reverse std algorithm

Precondition: BidirectionalRange is a model of the BidirectionalRangeConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and reverse().

template<class BidirectionalRange >

const BidirectionalRange& boost::range::reverse ( const BidirectionalRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by boost::geometry::detail::reverse::range_reverse::apply(), and reverse().

template<class BidirectionalRange , class OutputIterator >

OutputIterator boost::range::reverse_copy	(	const BidirectionalRange &	rng,
		OutputIterator	out
	)

inline

template function reverse_copy

range-based version of the reverse_copy std algorithm

Precondition: BidirectionalRange is a model of the BidirectionalRangeConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by boost::find_odd_cycle(), boost::phoenix::impl::reverse_copy::operator()(), and boost::lambda::ll::reverse_copy::operator()().

template<class ForwardRange >

ForwardRange& boost::range::rotate	(	ForwardRange &	rng,
		BOOST_DEDUCED_TYPENAME range_iterator< ForwardRange >::type	middle
	)

inline

template function rotate

range-based version of the rotate std algorithm

Precondition: Rng meets the requirements for a Forward range

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and rotate().

Referenced by boost::numeric::ublas::coordinate_vector< T, IB, IA, TA >::inplace_merge(), boost::numeric::ublas::coordinate_matrix< T, L, IB, IA, TA >::inplace_merge(), boost::phoenix::impl::rotate::operator()(), and boost::lambda::ll::rotate::operator()().

template<class ForwardRange >

const ForwardRange& boost::range::rotate	(	const ForwardRange &	rng,
		BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type	middle
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by rotate().

template<typename ForwardRange , typename OutputIterator >

OutputIterator boost::range::rotate_copy	(	const ForwardRange &	rng,
		BOOST_DEDUCED_TYPENAME range_iterator< const ForwardRange >::type	middle,
		OutputIterator	target
	)

inline

template function rotate

range-based version of the rotate std algorithm

Precondition: Rng meets the requirements for a Forward range

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by boost::phoenix::impl::rotate_copy::operator()(), and boost::lambda::ll::rotate_copy::operator()().

template<class ForwardRange1 , class ForwardRange2 >

BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange1>::type boost::range::search	(	ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2
	)

inline

template function search

range-based version of the search std algorithm

Precondition: ForwardRange1 is a model of the ForwardRangeConcept; ForwardRange2 is a model of the ForwardRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and search().

Referenced by boost::basic_string_ref< charT, traits >::find(), boost::container::basic_string< CharT, Traits, Allocator >::find(), boost::lambda::ll::search::operator()(), boost::phoenix::impl::search::operator()(), and boost::basic_string_ref< charT, traits >::rfind().

template<class ForwardRange1 , class ForwardRange2 >

BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange1>::type boost::range::search	(	const ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and search().

template<class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange1>::type boost::range::search	(	ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and search().

template<class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange1>::type boost::range::search	(	const ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and search().

template<range_return_value re, class ForwardRange1 , class ForwardRange2 >

BOOST_DEDUCED_TYPENAME range_return<ForwardRange1,re>::type boost::range::search	(	ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and search().

template<range_return_value re, class ForwardRange1 , class ForwardRange2 >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange1,re>::type boost::range::search	(	const ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and search().

template<range_return_value re, class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<ForwardRange1,re>::type boost::range::search	(	ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and search().

template<range_return_value re, class ForwardRange1 , class ForwardRange2 , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange1,re>::type boost::range::search	(	const ForwardRange1 &	rng1,
		const ForwardRange2 &	rng2,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by search().

template<class ForwardRange , class Integer , class Value >

BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type boost::range::search_n	(	ForwardRange &	rng,
		Integer	count,
		const Value &	value
	)

inline

template function search

range-based version of the search std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept; Integer is an integral type; Value is a model of the EqualityComparableConcept; ForwardRange's value type is a model of the EqualityComparableConcept; Object's of ForwardRange's value type can be compared for equality with Objects of type Value

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::search_n_impl().

template<class ForwardRange , class Integer , class Value >

BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type boost::range::search_n	(	const ForwardRange &	rng,
		Integer	count,
		const Value &	value
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::search_n_impl().

template<class ForwardRange , class Integer , class Value , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type boost::range::search_n	(	ForwardRange &	rng,
		Integer	count,
		const Value &	value,
		BinaryPredicate	binary_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_DEDUCED_TYPENAME, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::search_n_pred_impl().

template<class ForwardRange , class Integer , class Value , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type boost::range::search_n	(	const ForwardRange &	rng,
		Integer	count,
		const Value &	value,
		BinaryPredicate	binary_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_DEDUCED_TYPENAME, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::search_n_pred_impl().

template<range_return_value re, class ForwardRange , class Integer , class Value >

BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type boost::range::search_n	(	ForwardRange &	rng,
		Integer	count,
		const Value &	value
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::search_n_impl().

template<range_return_value re, class ForwardRange , class Integer , class Value >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type boost::range::search_n	(	const ForwardRange &	rng,
		Integer	count,
		const Value &	value
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::search_n_impl().

template<range_return_value re, class ForwardRange , class Integer , class Value , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type boost::range::search_n	(	ForwardRange &	rng,
		Integer	count,
		const Value &	value,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_DEDUCED_TYPENAME, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::search_n_pred_impl().

template<range_return_value re, class ForwardRange , class Integer , class Value , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type boost::range::search_n	(	const ForwardRange &	rng,
		Integer	count,
		const Value &	value,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_DEDUCED_TYPENAME, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::search_n_pred_impl().

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator >

OutputIterator boost::range::set_difference	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		OutputIterator	out
	)

inline

template function set_difference

range-based version of the set_difference std algorithm

Precondition: SinglePassRange1 is a model of the SinglePassRangeConcept; SinglePassRange2 is a model of the SinglePassRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and set_difference().

Referenced by boost::edge_connectivity(), boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::phoenix::impl::set_difference::operator()(), and boost::lambda::ll::set_difference::operator()().

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator , class BinaryPredicate >

OutputIterator boost::range::set_difference	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		OutputIterator	out,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by set_difference().

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator >

OutputIterator boost::range::set_intersection	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		OutputIterator	out
	)

inline

template function set_intersection

range-based version of the set_intersection std algorithm

Precondition: SinglePassRange1 is a model of the SinglePassRangeConcept; SinglePassRange2 is a model of the SinglePassRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and set_intersection().

Referenced by boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::iterative_bit_vector_dominator_tree(), boost::phoenix::impl::set_intersection::operator()(), and boost::lambda::ll::set_intersection::operator()().

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator , class BinaryPredicate >

OutputIterator boost::range::set_intersection	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		OutputIterator	out,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by set_intersection().

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator >

OutputIterator boost::range::set_symmetric_difference	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		OutputIterator	out
	)

inline

template function set_symmetric_difference

range-based version of the set_symmetric_difference std algorithm

Precondition: SinglePassRange1 is a model of the SinglePassRangeConcept; SinglePassRange2 is a model of the SinglePassRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and set_symmetric_difference().

Referenced by boost::lambda::ll::set_symmetric_difference::operator()(), and boost::phoenix::impl::set_symmetric_difference::operator()().

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator , class BinaryPredicate >

OutputIterator boost::range::set_symmetric_difference	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		OutputIterator	out,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by set_symmetric_difference().

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator >

OutputIterator boost::range::set_union	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		OutputIterator	out
	)

inline

template function set_union

range-based version of the set_union std algorithm

Precondition: SinglePassRange1 is a model of the SinglePassRangeConcept; SinglePassRange2 is a model of the SinglePassRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and set_union().

Referenced by boost::graph::distributed::fleischer_hendrickson_pinar_strong_components(), boost::phoenix::impl::set_union::operator()(), and boost::lambda::ll::set_union::operator()().

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator , class BinaryPredicate >

OutputIterator boost::range::set_union	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		OutputIterator	out,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by set_union().

template<class RandomAccessRange >

RandomAccessRange& boost::range::sort ( RandomAccessRange & rng )

inline

template function sort

range-based version of the sort std algorithm

Precondition: RandomAccessRange is a model of the RandomAccessRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and sort().

Referenced by boost::detail::sort_vertices().

template<class RandomAccessRange >

const RandomAccessRange& boost::range::sort ( const RandomAccessRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and sort().

template<class RandomAccessRange , class BinaryPredicate >

RandomAccessRange& boost::range::sort	(	RandomAccessRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and sort().

template<class RandomAccessRange , class BinaryPredicate >

const RandomAccessRange& boost::range::sort	(	const RandomAccessRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by sort().

template<class RandomAccessRange >

RandomAccessRange& boost::range::sort_heap ( RandomAccessRange & rng )

inline

template function sort_heap

range-based version of the sort_heap std algorithm

Precondition: RandomAccessRange is a model of the RandomAccessRangeConcept; Compare is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and sort_heap().

Referenced by boost::phoenix::impl::sort_heap::operator()(), boost::lambda::ll::sort_heap::operator()(), and boost::accumulators::impl::tail_impl< Sample, LeftRight >::result().

template<class RandomAccessRange >

const RandomAccessRange& boost::range::sort_heap ( const RandomAccessRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and sort_heap().

template<class RandomAccessRange , class Compare >

RandomAccessRange& boost::range::sort_heap	(	RandomAccessRange &	rng,
		Compare	comp_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and sort_heap().

template<class RandomAccessRange , class Compare >

const RandomAccessRange& boost::range::sort_heap	(	const RandomAccessRange &	rng,
		Compare	comp_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by sort_heap().

template<class BidirectionalRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<BidirectionalRange>::type boost::range::stable_partition	(	BidirectionalRange &	rng,
		UnaryPredicate	pred
	)

inline

template function stable_partition

range-based version of the stable_partition std algorithm

Precondition: BidirectionalRange is a model of the BidirectionalRangeConcept; UnaryPredicate is a model of the UnaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and stable_partition().

Referenced by boost::algorithm::gather(), boost::phoenix::impl::stable_partition::operator()(), boost::lambda::ll::stable_partition::operator()(), boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::remove_and_dispose_if(), and boost::intrusive::slist_impl< ValueTraits, SizeType, BoolFlags, HeaderHolder >::remove_if().

template<class BidirectionalRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<const BidirectionalRange>::type boost::range::stable_partition	(	const BidirectionalRange &	rng,
		UnaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and stable_partition().

template<range_return_value re, class BidirectionalRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<BidirectionalRange,re>::type boost::range::stable_partition	(	BidirectionalRange &	rng,
		UnaryPredicate	pred
	)

inline

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and stable_partition().

template<range_return_value re, class BidirectionalRange , class UnaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<const BidirectionalRange,re>::type boost::range::stable_partition	(	const BidirectionalRange &	rng,
		UnaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by stable_partition().

template<class RandomAccessRange >

RandomAccessRange& boost::range::stable_sort ( RandomAccessRange & rng )

inline

template function stable_sort

range-based version of the stable_sort std algorithm

Precondition: RandomAccessRange is a model of the RandomAccessRangeConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and stable_sort().

Referenced by boost::bucket_sort(), boost::extra_greedy_matching< Graph, MateMap >::find_matching(), boost::phoenix::impl::stable_sort::operator()(), and boost::lambda::ll::stable_sort::operator()().

template<class RandomAccessRange >

const RandomAccessRange& boost::range::stable_sort ( const RandomAccessRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and stable_sort().

template<class RandomAccessRange , class BinaryPredicate >

RandomAccessRange& boost::range::stable_sort	(	RandomAccessRange &	rng,
		BinaryPredicate	sort_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and stable_sort().

template<class RandomAccessRange , class BinaryPredicate >

const RandomAccessRange& boost::range::stable_sort	(	const RandomAccessRange &	rng,
		BinaryPredicate	sort_pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by stable_sort().

template<class SinglePassRange1 , class SinglePassRange2 >

SinglePassRange2& boost::range::swap_ranges	(	SinglePassRange1 &	range1,
		SinglePassRange2 &	range2
	)

inline

template function swap_ranges

range-based version of the swap_ranges std algorithm

Precondition: SinglePassRange1 is a model of the SinglePassRangeConcept; SinglePassRange2 is a model of the SinglePassRangeConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::swap_ranges_impl().

Referenced by boost::lambda::ll::swap_ranges::operator()(), boost::numeric::ublas::bounded_array< T, M *N >::swap(), boost::wave::util::SmallStringOpt< Storage, threshold, Align >::swap(), boost::numeric::ublas::c_vector< T, N >::swap(), and boost::numeric::ublas::c_matrix< T, N, M >::swap().

template<class SinglePassRange1 , class SinglePassRange2 >

SinglePassRange2& boost::range::swap_ranges	(	const SinglePassRange1 &	range1,
		SinglePassRange2 &	range2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::swap_ranges_impl().

template<class SinglePassRange1 , class SinglePassRange2 >

const SinglePassRange2& boost::range::swap_ranges	(	SinglePassRange1 &	range1,
		const SinglePassRange2 &	range2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::swap_ranges_impl().

template<class SinglePassRange1 , class SinglePassRange2 >

const SinglePassRange2& boost::range::swap_ranges	(	const SinglePassRange1 &	range1,
		const SinglePassRange2 &	range2
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::swap_ranges_impl().

Referenced by boost::range_detail::swap_ranges_impl().

template<class SinglePassRange1 , class OutputIterator , class UnaryOperation >

OutputIterator boost::range::transform	(	const SinglePassRange1 &	rng,
		OutputIterator	out,
		UnaryOperation	fun
	)

inline

template function transform

range-based version of the transform std algorithm

Precondition: SinglePassRange1 is a model of the SinglePassRangeConcept; SinglePassRange2 is a model of the SinglePassRangeConcept; OutputIterator is a model of the OutputIteratorConcept; UnaryOperation is a model of the UnaryFunctionConcept; BinaryOperation is a model of the BinaryFunctionConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and transform().

template<class SinglePassRange1 , class SinglePassRange2 , class OutputIterator , class BinaryOperation >

OutputIterator boost::range::transform	(	const SinglePassRange1 &	rng1,
		const SinglePassRange2 &	rng2,
		OutputIterator	out,
		BinaryOperation	fun
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and boost::range_detail::transform_impl().

Referenced by transform().

template<range_return_value re, class ForwardRange >

BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type boost::range::unique ( ForwardRange & rng )

inline

template function unique

range-based version of the unique std algorithm

Precondition: Rng meets the requirements for a Forward range

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and unique().

template<range_return_value re, class ForwardRange >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type boost::range::unique ( const ForwardRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and unique().

template<range_return_value re, class ForwardRange , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type boost::range::unique	(	ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and unique().

template<range_return_value re, class ForwardRange , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type boost::range::unique	(	const ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and unique().

template<class ForwardRange >

BOOST_DEDUCED_TYPENAME range_return<ForwardRange, return_begin_found>::type boost::range::unique ( ForwardRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References BOOST_RANGE_CONCEPT_ASSERT.

template<class ForwardRange >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange, return_begin_found>::type boost::range::unique ( const ForwardRange & rng )

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References BOOST_RANGE_CONCEPT_ASSERT.

template<class ForwardRange , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<ForwardRange, return_begin_found>::type boost::range::unique	(	ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References BOOST_RANGE_CONCEPT_ASSERT.

template<class ForwardRange , class BinaryPredicate >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange, return_begin_found>::type boost::range::unique	(	const ForwardRange &	rng,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References BOOST_RANGE_CONCEPT_ASSERT.

Referenced by boost::geometry::detail::unique::range_unique::apply(), and unique().

template<class SinglePassRange , class OutputIterator >

OutputIterator boost::range::unique_copy	(	const SinglePassRange &	rng,
		OutputIterator	out_it
	)

inline

template function unique_copy

range-based version of the unique_copy std algorithm

Precondition: SinglePassRange is a model of the SinglePassRangeConcept; OutputIterator is a model of the OutputIteratorConcept; BinaryPredicate is a model of the BinaryPredicateConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and unique_copy().

Referenced by boost::phoenix::impl::unique_copy::operator()(), and boost::lambda::ll::unique_copy::operator()().

template<class SinglePassRange , class OutputIterator , class BinaryPredicate >

OutputIterator boost::range::unique_copy	(	const SinglePassRange &	rng,
		OutputIterator	out_it,
		BinaryPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by unique_copy().

template<class ForwardRange , class Value >

BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange>, BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type>::type boost::range::upper_bound	(	ForwardRange &	rng,
		Value	val
	)

inline

template function upper_bound

range-based version of the upper_bound std algorithm

Precondition: ForwardRange is a model of the ForwardRangeConcept

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and upper_bound().

template<class ForwardRange , class Value >

BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type boost::range::upper_bound	(	const ForwardRange &	rng,
		Value	val
	)

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and upper_bound().

template<class ForwardRange , class Value , class SortPredicate >

BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange>, BOOST_DEDUCED_TYPENAME range_iterator<ForwardRange>::type>::type boost::range::upper_bound	(	ForwardRange &	rng,
		Value	val,
		SortPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and upper_bound().

template<class ForwardRange , class Value , class SortPredicate >

BOOST_DEDUCED_TYPENAME range_iterator<const ForwardRange>::type boost::range::upper_bound	(	const ForwardRange &	rng,
		Value	val,
		SortPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and upper_bound().

template<range_return_value re, class ForwardRange , class Value >

BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange>, BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type>::type boost::range::upper_bound	(	ForwardRange &	rng,
		Value	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and upper_bound().

template<range_return_value re, class ForwardRange , class Value >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type boost::range::upper_bound	(	const ForwardRange &	rng,
		Value	val
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and upper_bound().

template<range_return_value re, class ForwardRange , class Value , class SortPredicate >

BOOST_DEDUCED_TYPENAME disable_if< is_const<ForwardRange>, BOOST_DEDUCED_TYPENAME range_return<ForwardRange,re>::type>::type boost::range::upper_bound	(	ForwardRange &	rng,
		Value	val,
		SortPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, boost::end, and upper_bound().

template<range_return_value re, class ForwardRange , class Value , class SortPredicate >

BOOST_DEDUCED_TYPENAME range_return<const ForwardRange,re>::type boost::range::upper_bound	(	const ForwardRange &	rng,
		Value	val,
		SortPredicate	pred
	)

inline

This is an overloaded member function, provided for convenience. It differs from the above function only in what argument(s) it accepts.

References boost::asio::begin, BOOST_RANGE_CONCEPT_ASSERT, and boost::end.

Referenced by upper_bound().

Classes

Functions

Function Documentation