Available sorting algorithm backends.
| Enumerator |
|---|
| STANDARD | std::ranges::sort
|
| STABLE | std::ranges::stable_sort — preserves equal-element order
|
| PARTIAL | std::partial_sort — sorts first half by default
|
| NTH_ELEMENT | std::nth_element — partitions at midpoint
|
| HEAP | Heap sort via make_heap / sort_heap.
|
| PARALLEL | MayaFlux::Parallel::sort with par_unseq.
|
| RADIX | Not yet implemented, falls back to STANDARD.
|
| COUNTING | Not yet implemented, falls back to STANDARD.
|
| BUCKET | Not yet implemented, falls back to STANDARD.
|
| MERGE_EXTERNAL | Not yet implemented, falls back to STANDARD.
|
| QUICK_OPTIMIZED | Not yet implemented, falls back to STANDARD.
|
| LAZY_STREAMING | Reserved for Vruta/Kriya coroutine integration.
|
| PREDICTIVE_ML | Reserved for ML-guided sort.
|
| EIGEN_OPTIMIZED | Reserved for Eigen-specific use.
|
| GPU_ACCELERATED | Reserved for Vulkan compute integration.
|
41 : uint8_t {
47 PARALLEL,
57};
@ QUICK_OPTIMIZED
Not yet implemented, falls back to STANDARD.
@ STABLE
std::ranges::stable_sort — preserves equal-element order
@ GPU_ACCELERATED
Reserved for Vulkan compute integration.
@ EIGEN_OPTIMIZED
Reserved for Eigen-specific use.
@ RADIX
Not yet implemented, falls back to STANDARD.
@ STANDARD
std::ranges::sort
@ COUNTING
Not yet implemented, falls back to STANDARD.
@ LAZY_STREAMING
Reserved for Vruta/Kriya coroutine integration.
@ HEAP
Heap sort via make_heap / sort_heap.
@ MERGE_EXTERNAL
Not yet implemented, falls back to STANDARD.
@ NTH_ELEMENT
std::nth_element — partitions at midpoint
@ PREDICTIVE_ML
Reserved for ML-guided sort.
@ BUCKET
Not yet implemented, falls back to STANDARD.
@ PARTIAL
std::partial_sort — sorts first half by default