You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
and several projection-enhanced helper algorithms come from Eric Niebler's [Range
180
-
v3](https://github.com/ericniebler/range-v3) library. Several ideas such as proxy
181
-
iterators, customization points and projections, as well as a few other utility
182
-
functions also come from that library or from the related articles and standard
183
-
C++ proposals.
179
+
*[`utility::as_function`][utility-as-function], and several projection-enhanced helper
180
+
algorithms come from Eric Niebler's [Range v3](https://github.com/ericniebler/range-v3)
181
+
library. Several ideas such as proxy iterators, customization points and projections,
182
+
as well as a few other utility functions also come from that library or from the related
183
+
articles and standard C++ proposals.
184
184
185
185
* The algorithm used by `ska_sorter` comes from Malte Skarupke's [implementation](https://github.com/skarupke/ska_sort)
186
186
of his own [ska_sort](https://probablydance.com/2016/12/27/i-wrote-a-faster-sorting-algorithm/) algorithm.
@@ -229,6 +229,11 @@ discussion](https://stackoverflow.com/q/2786899/1364752) on StackOverflow and ar
229
229
backed by the article [*Applying Sorting Networks to Synthesize Optimized Sorting
230
230
Libraries*](https://arxiv.org/abs/1505.01962).
231
231
232
+
* The algorithm behind `utility::quicksort_adversary` is a fairly straightforward adaptation of the
233
+
one provided by M. D. McIlroy in [*A Killer Adversary for Quicksort*](https://www.cs.dartmouth.edu/~doug/mdmspe.pdf).
234
+
235
+
* The algorithm used by [`utility::check_strict_weak_ordering`][utility-check-strict-weak-ordering] is a reimplementation of the one desribed in the README file of Danila Kutenin's [quadratic_strict_weak_ordering project](https://github.com/danlark1/quadratic_strict_weak_ordering).
236
+
232
237
* The test suite reimplements random number algorithms originally found in the following places:
233
238
-[xoshiro256\*\*](https://prng.di.unimi.it/)
234
239
-[*Optimal Discrete Uniform Generation from Coin Flips, and Applications*](https://arxiv.org/abs/1304.1916)
@@ -245,9 +250,19 @@ developed by Thøger Rivera-Thorsen.
0 commit comments