wireguard-openbsd/regress/lib/libc/qsort, branch jd/queueboosts WireGuard implementation for the OpenBSD kernel https://git.zx2c4.com/wireguard-openbsd/atom/regress/lib/libc/qsort?h=jd%2Fqueueboosts 2019-01-25T00:19:25Z I am retiring my old email address; replace it with my OpenBSD one. 2019-01-25T00:19:25Z millert millert@openbsd.org 2019-01-25T00:19:25Z urn:sha1:bf198cc6eba0ca1f6d79f71e8e2243d386241fa8 Also test arrays of double and long long. 2017-05-27T18:54:09Z millert millert@openbsd.org 2017-05-27T18:54:09Z urn:sha1:b37fe3a54f5b04e8c6ded4b66d124257dcf8b314 Add timing and test name options. 2017-05-22T17:52:16Z millert millert@openbsd.org 2017-05-22T17:52:16Z urn:sha1:98a888fc199fd8711b7db3dfdaf9bdd63066483c Instead of embedding pre-generated tables from McIlroy's "A Killer 2017-05-22T17:16:43Z millert millert@openbsd.org 2017-05-22T17:16:43Z urn:sha1:573abc6a1cada014dfea14efef8f6e9cd35a20ed Adversary for Quicksort", just include the code to generate them. Also allow the number of elements to be specified on the command line. correct a return value test 2017-05-21T11:54:41Z jsg jsg@openbsd.org 2017-05-21T11:54:41Z urn:sha1:0fd542c2f5f84c88d604d5f37cf604a4a160857a ok millert@ Add input targeted at the Bentley and McIrlroy quicksort generated 2017-05-19T04:08:00Z millert millert@openbsd.org 2017-05-19T04:08:00Z urn:sha1:f4308f3b5dfa847fb2cea0acf54887da588524b7 by McIlroy's "A Killer Adversary for Quicksort". This results in quadratic behavior and the test aborts before completion. use mergesort instead of heapsort when comparing results 2017-05-18T14:50:08Z millert millert@openbsd.org 2017-05-18T14:50:08Z urn:sha1:f996ae442d9f50886016262faef63e597bda2171 Avoid running the "killer" tests multiple times with the same 2017-05-17T21:40:13Z millert millert@openbsd.org 2017-05-17T21:40:13Z urn:sha1:94bbf78b08cd9ec170ba9f872dc70af8f9dfbf7e parameters. Add "median of three" killer, as seen in "Introspective Sorting and 2017-05-17T21:24:48Z millert millert@openbsd.org 2017-05-17T21:24:48Z urn:sha1:0f51eee8a648b09ae540f3b2c482800d3bdd4f2d Selection Algorithms" by David R Musser. Approximate nlgn instead of using libm. The same approximation may 2017-05-17T20:28:35Z millert millert@openbsd.org 2017-05-17T20:28:35Z urn:sha1:885ba15a9478d45a50efb5e5e21f21c254afe42b be used in qsort.c in a later commit.