98 int start = job_start;
100 bool have_work = (start < end);
102 const int count = job_end - job_start;
107 sort(data + job_start, data + job_end + 1, compare);
115 const int center = (left + right) >> 1;
116 if (compare.
compare(data[left], data[center]) > 0) {
117 swap(data[left], data[center]);
119 if (compare.
compare(data[left], data[right]) > 0) {
120 swap(data[left], data[right]);
122 if (compare.
compare(data[center], data[right]) > 0) {
123 swap(data[center], data[right]);
125 swap(data[center], data[right - 1]);
128 while (compare.
compare(data[left], median) < 0) {
131 while (compare.
compare(data[right], median) > 0) {
135 swap(data[left], data[right]);
139 }
while (left <= right);
151 task_pool->
push([task_pool, data, left, end, compare] {
void bvh_reference_sort(const int start, const int end, BVHReference *data, const int dim, const BVHUnaligned *unaligned_heuristic, const Transform *aligned_space)
static void bvh_reference_sort_threaded(TaskPool *task_pool, BVHReference *data, const int job_start, const int job_end, const BVHReferenceCompare &compare)