Performs centroid-based sorting of abstract set along the given axis (X - 0, Y - 1, Z - 2) using quick sort. More...
#include <BVH_QuickSorter.hxx>

Public Member Functions | |
| BVH_QuickSorter (const Standard_Integer theAxis=0) | |
| Creates new BVH quick sorter for the given axis. | |
| virtual void | Perform (BVH_Set< T, N > *theSet) override |
| Sorts the set. | |
| virtual void | Perform (BVH_Set< T, N > *theSet, const Standard_Integer theStart, const Standard_Integer theFinal) override |
| Sorts the given (inclusive) range in the set. | |
Public Member Functions inherited from BVH_Sorter< T, N > | |
| BVH_Sorter () | |
| Performs default initialization. | |
| virtual | ~BVH_Sorter () |
| Releases resources of BVH sorter. | |
| Standard_Boolean | IsParallel () const |
| Returns parallel flag. | |
| void | SetParallel (const Standard_Boolean isParallel) |
| Set parallel flag controlling possibility of parallel execution. | |
Protected Attributes | |
| Standard_Integer | myAxis |
| Axis used to arrange the primitives (X - 0, Y - 1, Z - 2). | |
Performs centroid-based sorting of abstract set along the given axis (X - 0, Y - 1, Z - 2) using quick sort.
|
inline |
Creates new BVH quick sorter for the given axis.
|
inlineoverridevirtual |
Sorts the set.
Implements BVH_Sorter< T, N >.
|
inlineoverridevirtual |
Sorts the given (inclusive) range in the set.
Implements BVH_Sorter< T, N >.
|
protected |
Axis used to arrange the primitives (X - 0, Y - 1, Z - 2).