}
  }

  public void testVerifyGetsCalled() {
    TesterThatCountsCalls tester = new TesterThatCountsCalls();

    tester.test();

    assertEquals(
        "Should have verified once per stimulus executed",
        tester.numCallsToVerify,
        tester.numCallsToNewTargetIterator * STEPS);
  }

  public void testVerifyCanThrowAssertionThatFailsTest() {

        byte[] salt2 = preauthService.generatePreauthSalt();

        assertNotNull(salt1);
        assertNotNull(salt2);
        assertEquals(32, salt1.length); // 32 bytes as per SMB 3.1.1 spec
        assertEquals(32, salt2.length);
        assertFalse(java.util.Arrays.equals(salt1, salt2)); // Should be different
    }

    @Test
    @DisplayName("Test session initialization")

        String testPath = "\\server\\share";
        byte[] pathBytes = testPath.getBytes(java.nio.charset.StandardCharsets.UTF_16LE);
        int stringDataSize = numReferrals * (pathBytes.length + 2); // +2 for null terminator per string

        int bufferSize = 8 + referralsDataSize + stringDataSize;
        byte[] buffer = new byte[bufferSize];

        // Path consumed (2 bytes)
        SMBUtil.writeInt2(10, buffer, 0);

    /**
     * Returns the command-line arguments to be parsed.
     *
     * @return a list of argument strings
     */
    @Nonnull
    List<String> args();

    /**
     * Per-request {@link Lookup} for customization.
     *
     * @return a lookup possibly with custom components
     */
    @Nonnull
    Lookup lookup();

    /**

features such as versioning, object locking, and bucket replication require distributed deploying MinIO with Erasure Coding. For extended development and production, deploy MinIO with Erasure Coding enabled - specifically, with a *minimum* of 4 drives per MinIO server. See [MinIO Erasure Code Overview](https://min.io/docs/minio/linux/operations/concepts/erasure-coding.html#) for more complete documentation. ## Install from Source Use the following commands to compile and run a standalone MinIO server...

            semantics.
            <p>In general, this is a properties format: {@code <name>value</name>} with per-toolchain
            defined properties names.
          </description>
        </field>
      </fields>
      <codeSegments>
        <codeSegment>
          <version>1.2.0+</version>

# specific language governing permissions and limitations
# under the License.

name: Java CI

on:
  push:
    branches: [ master ]
  pull_request:
    branches: [ master ]

# allow single build per branch or PR
concurrency:
  group: ${{ github.workflow }}-${{ github.ref }}
  cancel-in-progress: true

# clear all permissions for GITHUB_TOKEN
permissions: {}

jobs:
  initial-build:

/**
 * A sorted multiset which forwards all its method calls to another sorted multiset. Subclasses
 * should override one or more methods to modify the behavior of the backing multiset as desired per
 * the <a href="http://en.wikipedia.org/wiki/Decorator_pattern">decorator pattern</a>.
 *
 * <p><b>Warning:</b> The methods of {@code ForwardingSortedMultiset} forward

 * bits.
 *
 * We split each code point into a 14-bit prefix and a 7-bit suffix. All code points with the same
 * prefix are called a 'section'. There are 128 code points per section.
 *
 * Ranges Data (32,612 bytes)
 * ==========================
 *
 * Each entry is 4 bytes, and represents a _range_ of code points that all share a common 14-bit

    private byte[] charsToBytes(char[] chars) {
        if (chars == null) {
            return null;
        }

        // Use UTF-8 encoding
        byte[] bytes = new byte[chars.length * 3]; // Max 3 bytes per char in UTF-8
        int byteIndex = 0;

        for (char c : chars) {
            if (c < 0x80) {
                bytes[byteIndex++] = (byte) c;
            } else if (c < 0x800) {