assertEquals(0x1F01FF, response.getMaximalAccess());
    }

    @DisplayName("Should throw exception for invalid structure size")
    @ParameterizedTest
    @ValueSource(ints = { 0, 1, 2, 4, 8, 15, 17, 32, 64, 65535 })
    void testReadBytesWireFormatInvalidStructureSize(int structureSize) {
        // Given
        byte[] buffer = new byte[256];
        int offset = 0;

     * - Negative values with 0xC0000000 bits set are returned as-is
     * - Positive values not in DOS_ERROR_CODES map to NT_STATUS_UNSUCCESSFUL
     */
    @ParameterizedTest
    @ValueSource(ints = { 0, 1, 123, -7 })
    void testGetNtStatusVariousCodes(int errcode) {
        SmbException ex = new SmbException(errcode, false);
        int expected;
        if (errcode == 0) {
            expected = 0;

			PauseEnd:   gcStats.PauseEnd,
		},
		MinioEnvVars: make(map[string]string, 10),
	}

	for poolNumber := range poolNumbers {
		props.PoolNumbers = append(props.PoolNumbers, poolNumber)
	}
	sort.Ints(props.PoolNumbers)
	props.PoolNumber = func() int {
		if len(props.PoolNumbers) == 1 {
			return props.PoolNumbers[0]
		}
		return math.MaxInt // this indicates that its unset.
	}()

   * </ul>
   *
   * <p>This method is suitable for the common use case of dividing work among buckets that meet the
   * following conditions:
   *
   * <ul>
   *   <li>You want to assign the same fraction of inputs to each bucket.
   *   <li>When you reduce the number of buckets, you can accept that the most recently added
   *       buckets will be removed first. More concretely, if you are dividing traffic among tasks,

        // Verify watchTree flag is set to 0x01
        assertEquals(0x01, dst[dstIndex + 6]);
    }

    @ParameterizedTest
    @DisplayName("Test writeSetupWireFormat with various FID values")
    @ValueSource(ints = { 0x0000, 0x0001, 0x7FFF, 0xFFFF, 0x1234, 0xABCD })
    void testWriteSetupWireFormatWithVariousFids(int fid) {
        notifyChange = new NtTransNotifyChange(mockConfig, fid, FILE_NOTIFY_CHANGE_FILE_NAME, false);

//
// floating point conditional branch
//
//	LBRA rel
label4:
	BFPT	1(PC)	// BFPT 1(PC)			// 4501000100000000
	BFPT	label4	// BFPT 24			// 4501fffd00000000

//inst:
//
// load ints and bytes
//
//	LMOVV rreg ',' rreg
//	{
//		outcode(int($1), &$2, 0, &$4);
//	}
	MOVV	R25, R17	// 00198825
	MOVV	R1, R2		// 00011025
	MOVV	LO, R1		// 00000812
	MOVV	HI, R1		// 00000810

            SmbFileInputStream in = newStream();
            int v = in.read();
            assertEquals(-1, v);
        }
    }

    @Nested
    @DisplayName("Edge and invalid inputs")
    class EdgeCases {

        @Test
        @DisplayName("read(null) throws NullPointerException")
        void readNullArrayThrows() throws Exception {
            SmbFileInputStream in = newStream();

### Core Design Principles
CoreLib follows a **utility-class pattern** where most functionality is exposed through static methods:

- **Assertion-based validation** - All methods validate inputs using `AssertionUtil.assertArgumentNotNull()` and `AssertionUtil.assertArgumentNotEmpty()`

   * that gets messy here, and we already have null tests for Range.
   */

  /*
   * These generators also rely on consecutive integer inputs (not necessarily in order, but no
   * holes).
   */

  // SetCreationTester has some tests that pass in duplicates. Dedup them.

            assertEquals(4, context.size()); // Only header
        }

        @ParameterizedTest
        @DisplayName("Should encode with different hash algorithm counts")
        @ValueSource(ints = { 0, 1, 2, 5, 10 })
        void testEncodeWithDifferentHashAlgoCounts(int count) {
            int[] hashAlgos = new int[count];
            for (int i = 0; i < count; i++) {
                hashAlgos[i] = i + 1;