You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
I'm writing more multiplication tests for the various data integer algorithms, and it became apparent that at least some of the arithmetic inside the Karatsuba algorithm should be allowed to overflow. In particular, the unchecked() debug assertion was triggered by [~0] x [~0], which usually does not take the Karatsuba path given the 16-element threshold. Tangentially, I kind of thought there would be a lower limit to the algorithm, but it just works if you take away the debug overflow assertions.
The text was updated successfully, but these errors were encountered:
I'm writing more multiplication tests for the various data integer algorithms, and it became apparent that at least some of the arithmetic inside the Karatsuba algorithm should be allowed to overflow. In particular, the unchecked() debug assertion was triggered by [~0] x [~0], which usually does not take the Karatsuba path given the 16-element threshold. Tangentially, I kind of thought there would be a lower limit to the algorithm, but it just works if you take away the debug overflow assertions.
I'm writing more multiplication tests for the various data integer algorithms, and it became apparent that at least some of the arithmetic inside the Karatsuba algorithm should be allowed to overflow. In particular, the unchecked() debug assertion was triggered by [~0] x [~0], which usually does not take the Karatsuba path given the 16-element threshold. Tangentially, I kind of thought there would be a lower limit to the algorithm, but it just works if you take away the debug overflow assertions.
The text was updated successfully, but these errors were encountered: