#include "CoreTypes.h"
#include "Algo/BinarySearch.h"
#include "Algo/Sort.h"
#include "HAL/PlatformMath.h"
#include "Templates/Less.h"

Include dependency graph for Sorting.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	TDereferenceWrapper< T, PREDICATE_CLASS >

struct	TDereferenceWrapper< T *, PREDICATE_CLASS >

struct	TArrayRange< T >

struct	TIsContiguousContainer< TArrayRange< T > >

class	FEuclidDivisionGCD

class	TJugglingRotation< TGCDPolicy >

class	TRotationInPlaceMerge< TRotationPolicy >

class	TMergeSort< TMergePolicy, MinMergeSubgroupSize >

struct	TRadixSortKeyCastUint32< T >

struct	FRadixSortKeyFloat

Functions
template<class T , class PREDICATE_CLASS >
void	Sort (T *First, const int32 Num, const PREDICATE_CLASS &Predicate)

template<class T , class PREDICATE_CLASS >
void	Sort (T **First, const int32 Num, const PREDICATE_CLASS &Predicate)

template<class T >
void	Sort (T *First, const int32 Num)

template<class T >
void	Sort (T **First, const int32 Num)

template<class T , class PREDICATE_CLASS >
void	Merge (T Out, T In, const int32 Mid, const int32 Num, const PREDICATE_CLASS &Predicate)

template<class T , class PREDICATE_CLASS >
void	StableSortInternal (T *First, const int32 Num, const PREDICATE_CLASS &Predicate)

template<class T , class PREDICATE_CLASS >
void	StableSort (T *First, const int32 Num, const PREDICATE_CLASS &Predicate)

template<class T , class PREDICATE_CLASS >
void	StableSort (T **First, const int32 Num, const PREDICATE_CLASS &Predicate)

template<class T >
void	StableSort (T *First, const int32 Num)

template<class T >
void	StableSort (T **First, const int32 Num)

template<typename ValueType , typename CountType , class SortKeyClass >
void	RadixSort32 (ValueType RESTRICT Dst, ValueType RESTRICT Src, CountType Num, SortKeyClass SortKey)

template<typename ValueType , typename CountType >
void	RadixSort32 (ValueType RESTRICT Dst, ValueType RESTRICT Src, CountType Num)

template<typename CountType >
void	RadixSort32 (float RESTRICT Dst, float RESTRICT Src, CountType Num)

Function Documentation

◆ Merge()

template<class T , class PREDICATE_CLASS >

void Merge	(	T *	Out,
		T *	In,
		const int32	Mid,
		const int32	Num,
		const PREDICATE_CLASS &	Predicate )

Stable merge to perform sort below. Stable sort is slower than non-stable algorithm.

Parameters

Out	Pointer to the first element of output array.
In	Pointer to the first element to sort.
Mid	Middle point of the table, i.e. merge separator.
Num	Number of elements in the whole table.
Predicate	Predicate class.

Definition at line 135 of file Sorting.h.

◆ RadixSort32() [1/3]

template<typename CountType >

void RadixSort32	(	float *RESTRICT	Dst,
		float *RESTRICT	Src,
		CountType	Num )

Definition at line 533 of file Sorting.h.

◆ RadixSort32() [2/3]

template<typename ValueType , typename CountType >

void RadixSort32	(	ValueType *RESTRICT	Dst,
		ValueType *RESTRICT	Src,
		CountType	Num )

Definition at line 513 of file Sorting.h.

◆ RadixSort32() [3/3]

template<typename ValueType , typename CountType , class SortKeyClass >

void RadixSort32	(	ValueType *RESTRICT	Dst,
		ValueType *RESTRICT	Src,
		CountType	Num,
		SortKeyClass	SortKey )

Very fast 32bit radix sort. SortKeyClass defines operator() that takes ValueType and returns a uint32. Sorting based on key. No comparisons. Is stable. Use a smaller CountType for smaller histograms.

Definition at line 427 of file Sorting.h.

◆ Sort() [1/4]

template<class T >

