sort.hpp File Reference

Go to the source code of this file.

Namespaces
namespace	adobe

Functions
template<class RandomAccessRange>
void	sort (RandomAccessRange &range)
	sort implementation
template<class RandomAccessIterator, class Compare>
void	sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
	sort implementation
template<typename I, typename C, typename P>
void	sort (I f, I l, C c, P p)
	sort implementation
template<typename R, typename C, typename P>
void	sort (R &r, C c, P p)
	sort implementation
template<class RandomAccessRange, class Compare>
void	sort (RandomAccessRange &range, Compare comp)
	sort implementation
template<class RandomAccessRange>
void	stable_sort (RandomAccessRange &range)
	sort implementation
template<class RandomAccessIterator, class Compare>
void	stable_sort (RandomAccessIterator first, RandomAccessIterator last, Compare comp)
	sort implementation
template<class RandomAccessRange, class Compare>
void	stable_sort (RandomAccessRange &range, Compare comp)
	sort implementation
template<class InputRange, class RandomAccessRange>
void	partial_sort_copy (InputRange &range, RandomAccessRange &result_range)
	sort implementation
template<class InputRange, class RandomAccessRange>
void	partial_sort_copy (const InputRange &range, RandomAccessRange &result_range)
	sort implementation
template<class InputIterator, class RandomAccessIterator, class Compare>
void	partial_sort_copy (InputIterator first, InputIterator last, RandomAccessIterator result_first, RandomAccessIterator result_last, Compare comp)
	sort implementation
template<class InputRange, class RandomAccessRange, class Compare>
void	partial_sort_copy (InputRange &range, RandomAccessRange &result_range, Compare comp)
	sort implementation
template<class InputRange, class RandomAccessRange, class Compare>
void	partial_sort_copy (const InputRange &range, RandomAccessRange &result_range, Compare comp)
	sort implementation