[libcxx-commits] [PATCH] D146421: [release/16.x][libc++] Revert the bitset sort optimization

[Danila Kutenin via Phabricator via libcxx-commits]

danlark added a comment.

Also to catch all strict weak ordering bugs, there are O(n^2) algorithms, for example, here <https://github.com/danlark1/quadratic_strict_weak_ordering>. We can introduce a debug check with a square root of elements sampling. Would you be up to do this? Given how long range randomization took, I decided not to go into that direction as it seemed even harder to introduce safely. I can prioritize this work if there will be enough support from the maintainers


Repository:
  rG LLVM Github Monorepo

CHANGES SINCE LAST ACTION
  https://reviews.llvm.org/D146421/new/

https://reviews.llvm.org/D146421