News for hackers. Stuff that matters.

A comment on Faster remainders when the divisor is a constant: beating compilers & libdivide. Parent comment

Re:Faster remainders when the divisor is a constant: beating... by acqq on Sunday February 10, 2019 @05:50PM (#19130617)
Nice! If I'm not wrong, under many conditions this derivation gives even faster divisibility test then the one presented in the article we comment.
[ Parent | on HN ]

There are no comments on this comment yet.