mirrors/cosmopolitan
1
0
Fork 0
mirror of https://github.com/jart/cosmopolitan.git synced 2025-10-26 03:00:57 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions 1
cosmopolitan/third_party/vqsort
History
Justine Tunney d7c79f43ef
Clean up more code 
- Found some bugs in LLVM compiler-rt library
- The useless LIBC_STUBS package is now deleted
- Improve the overflow checking story even further
- Get chibicc tests working in MODE=dbg mode again
- The libc/isystem/ headers now have correctly named guards
2023-06-18 01:00:05 -07:00
..
README.cosmo Add more sorting algorithms 2023-04-27 05:44:44 -07:00
vqsort.h Add more sorting algorithms 2023-04-27 05:44:44 -07:00
vqsort.mk Clean up more code 2023-06-18 01:00:05 -07:00
vqsort_i32a.S Make progress towards aarch64 build 2023-05-10 04:20:46 -07:00
vqsort_i64a.S Make progress towards aarch64 build 2023-05-10 04:20:46 -07:00
vqsort_int32.c Add more sorting algorithms 2023-04-27 05:44:44 -07:00
vqsort_int64.c Add more sorting algorithms 2023-04-27 05:44:44 -07:00

README.cosmo 

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.