Optimization for some mod ops

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_

No files, tests, or entry points are named. Search the Java code for modulo operations and identify cases where the divisor is a power of two, then verify that the suggested bitwise operation preserves behavior. Done means applicable cases use the optimization with a comment explaining the original operation and the relevant tests pass.

Written by the indexing model from the issue text.