}

  @Benchmark
  int asciiStringToUpperCase(int reps) {
    String string = noWorkToDo ? Ascii.toUpperCase(testString) : testString;

    int dummy = 0;
    for (int i = 0; i < reps; i++) {
      dummy += Ascii.toUpperCase(string).length();
    }
    return dummy;
  }

  @Benchmark
  int asciiCharSequenceToUpperCase(int reps) {

    /** Default current page number constant. */
    public static final int DEFAULT_CURRENT_PAGE_NUMBER = 1;

    /** Total number of records across all pages. */
    private int allRecordCount;

    /** Total number of pages calculated from record count and page size. */
    private int allPageCount;

    /** Flag indicating whether a previous page exists. */
    private boolean existPrePage;

        // Prepare test data with different offset
        byte[] buffer = new byte[100];
        int bufferIndex = 50;

        // Set test values
        int testCapabilities = 0xABCDEF00;
        byte[] testGuid = new byte[16];
        Arrays.fill(testGuid, (byte) 0xFF);
        int testSecurityMode = 0x0001;
        int testDialect = 0x0202;

        // Write to buffer

   *     such index exists.
   */
  public static int indexOf(short[] array, short target) {
    return indexOf(array, target, 0, array.length);
  }

  // TODO(kevinb): consider making this public
  private static int indexOf(short[] array, short target, int start, int end) {
    for (int i = start; i < end; i++) {
      if (array[i] == target) {
        return i;
      }
    }

  }

  // Modification Operations
  @CanIgnoreReturnValue
  @Override
  public int add(E element, int occurrences) {
    checkIsE(element);
    checkNonnegative(occurrences, "occurrences");
    if (occurrences == 0) {
      return count(element);
    }
    int index = element.ordinal();
    int oldCount = counts[index];
    long newCount = (long) oldCount + occurrences;

        this.identifier_authority = new byte[6];
        for (int i = 5; id > 0; i--) {
            this.identifier_authority[i] = (byte) (id % 256);
            id >>= 8;
        }

        this.sub_authority_count = (byte) st.countTokens();
        if (this.sub_authority_count > 0) {
            this.sub_authority = new int[this.sub_authority_count];
            for (int i = 0; i < this.sub_authority_count; i++) {

    }
    Map<C, Map<R, V>> columns = new LinkedHashMap<>();
    for (C col : columnSpace) {
      columns.put(col, new LinkedHashMap<R, V>());
    }
    int[] cellRowIndices = new int[cellList.size()];
    int[] cellColumnInRowIndices = new int[cellList.size()];
    for (int i = 0; i < cellList.size(); i++) {
      Cell<R, C, V> cell = cellList.get(i);
      R rowKey = cell.getRowKey();
      C columnKey = cell.getColumnKey();

        byte[] paramBuffer = new byte[256];
        byte[] dataBuffer = new byte[256];

        int setupWritten = trans2SetFileInfo.writeSetupWireFormat(setupBuffer, 0);
        int paramWritten = trans2SetFileInfo.writeParametersWireFormat(paramBuffer, 0);
        int dataWritten = trans2SetFileInfo.writeDataWireFormat(dataBuffer, 0);

        // Verify lengths
        assertEquals(2, setupWritten);

        byte[] buffer = new byte[30]; // Extra space to test offset
        int bufferIndex = 5; // Start at offset 5
        long expectedAllocationSize = 2048L;
        long expectedEndOfFile = 1536L;
        int expectedNumberOfLinks = 5;
        boolean expectedDeletePending = true;
        boolean expectedDirectory = true;

        // Encode test data at offset
        int offset = bufferIndex;

     * Test that the constructor initializes all fields correctly
     */
    @Test
    public void testConstructor() {
        // Arrange
        int fid = 0x1234;
        int offset = 100;
        int remaining = 50;
        byte[] buffer = new byte[100];
        int off = 10;
        int len = 40;

        // Act
        SmbComWrite write = new SmbComWrite(fid, offset, remaining, buffer, off, len);

        // Assert