This directory holds the sorting kernels behind sz_sequence_argsort, sz_sequence_argsort_uncased, and sz_pgrams_sort. Each operation has a serial baseline plus haswell and skylake SIMD backends on x86. The dispatcher picks the fastest one available on the running CPU.

Numbers are sorting throughput in comparisons/s, rendered as Mcmp/s, measured with bench/sequence.cpp over the leipzig1M_en.txt corpus, reporting the median of repeated runs. Sorting throughput is reported as comparisons/s, with the operation count modeled as N·log2 N, matching StringWars. Each row is the library compiled with that single backend forced on one fixed chip, and each column is one operation, so coverage and cross-chip comparison read down a single column. The Standard row is the platform's best stock equivalent per column — std::sort for Argsort and Pgram Sort, std::stable_sort for Uncased Argsort. Token length matters for comparison cost, so results are split into a Short Words table (tokens averaging 5 bytes) and a Long Lines table (tokens averaging 130 bytes). A ↑ cell means there is no dedicated kernel at that ISA level, so the dispatcher reuses the kernel from the tier above it; an empty cell is genuinely-missing data.

Measured June 26th, 2026.

Measured June 26th, 2026.