collect.forEach(consumer::accept);
    }

    private String getGradleProjectPathFor(Version version) {
        // We have Gradle projects set up to check out and build unreleased versions based on the our branching
        // conventions described in this classes javadoc
        if (version.equals(currentVersion)) {
            return ":distribution";
        }

      char c1 = s1.charAt(i);
      char c2 = s2.charAt(i);
      if (c1 == c2) {
        continue;
      }
      int alphaIndex = getAlphaIndex(c1);
      // This was also benchmarked using '&' to avoid branching (but always evaluate the rhs),
      // however this showed no obvious improvement.
      if (alphaIndex < 26 && alphaIndex == getAlphaIndex(c2)) {
        continue;
      }
      return false;
    }

      // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b).
      // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.

      // We bend over backwards to avoid branching, adapting a technique from
      // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax

      int delta = a - b; // can't overflow, since a and b are nonnegative

      char c1 = s1.charAt(i);
      char c2 = s2.charAt(i);
      if (c1 == c2) {
        continue;
      }
      int alphaIndex = getAlphaIndex(c1);
      // This was also benchmarked using '&' to avoid branching (but always evaluate the rhs),
      // however this showed no obvious improvement.
      if (alphaIndex < 26 && alphaIndex == getAlphaIndex(c2)) {
        continue;
      }
      return false;
    }

// The threshold of 8 bytes balances initialization cost against per-byte
// search cost, performing well across all charset sizes.
//
// More complex heuristics (e.g., different thresholds per charset size)
// add branching overhead that eats away any theoretical improvements.
func shouldUseASCIISet(bufLen int) bool {
	return bufLen > 8
}

// containsRune is a simplified version of strings.ContainsRune

      // Both a and b are odd. Assume a > b; then gcd(a - b, b) = gcd(a, b).
      // But in gcd(a - b, b), a - b is even and b is odd, so we can divide out powers of two.

      // We bend over backwards to avoid branching, adapting a technique from
      // http://graphics.stanford.edu/~seander/bithacks.html#IntegerMinOrMax

      long delta = a - b; // can't overflow, since a and b are nonnegative

        int length = testBlock.encode(buffer, 0);

        assertTrue(length > 0);
        assertNull(testBlock.getAndx()); // andx should be cleared when batching disabled
    }

    @Test
    @DisplayName("Test encode with andx command and batching enabled")
    void testEncodeWithAndxBatchingEnabled() {
        when(mockConfig.isUseBatching()).thenReturn(true);
        when(mockAndxCommand.getCommand()).thenReturn(0x42);

import org.junit.jupiter.api.Test;

/**
 * JUnit 5 tests for AndXServerMessageBlock in legacy smb1 package.
 *
 * The tests use small stub subclasses to drive encode/decode paths and
 * validate batching, chaining, signing, and NT_CREATE_ANDX extended handling.
 */
class AndXServerMessageBlockTest {

    /**
     * Test stub for AndXServerMessageBlock to control read/write logic.
     */

    /** Milliseconds between 1970 and 1601 */
    long MILLISECONDS_BETWEEN_1970_AND_1601 = 11644473600000L;
    /** Default timezone */
    TimeZone TZ = TimeZone.getDefault();

    /** Whether to use batching */
    boolean USE_BATCHING = Config.getBoolean("jcifs.smb1.smb.client.useBatching", true);
    /** OEM encoding */
    String OEM_ENCODING = Config.getProperty("jcifs.smb1.encoding", Config.DEFAULT_OEM_ENCODING);

         * the 'received' member of the response object will not
         * be set to true indicating the send and sendTransaction
         * methods that the next part should be sent. This is a
         * very indirect and simple batching control mechanism.
         */

        if (andx == null || !USE_BATCHING || batchLevel >= getBatchLimit(andx.command)) {
            andxCommand = (byte) 0xFF;
            andx = null;