Logo
Explore Help
Sign In
shylie/llvm-project
1
0
Fork 0
You've already forked llvm-project
Code Issues Pull Requests Actions 6 Packages Projects Releases Wiki Activity
llvm-project/libcxx/test/std/numerics/numeric.ops/numeric.ops.gcd
History
serge-sans-paille 27a062e9ca
[libc++] Implement std::gcd using the binary version (#77747)
The binary version is four times faster than current implementation in
my setup, and generally considered a better implementation.

Code inspired by https://en.algorithmica.org/hpc/algorithms/gcd/ which
itself is inspired by
https://lemire.me/blog/2013/12/26/fastest-way-to-compute-the-greatest-common-divisor/

Fix #77648
2024-05-08 14:21:31 +00:00
..
gcd.bool1.compile.fail.cpp
…
gcd.bool2.compile.fail.cpp
…
gcd.bool3.compile.fail.cpp
…
gcd.bool4.compile.fail.cpp
…
gcd.not_integral1.compile.fail.cpp
…
gcd.not_integral2.compile.fail.cpp
…
gcd.pass.cpp
[libc++] Implement std::gcd using the binary version (#77747)
2024-05-08 14:21:31 +00:00
Powered by Gitea Version: 1.23.1 Page: 2295ms Template: 2ms
English
Bahasa Indonesia Deutsch English Español Français Gaeilge Italiano Latviešu Magyar nyelv Nederlands Polski Português de Portugal Português do Brasil Suomi Svenska Türkçe Čeština Ελληνικά Български Русский Українська فارسی മലയാളം 日本語 简体中文 繁體中文(台灣) 繁體中文(香港) 한국어
Licenses API