void testReadBytesWireFormatMaxBufferIndex() throws SMBProtocolDecodingException {
        byte[] buffer = new byte[65536]; // Large buffer
        int bufferIndex = 65534; // Near the end

        // Set structure size to 2
        SMBUtil.writeInt2(2, buffer, bufferIndex);

        int result = response.readBytesWireFormat(buffer, bufferIndex);

        assertEquals(2, result);
    }

	bufferPool  bpool.Pool[[]byte]        // pool of []byte objects for input
	kvDstPool   bpool.Pool[[]jstream.KVS] // pool of []jstream.KVS used for output
	close       chan struct{}             // used for shutting down the splitter before end of stream
	readerWg    sync.WaitGroup            // used to keep track of async reader.
}

// queueItem is an item in the queue.
type queueItem struct {
	input []byte             // raw input sent to the worker

     * Uses finer-grained locking to avoid blocking other operations during I/O.
     *
     * @param sessionId unique identifier for the process session
     * @param command the command to send to the process
     * @throws JobNotFoundException if no process is found for the given session ID
     * @throws JobProcessingException if there's an error sending the command
     */

        // Test exact buffer boundaries
        byte[] buffer = new byte[100];
        validator.validateBufferAccess(buffer, 0, 100); // Exactly full buffer
        validator.validateBufferAccess(buffer, 100, 0); // Zero length at end
    }

			parity := total - data
			testConfigs = append(testConfigs, [2]uint8{data, parity})
		}
	}
	got := make(map[[2]uint8]map[ErasureAlgo]uint64, len(testConfigs))
	// Copied from output of fmt.Printf("%#v", got) at the end.

  /**
   * Tests that the method {@code putEdge} will silently add the missing nodes to the graph, then
   * add the edge connecting them. We are not using the proxy methods here as we want to test {@code
   * putEdge} when the end-points are not elements of the graph.
   */
  @Test
  public void putEdge_nodesNotInGraph() {
    assume().that(graphIsMutable()).isTrue();

    graphAsMutableGraph.addNode(N1);

        String expectedEnd = ",addrEntry=]";
        String actual = nameQueryResponse.toString();
        assertTrue(actual.endsWith(expectedEnd), "toString should end with ',addrEntry=]' when addrEntry is null");
        assertTrue(actual.startsWith("NameQueryResponse["), "toString should start with expected prefix");
    }

    @Test

            // Test at buffer start
            int result1 = response.decode(buffer, 0, 10);
            assertEquals(10, result1);

            // Test at buffer end
            int result2 = response.decode(buffer, 90, 10);
            assertEquals(10, result2);

            // Test full buffer
            int result3 = response.decode(buffer, 0, 100);

                    .desc("Stop at first failure in reactorized builds")
                    .get());
            options.addOption(Option.builder(FAIL_AT_END)
                    .longOpt("fail-at-end")
                    .desc("Only fail the build afterwards; allow all non-impacted builds to continue")
                    .get());
            options.addOption(Option.builder(FAIL_NEVER)

                    return name.length();
                }

                @Override
                public CharSequence subSequence(final int start, final int end) {
                    return name.subSequence(start, end);
                }

            };
        }

        /**
         * @return CharSequence
         */
        public static CharSequence aaa() {