assertEquals(SmbComTransaction.TRANS2_GET_DFS_REFERRAL, dst[0]);
        assertEquals((byte) 0x00, dst[1]);
    }

    @Test
    @DisplayName("writeSetupWireFormat should handle different buffer positions")
    void testWriteSetupWireFormatWithOffset() {
        // Given
        trans2GetDfsReferral = new Trans2GetDfsReferral(mockConfig, "test");
        byte[] dst = new byte[20];
        int dstIndex = 5;

* `write(data)`: Escribe `data` (`str` o `bytes`) en el archivo.
* `read(size)`: Lee `size` (`int`) bytes/caracteres del archivo.
* `seek(offset)`: Va a la posición de bytes `offset` (`int`) en el archivo.
    * Por ejemplo, `await myfile.seek(0)` iría al inicio del archivo.
    * Esto es especialmente útil si ejecutas `await myfile.read()` una vez y luego necesitas leer el contenido nuevamente.

        DomUtils.insertContentElement(root, "url", "https://example.com");

        String xmlOutput = DomUtils.toXml(doc);

        // Find positions of all elements
        int modelVersionIndex = xmlOutput.indexOf("<modelVersion>");
        int groupIdIndex = xmlOutput.indexOf("<groupId>");
        int nameIndex = xmlOutput.indexOf("<name>");

        }
      }
      return false;
    }

    /**
     * If more than this many consecutive positions are filled in a table of the specified size,
     * report probable hash flooding. ({@link #hashFloodingDetected} may also report hash flooding
     * if fewer consecutive positions are filled; see that method for details.)
     */
    static int maxRunBeforeFallback(int tableSize) {

            assertEquals(6, smallEncodedSize); // actual: 2 bytes count + 2*2 bytes for ciphers
            assertEquals(6, largeEncodedSize);

            // Verify data at different positions
            assertArrayEquals(Arrays.copyOfRange(smallBuffer, 0, smallEncodedSize),
                    Arrays.copyOfRange(largeBuffer, 500, 500 + largeEncodedSize));
        }
    }

    @Nested

    void testStructureSizeImmutability() throws Exception {
        // Given
        byte[] buffer = new byte[2048];

        // When - encode at multiple positions
        for (int i = 0; i < 5; i++) {
            Smb2TreeConnectRequest req = new Smb2TreeConnectRequest(mockConfig, TEST_PATH);
            req.encode(buffer, i * 200);
        }

				len(reference.Erasure.Sets[i]), len(format.Erasure.Sets[i]))
		}
		for j := range reference.Erasure.Sets[i] {
			if reference.Erasure.Sets[i][j] != format.Erasure.Sets[i][j] {
				return fmt.Errorf("UUID on positions %d:%d do not match with, expected %s got %s: (%w)",
					i, j, reference.Erasure.Sets[i][j], format.Erasure.Sets[i][j], errInconsistentDisk)
			}
		}
	}

	// Make sure that the diskID is found in the set.

   * {@code k} is the size of the returned {@code ImmutableSet}, then the unique elements of {@code
   * elements} will be in the first {@code k} positions, and {@code elements[i] == null} for {@code
   * k <= i < n}.
   *
   * <p>After this method returns, {@code elements} will contain no duplicates, but {@code elements}

     */

    private final Comparator<? super E> comparator;

    @VisibleForTesting E[] elements;
    private int[] counts;

    /*
     * The number of used positions in the elements array.  We deduplicate periodically, so this
     * may fluctuate up and down.
     */
    private int length;

// on it.
type Reader struct {
	buf          []byte
	rd           io.Reader // reader provided by the client
	r, w         int       // buf read and write positions
	err          error
	lastByte     int // last byte read for UnreadByte; -1 means invalid
	lastRuneSize int // size of last rune read for UnreadRune; -1 means invalid
}

const minReadBufferSize = 16