// We consider elementData(index) a "hole", and we want to fill it
    // with the last element of the heap, toTrickle.
    // Since the last element of the heap is from the bottom level, we
    // optimistically fill index position with elements from lower levels,
    // moving the hole down. In most cases this reduces the number of
    // comparisons with toTrickle, but in some cases we will need to bubble it
    // all the way up again.

		{
			name: "fill error, discard less",
			r: newScriptedReader(func(p []byte) (n int, err error) {
				if len(p) < 5 {
					panic("unexpected small read")
				}
				return 5, errors.New("5-then-error")
			}),
			n:            4,
			want:         4,
			wantErr:      nil,
			wantBuffered: 1,
		},
		{
			name: "fill error, discard equal",

        generator.task = new Tuple3<>("generator1", "docid1", "path1");
        thumbnailManager.add(generator);

        Map<String, Object> docMap = new HashMap<>();
        docMap.put("_id", "docid1");

        // Fill the queue
        thumbnailManager.offer(docMap);

        // Try to add another - should succeed (warning logged but still returns true)
        Map<String, Object> docMap2 = new HashMap<>();

 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *

    void testWriteSetupWireFormatPreservesBuffer() {
        notifyChange = new NtTransNotifyChange(mockConfig, 0x1234, FILE_NOTIFY_CHANGE_FILE_NAME, false);
        byte[] dst = new byte[20];

        // Fill buffer with test pattern
        for (int i = 0; i < dst.length; i++) {
            dst[i] = (byte) (i & 0xFF);
        }

        int startIndex = 5;

	// diskFillFraction is the fraction of a disk we allow to be filled.
	diskFillFraction = 0.99

	// diskReserveFraction is the fraction of a disk where we will fill other server pools first.
	// If all pools reach this, we will use all pools with regular placement.
	diskReserveFraction = 0.15

	// diskAssumeUnknownSize is the size to assume when an unknown size upload is requested.
	diskAssumeUnknownSize = 1 << 30

    void testInitDefaultsWithPresetMachineId() throws Exception {
        BaseConfiguration testConfig = new BaseConfiguration(false);
        byte[] customMachineId = new byte[32];
        Arrays.fill(customMachineId, (byte) 0xFF);

        // Use reflection to set private field
        java.lang.reflect.Field machineIdField = BaseConfiguration.class.getDeclaredField("machineId");
        machineIdField.setAccessible(true);

            // Write valid response data
            SMBUtil.writeInt4(15, buffer, 0);
            SMBUtil.writeInt4(16384, buffer, 4);
            SMBUtil.writeInt4(245760, buffer, 8);
            // Fill rest with random data
            for (int i = 12; i < buffer.length; i++) {
                buffer[i] = (byte) (i % 256);
            }

            int bytesDecoded = response.decode(buffer, 0, buffer.length);

        @DisplayName("Should not modify buffer beyond encoded area")
        void testEncodeDoesNotModifyBeyondArea() {
            // Given
            byte testByte = (byte) 0xFF;
            java.util.Arrays.fill(buffer, testByte);
            SrvCopychunk chunk = new SrvCopychunk(1024, 2048, 4096);

            // When
            chunk.encode(buffer, startIndex);

            // Then

    void testDecodeWithMinimumBufferSize() throws SMBProtocolDecodingException {
        // Given
        byte[] buffer = new byte[36]; // Minimum required size
        int bufferIndex = 0;

        // Fill with test data using SMBUtil
        SMBUtil.writeTime(TEST_CREATE_TIME, buffer, bufferIndex);
        SMBUtil.writeTime(TEST_LAST_ACCESS_TIME, buffer, bufferIndex + 8);