Inline methods to encapsulate fast and specific modulus operations. The mod-4 case is trivial. For mod-N, since we are always doing the test (i + 1) % N, or (i - 1 + N) % N, the subtraction suffices.
source not stored for this graph (policy: none)
no outgoing calls
no test coverage detected