mirror of
https://github.com/jart/cosmopolitan.git
synced 2025-01-31 03:27:39 +00:00
e16a7d8f3b
`et` means `expandtab`. ```sh rg 'vi: .* :vi' -l -0 | \ xargs -0 sed -i '' 's/vi: \(.*\) et\(.*\) :vi/vi: \1 xoet\2:vi/' rg 'vi: .* :vi' -l -0 | \ xargs -0 sed -i '' 's/vi: \(.*\)noet\(.*\):vi/vi: \1et\2 :vi/' rg 'vi: .* :vi' -l -0 | \ xargs -0 sed -i '' 's/vi: \(.*\)xoet\(.*\):vi/vi: \1noet\2:vi/' ``` |
||
|---|---|---|
| .. | ||
| BUILD.mk | ||
| README.cosmo | ||
| vqsort.h | ||
| vqsort_i32a.S | ||
| vqsort_i64a.S | ||
| vqsort_int32.c | ||
| vqsort_int64.c | ||
DESCRIPTION vqsort implements vectorized quicksort using avx2. this is the fastest way to sort integers. this goes as fast as djbsort for 32-bit integers except it supports 64-bit integers too, which go just as fast: about a gigabyte of memory sorted per second. It's 3x faster than simple radix sort. It's 5x faster than simple quicksort. It's 10x faster than qsort LICENSE Apache 2.o ORIGIN https://github.com/google/highway/ commit 50331e0523bbf5f6c94b94263a91680f118e0986 Author: Jan Wassenberg <janwas@google.com> Date: Wed Apr 26 11:20:33 2023 -0700 Faster vqsort for small arrays (7x speedup! for N=100) LOCAL CHANGES Precompiled beacuse upstream codebase is slow, gigantic, and hairy.