*
     * @see jcifs.Decodable#decode(byte[], int, int)
     */
    @Override
    public int decode(final byte[] buffer, final int bufferIndex, final int len) throws SMBProtocolDecodingException {
        if (this.largeFile) {
            this.pid = SMBUtil.readInt2(buffer, bufferIndex);
            final int boHigh = SMBUtil.readInt4(buffer, bufferIndex + 4);
            final int boLow = SMBUtil.readInt4(buffer, bufferIndex + 8);

            when(mockNdrBuffer.dec_ndr_short()).thenReturn((int) (short) 0x9ABC, (int) (short) 0xDEF0);
            when(mockNdrBuffer.dec_ndr_small()).thenReturn((int) (byte) 0x11, (int) (byte) 0x22, // clock seq bytes
                    (int) (byte) 0xAA, (int) (byte) 0xBB, (int) (byte) 0xCC, (int) (byte) 0xDD, (int) (byte) 0xEE, (int) (byte) 0xFF // node bytes
            );

        // Given
        int offset = 100;
        byte[] largeOutputBuffer = new byte[1024];
        Smb2ReadResponse offsetResponse = new Smb2ReadResponse(mockConfig, largeOutputBuffer, offset);

        byte[] buffer = new byte[256];
        int bodyStart = 0;
        int dataLength = 50;
        int dataOffsetFromHeader = 80;

        // Write structure

    }
    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();

    }
    this.axesSizeProduct = axesSizeProduct;
  }

  private int getAxisIndexForProductIndex(int index, int axis) {
    return (index / axesSizeProduct[axis + 1]) % axes.get(axis).size();
  }

  @Override
  public int indexOf(@Nullable Object o) {
    if (!(o instanceof List)) {
      return -1;
    }
    List<?> list = (List<?>) o;

        buffer[6] = 0;
        buffer[7] = 0;

        return buffer;
    }

    private byte[] createDfsReferralBufferWithMultipleReferrals(int numReferrals) {
        // Each referral structure needs 20 bytes, plus string data
        int referralSize = 20;
        int referralsDataSize = numReferrals * referralSize;

        // Add space for string data for each referral
        String testPath = "\\server\\share";

  public Object measureSize() {
    list = impl.newExecutionList();
    for (int i = 0; i < numListeners; i++) {
      list.add(listener, directExecutor());
    }
    return list.getImpl();
  }

  @Benchmark
  int addThenExecute_singleThreaded(int reps) {
    int returnValue = 0;
    for (int i = 0; i < reps; i++) {
      list = impl.newExecutionList();

   * @throws IllegalArgumentException if the scanned sub-sequence of {@code csq} contains invalid
   *     surrogate pairs
   */
  protected int nextEscapeIndex(CharSequence csq, int start, int end) {
    int index = start;
    while (index < end) {
      int cp = codePointAt(csq, index, end);
      if (cp < 0 || escape(cp) != null) {
        break;
      }
      index += charCount(cp);
    }

     */
    public static final int DEFAULT_PAGE_SIZE = 20;

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

    /**
     * Total number of records.
     */
    private int allRecordCount;

    /**
     * Total number of pages.
     */
    private int allPageCount;

    /**

@NullUnmarked
public class HashMultisetAddPresentBenchmark {
  private static final int ARRAY_MASK = 0x0ffff;
  private static final int ARRAY_SIZE = 0x10000;
  List<Multiset<Integer>> multisets = new ArrayList<>(0x10000);
  int[] queries = new int[ARRAY_SIZE];

  @BeforeExperiment
  void setUp() {
    Random random = new Random();
    multisets.clear();
    for (int i = 0; i < ARRAY_SIZE; i++) {