Tool object to sort abstract primitive set. More...
#include <BVH_Sorter.hxx>

| Public Member Functions | |
| BVH_Sorter () | |
| Performs default initialization. | |
| virtual | ~BVH_Sorter () | 
| 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 Standard_Integer theStart, const Standard_Integer theFinal)=0 | 
| Sorts the given (inclusive) range in the set. | |
| Standard_Boolean | IsParallel () const | 
| Returns parallel flag. | |
| void | SetParallel (const Standard_Boolean isParallel) | 
| Set parallel flag controlling possibility of parallel execution. | |
Tool object to sort abstract primitive set.
| 
 | inline | 
Performs default initialization.
| 
 | inlinevirtual | 
Releases resources of BVH sorter.
| 
 | inline | 
Returns parallel flag.
| 
 | pure virtual | 
Sorts the set.
Implemented in BVH_QuickSorter< T, N >, and BVH_RadixSorter< T, N >.
| 
 | pure virtual | 
Sorts the given (inclusive) range in the set.
Implemented in BVH_QuickSorter< T, N >, and BVH_RadixSorter< T, N >.
| 
 | inline | 
Set parallel flag controlling possibility of parallel execution.