![]() |
NDEVR
API Documentation
|
Base class for tree sorters that maintain pre-sorted index arrays for efficient spatial partitioning. More...
Public Member Functions | |
| void | getList (uint01 dimension, uint04 start, uint04 end, Buffer< uint04 > &values, uint04 index_offset) |
| Copies a range of the center-ordered index list into the output buffer. | |
Static Protected Member Functions | |
| static void | _sortList (const Buffer< bool > &list_sorter, Buffer< uint04 > &list, Buffer< uint04 > &temp, uint04 start, uint04 end) |
| Partitions a list into two halves based on a boolean mask. | |
Protected Attributes | |
| Buffer< uint04 > | center_ordered [t_dims] |
| Pre-sorted index arrays by center value for each dimension. | |
| Buffer< uint04 > | temp_array |
| Temporary index buffer for partitioning operations. | |
| Buffer< bool > | temp_memory |
| Temporary boolean buffer for partitioning operations. | |
Base class for tree sorters that maintain pre-sorted index arrays for efficient spatial partitioning.
Definition at line 61 of file TreeSorter.h.
|
inlinestaticprotected |
Partitions a list into two halves based on a boolean mask.
| [in] | list_sorter | Boolean mask where true values go left and false values go right. |
| [in] | list | The index list to partition in place. |
| [in] | temp | Temporary buffer for the right-side elements. |
| [in] | start | The start index. |
| [in] | end | The end index. |
Definition at line 82 of file TreeSorter.h.
Referenced by TreeBoundarySorter< t_dims, t_type >::getMedian().
|
inline |
Copies a range of the center-ordered index list into the output buffer.
| [in] | dimension | The dimension to get the sorted list for. |
| [in] | start | The start index. |
| [in] | end | The end index. |
| [in] | values | The output buffer. |
| [in] | index_offset | The offset in the output buffer to write to. |
Definition at line 70 of file TreeSorter.h.
References center_ordered.