Hacker News
- Faster remainders when divisor is a constant: beating compilers and libdivide https://lemire.me/blog/2019/02/08/faster-remainders-when-the-divisor-is-a-constant-beating-compilers-and-libdivide/ 16 comments
- Faster remainders when the divisor is a constant: beating compilers & libdivide https://lemire.me/blog/2019/02/08/faster-remainders-when-the-divisor-is-a-constant-beating-compilers-and-libdivide/ 32 comments
- What's Forth benchmark? https://lemire.me/blog/2019/02/08/faster-remainders-when-the-divisor-is-a-constant-beating-compilers-and-libdivide/ 2 comments forth
- Faster remainders when the divisor is a constant: beating compilers and libdivide https://lemire.me/blog/2019/02/08/faster-remainders-when-the-divisor-is-a-constant-beating-compilers-and-libdivide/ 9 comments cpp
- Faster remainders when the divisor is a constant: beating compilers and libdivide https://lemire.me/blog/2019/02/08/faster-remainders-when-the-divisor-is-a-constant-beating-compilers-and-libdivide/ 111 comments programming
Linking pages
Would you like to stay up to date with C & C++? Checkout C & C++
Weekly.
Related searches:
Search whole site: site:lemire.me
Search title: Faster remainders when the divisor is a constant: beating compilers and libdivide – Daniel Lemire's blog
See how to search.