BVH_Sorter< T, N > Class Template Reference

Tool object to sort abstract primitive set. More...

#include <BVH_Sorter.hxx>

Inheritance diagram for BVH_Sorter< T, N >:

Public Member Functions
	BVH_Sorter ()
	Performs default initialization.
virtual	~BVH_Sorter ()=default
	Releases resources of BVH sorter.
virtual void	Perform (BVH_Set< T, N > *theSet)=0
	Sorts the set.
virtual void	Perform (BVH_Set< T, N > *theSet, const int theStart, const int theFinal)=0
	Sorts the given (inclusive) range in the set.
bool	IsParallel () const
	Returns parallel flag.
void	SetParallel (const bool isParallel)
	Set parallel flag controlling possibility of parallel execution.

Detailed Description

template<class T, int N>
class BVH_Sorter< T, N >

Tool object to sort abstract primitive set.

Constructor & Destructor Documentation

BVH_Sorter()

template<class T , int N>

BVH_Sorter< T, N >::BVH_Sorter ( )

inline

Performs default initialization.

~BVH_Sorter()

template<class T , int N>

virtual BVH_Sorter< T, N >::~BVH_Sorter ( )

virtualdefault

Releases resources of BVH sorter.

Member Function Documentation

IsParallel()

template<class T , int N>

bool BVH_Sorter< T, N >::IsParallel ( ) const

inline

Returns parallel flag.

Perform() [1/2]

template<class T , int N>

virtual void BVH_Sorter< T, N >::Perform ( BVH_Set< T, N > * theSet )

pure virtual

Sorts the set.

Implemented in BVH_QuickSorter< T, N >, and BVH_RadixSorter< T, N >.

Perform() [2/2]

template<class T , int N>

virtual void BVH_Sorter< T, N >::Perform ( BVH_Set< T, N > * theSet, const int theStart, const int theFinal )

pure virtual

Sorts the given (inclusive) range in the set.

Implemented in BVH_QuickSorter< T, N >, and BVH_RadixSorter< T, N >.

SetParallel()

template<class T , int N>

void BVH_Sorter< T, N >::SetParallel ( const bool isParallel )

inline

Set parallel flag controlling possibility of parallel execution.

---

The documentation for this class was generated from the following file:

• BVH_Sorter.hxx