The fastest “branch less” binary search implementation for cheap comparisons cases (with workaround for LLVM optimizer flaw).
-
Updated
Feb 15, 2025 - C++
The fastest “branch less” binary search implementation for cheap comparisons cases (with workaround for LLVM optimizer flaw).
Add a description, image, and links to the branchless-code topic page so that developers can more easily learn about it.
To associate your repository with the branchless-code topic, visit your repo's landing page and select "manage topics."