The core trait of zan-sort.
It maps any arbitrary data type into a strictly ordered, 1-dimensional u64 space.
In this algorithm, the u64 representation is the absolute truth for ordering.
Micro-optimized in-place insertion sort for extremely small arrays (N <= 16).
By utilizing raw ptr::read and ptr::write instead of slice::swap,
it coercers LLVM to perform register-level element shifting rather than memory-to-memory copies.
High-performance, $O(N)$ generic hybrid sort.
It dynamically scales from standard pdqsort (for mid-sized arrays) up to
Ordex-inspired lock-free parallel arithmetic routing for massive arrays.