kevinrr888 opened a new issue, #6095: URL: https://github.com/apache/accumulo/issues/6095
The following optimization can be made to mod operations. This can be applied where applicable with a comment explaining the original operation for clarity `n % x === n & (x-1)` when x is a power of 2 but bitwise and is much faster _Originally posted by @kevinrr888 in https://github.com/apache/accumulo/pull/6025#discussion_r2742486786_ -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: [email protected] For queries about this service, please contact Infrastructure at: [email protected]