void Sort	(	T **	First,
		const int32	Num )

Specialized version of the above Sort function for pointers to elements.

Parameters

First	pointer to the first element to sort
Num	the number of items to sort

Definition at line 118 of file Sorting.h.

◆ Sort() [2/4]

template<class T , class PREDICATE_CLASS >

void Sort	(	T **	First,
		const int32	Num,
		const PREDICATE_CLASS &	Predicate )

Specialized version of the above Sort function for pointers to elements.

Parameters

First	pointer to the first element to sort
Num	the number of items to sort
Predicate	predicate class

Definition at line 91 of file Sorting.h.

◆ Sort() [3/4]

template<class T >

void Sort	(	T *	First,
		const int32	Num )

Sort elements. The sort is unstable, meaning that the ordering of equal items is not necessarily preserved. Assumes < operator is defined for the template type.

Parameters

First	pointer to the first element to sort
Num	the number of items to sort

Definition at line 105 of file Sorting.h.

◆ Sort() [4/4]

template<class T , class PREDICATE_CLASS >

void Sort	(	T *	First,
		const int32	Num,
		const PREDICATE_CLASS &	Predicate )

Sort elements using user defined predicate class. The sort is unstable, meaning that the ordering of equal items is not necessarily preserved.

Parameters

First	pointer to the first element to sort
Num	the number of items to sort
Predicate	predicate class

Definition at line 77 of file Sorting.h.

◆ StableSort() [1/4]

template<class T >

void StableSort	(	T **	First,
		const int32	Num )

Specialized version of the above StableSort function for pointers to elements. Stable sort is slower than non-stable algorithm.

Parameters

First	pointer to the first element to sort
Num	the number of items to sort

Definition at line 414 of file Sorting.h.

◆ StableSort() [2/4]

template<class T , class PREDICATE_CLASS >

void StableSort	(	T **	First,
		const int32	Num,
		const PREDICATE_CLASS &	Predicate )

Specialized version of the above StableSort function for pointers to elements. Stable sort is slower than non-stable algorithm.

Parameters

First	pointer to the first element to sort
Num	the number of items to sort
Predicate	predicate class

Definition at line 386 of file Sorting.h.

◆ StableSort() [3/4]

template<class T >

void StableSort	(	T *	First,
		const int32	Num )

Stable sort elements. The sort is stable, meaning that the ordering of equal items is preserved, but it's slower than non-stable algorithm.

Assumes < operator is defined for the template type.

Parameters

First	pointer to the first element to sort
Num	the number of items to sort

Definition at line 401 of file Sorting.h.

◆ StableSort() [4/4]

template<class T , class PREDICATE_CLASS >

void StableSort	(	T *	First,
		const int32	Num,
		const PREDICATE_CLASS &	Predicate )

Stable sort elements using user defined predicate class. The sort is stable, meaning that the ordering of equal items is preserved, but it's slower than non-stable algorithm.

Parameters

First	pointer to the first element to sort
Num	the number of items to sort
Predicate	predicate class

Definition at line 372 of file Sorting.h.

◆ StableSortInternal()

template<class T , class PREDICATE_CLASS >

void StableSortInternal	(	T *	First,
		const int32	Num,
		const PREDICATE_CLASS &	Predicate )

Stable sort elements using user defined predicate class. The sort is stable, meaning that the ordering of equal items is preserved, but it's slower than non-stable algorithm.

This is the internal sorting function used by StableSort overrides.

Parameters

First	pointer to the first element to sort
Num	the number of items to sort
Predicate	predicate class

Definition at line 357 of file Sorting.h.

Classes

Functions

Function Documentation

◆ Merge()

◆ RadixSort32() [1/3]

◆ RadixSort32() [2/3]

◆ RadixSort32() [3/3]

◆ Sort() [1/4]

◆ Sort() [2/4]

◆ Sort() [3/4]

◆ Sort() [4/4]

◆ StableSort() [1/4]

◆ StableSort() [2/4]

◆ StableSort() [3/4]

◆ StableSort() [4/4]

◆ StableSortInternal()