int errorStart = 64;
            SMBUtil.writeInt2(9, buffer, errorStart); // structure size
            buffer[errorStart + 2] = 1; // error context count
            SMBUtil.writeInt4(5, buffer, errorStart + 4); // byte count

            // Error data
            buffer[errorStart + 8] = 1;
            buffer[errorStart + 9] = 2;
            buffer[errorStart + 10] = 3;

    public String execute() {
        final StringBuilder resultBuf = new StringBuilder();
        scoreBoosterList.forEach(b -> {
            try {
                final long count = b.process();
                resultBuf.append(b.getClass().getSimpleName()).append(" : ").append(count).append('\n');
            } catch (final Exception e) {
                logger.warn("Failed to update scores: booster={}", b.getClass().getSimpleName(), e);

        // Proximity (2 bytes for v3)
        SMBUtil.writeInt2(0, buffer, 16);

        // Time to live (2 bytes for v3)
        SMBUtil.writeInt2(300, buffer, 18);

        // DFS path offset (2 bytes) - points to string data
        SMBUtil.writeInt2(stringDataStart - 8, buffer, 20); // Offset from start of referral

        // DFS alternate path offset (2 bytes)
        SMBUtil.writeInt2(0, buffer, 22);

import org.jspecify.annotations.NullMarked;
import org.jspecify.annotations.Nullable;

/**
 * {@code ObjectCountHashMap} uses arrays to store key objects and count values. Comparing to using
 * a traditional {@code HashMap} implementation which stores keys and count values as map entries,
 * {@code ObjectCountHashMap} minimizes object allocation and reduces memory footprint.
 *

	ErrInvalidValueOfLength = errors.New("invalid association values, length doesn't match")
	// ErrPreloadNotAllowed preload is not allowed when count is used
	ErrPreloadNotAllowed = errors.New("preload is not allowed when count is used")
	// ErrDuplicatedKey occurs when there is a unique key constraint violation
	ErrDuplicatedKey = errors.New("duplicated key not allowed")

        // Then
        assertEquals(8, result);
        assertEquals(0xffffL, instance.getCount());
    }

    /**
     * Test of readParameterWordsWireFormat with zero count
     */
    @Test
    public void testReadParameterWordsWireFormatZeroCount() {
        // Given
        byte[] buffer = new byte[] { 0, 0, 0, 0, 0, 0, 0, 0 };

key directly to its instructions. type blockExpanded struct { rounds int // Round keys, where only the first (rounds + 1) × (128 ÷ 32) words are used. enc [60]uint32 dec [60]uint32 } const ( // AES-128 has 128-bit keys, 10 rounds, and uses 11 128-bit round keys // (11×128÷32 = 44 32-bit words). // AES-192 has 192-bit keys, 12 rounds, and uses 13 128-bit round keys // (13×128÷32 = 52 32-bit words). // AES-256 has 256-bit keys, 14 rounds, and uses 15 128-bit round keys // (15×128÷32 = 60 32-bit words)....

    }

    /** The incremental crawling setting. */
    public String incrementalCrawling;

    /** The day for cleanup setting. */
    public String dayForCleanup;

    /** The crawling thread count setting. */
    public String crawlingThreadCount;

    /** The search log setting. */
    public String searchLog;

    /** The user info setting. */
    public String userInfo;

     */
    public FileEntry[] getEntries() {
        final netdfs.DfsEnumArray200 a200 = (netdfs.DfsEnumArray200) this.info.e;
        final SmbShareInfo[] entries = new SmbShareInfo[a200.count];
        for (int i = 0; i < a200.count; i++) {
            entries[i] = new SmbShareInfo(a200.s[i].dfs_name, 0, null);
        }
        return entries;
    }

            when(mockReferral.getNode()).thenReturn("\\server\\share\\path");

            String reqPath = "\\\\server\\share\\path\\file";
            // Ensure consumed is within bounds to avoid StringIndexOutOfBoundsException
            consumed = Math.min(consumed, reqPath.length());