sort [Sorting Algorithms]

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

---

Detailed Description

See also:

• STL documentation for sort
• STL documentation for stable_sort
• STL documentation for partial_sort_copy

---

Function Documentation

void adobe::partial_sort_copy	(	InputRange &	range,
		RandomAccessRange &	result_range
	)

sort implementation

Definition at line 134 of file sort.hpp.

void adobe::partial_sort_copy	(	const InputRange &	range,
		RandomAccessRange &	result_range
	)

sort implementation

Definition at line 146 of file sort.hpp.

void adobe::partial_sort_copy	(	InputIterator	first,
		InputIterator	last,
		RandomAccessIterator	result_first,
		RandomAccessIterator	result_last,
		Compare	comp
	)

sort implementation

Definition at line 158 of file sort.hpp.

void adobe::partial_sort_copy	(	InputRange &	range,
		RandomAccessRange &	result_range,
		Compare	comp
	)

sort implementation

Definition at line 171 of file sort.hpp.

void adobe::partial_sort_copy	(	const InputRange &	range,
		RandomAccessRange &	result_range,
		Compare	comp
	)

sort implementation

Definition at line 184 of file sort.hpp.

void adobe::sort	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)

sort implementation

Definition at line 52 of file sort.hpp.

void adobe::sort	(	R &	r,
		C	c,
		P	p
	)

sort implementation

Definition at line 78 of file sort.hpp.

void adobe::sort	(	I	f,
		I	l,
		C	c,
		P	p
	)

sort implementation

Definition at line 65 of file sort.hpp.

void adobe::sort

(

RandomAccessRange &

range )

sort implementation

Definition at line 41 of file sort.hpp.

void adobe::sort	(	RandomAccessRange &	range,
		Compare	comp
	)

sort implementation

Definition at line 90 of file sort.hpp.

void adobe::stable_sort

(

RandomAccessRange &

range )

sort implementation

Definition at line 101 of file sort.hpp.

void adobe::stable_sort	(	RandomAccessRange &	range,
		Compare	comp
	)

sort implementation

Definition at line 123 of file sort.hpp.

void adobe::stable_sort	(	RandomAccessIterator	first,
		RandomAccessIterator	last,
		Compare	comp
	)

sort implementation

Definition at line 112 of file sort.hpp.