| 85 | numTasks(min((N+BLOCK_SIZE-1)/BLOCK_SIZE,min(TaskScheduler::threadCount(),MAX_TASKS))) {} |
| 86 | |
| 87 | __forceinline const range<ssize_t>* findStartRange(size_t& index, const range<ssize_t>* const r, const size_t numRanges) |
| 88 | { |
| 89 | size_t i = 0; |
| 90 | while(index >= (size_t)r[i].size()) |
| 91 | { |
| 92 | assert(i < numRanges); |
| 93 | index -= (size_t)r[i].size(); |
| 94 | i++; |
| 95 | } |
| 96 | return &r[i]; |
| 97 | } |
| 98 | |
| 99 | __forceinline void swapItemsInMisplacedRanges(const size_t numLeftMisplacedRanges, |
| 100 | const size_t numRightMisplacedRanges, |
no test coverage detected