vtkm::cont::openmp::sort Namespace Reference

Namespaces
	quick
	radix

Functions
template<typename T , typename Container , class BinaryCompare >
void	parallel_sort (vtkm::cont::ArrayHandle< T, Container > &, BinaryCompare)
template<typename T , typename StorageT , typename U , typename StorageU , class BinaryCompare >
void	parallel_sort_bykey (vtkm::cont::ArrayHandle< T, StorageT > &, vtkm::cont::ArrayHandle< U, StorageU > &, BinaryCompare)
template<typename HandleType , class BinaryCompare >
void	parallel_sort (HandleType &values, BinaryCompare binary_compare, vtkm::cont::internal::radix::PSortTag)
template<typename T , typename StorageT , class BinaryCompare >
void	parallel_sort (vtkm::cont::ArrayHandle< T, StorageT > &values, BinaryCompare binary_compare, vtkm::cont::internal::radix::RadixSortTag)
template<typename T , typename StorageT , typename U , typename StorageU , class BinaryCompare >
void	parallel_sort_bykey (vtkm::cont::ArrayHandle< T, StorageT > &keys, vtkm::cont::ArrayHandle< U, StorageU > &values, BinaryCompare binary_compare, vtkm::cont::internal::radix::PSortTag)
template<typename T , typename StorageT , typename StorageU , class BinaryCompare >
void	parallel_sort_bykey (vtkm::cont::ArrayHandle< T, StorageT > &keys, vtkm::cont::ArrayHandle< vtkm::Id, StorageU > &values, BinaryCompare binary_compare, vtkm::cont::internal::radix::RadixSortTag)
template<typename T , typename StorageT , typename U , typename StorageU , class BinaryCompare >
void	parallel_sort_bykey (vtkm::cont::ArrayHandle< T, StorageT > &keys, vtkm::cont::ArrayHandle< U, StorageU > &values, BinaryCompare binary_compare, vtkm::cont::internal::radix::RadixSortTag)

Function Documentation

parallel_sort() [1/3]

template<typename HandleType , class BinaryCompare >

void vtkm::cont::openmp::sort::parallel_sort	(	HandleType &	values,
		BinaryCompare	binary_compare,
		vtkm::cont::internal::radix::PSortTag
	)

parallel_sort() [2/3]

template<typename T , typename Container , class BinaryCompare >

void vtkm::cont::openmp::sort::parallel_sort	(	vtkm::cont::ArrayHandle< T, Container > &	values,
		BinaryCompare	binary_compare
	)

parallel_sort() [3/3]

template<typename T , typename StorageT , class BinaryCompare >

void vtkm::cont::openmp::sort::parallel_sort	(	vtkm::cont::ArrayHandle< T, StorageT > &	values,
		BinaryCompare	binary_compare,
		vtkm::cont::internal::radix::RadixSortTag
	)

parallel_sort_bykey() [1/4]

template<typename T , typename StorageT , typename U , typename StorageU , class BinaryCompare >

void vtkm::cont::openmp::sort::parallel_sort_bykey	(	vtkm::cont::ArrayHandle< T, StorageT > &	keys,
		vtkm::cont::ArrayHandle< U, StorageU > &	values,
		BinaryCompare	binary_compare
	)

parallel_sort_bykey() [2/4]

template<typename T , typename StorageT , typename U , typename StorageU , class BinaryCompare >

void vtkm::cont::openmp::sort::parallel_sort_bykey	(	vtkm::cont::ArrayHandle< T, StorageT > &	keys,
		vtkm::cont::ArrayHandle< U, StorageU > &	values,
		BinaryCompare	binary_compare,
		vtkm::cont::internal::radix::PSortTag
	)

More efficient sort: Move value indexes when sorting and reorder the value array at last

parallel_sort_bykey() [3/4]

template<typename T , typename StorageT , typename U , typename StorageU , class BinaryCompare >

void vtkm::cont::openmp::sort::parallel_sort_bykey	(	vtkm::cont::ArrayHandle< T, StorageT > &	keys,
		vtkm::cont::ArrayHandle< U, StorageU > &	values,
		BinaryCompare	binary_compare,
		vtkm::cont::internal::radix::RadixSortTag
	)

parallel_sort_bykey() [4/4]

template<typename T , typename StorageT , typename StorageU , class BinaryCompare >

void vtkm::cont::openmp::sort::parallel_sort_bykey	(	vtkm::cont::ArrayHandle< T, StorageT > &	keys,
		vtkm::cont::ArrayHandle< vtkm::Id, StorageU > &	values,
		BinaryCompare	binary_compare,
		vtkm::cont::internal::radix::RadixSortTag
	)