input = Strings.repeat(text, length);
  }

  @Benchmark
  int charSplitter(int reps) {
    int total = 0;

    for (int i = 0; i < reps; i++) {
      total += Iterables.size(CHAR_SPLITTER.split(input));
    }

    return total;
  }

  @Benchmark
  int stringSplitter(int reps) {
    int total = 0;

    for (int i = 0; i < reps; i++) {
      total += Iterables.size(STRING_SPLITTER.split(input));

                Arguments.of(DialectVersion.SMB202, DialectVersion.SMB210, new int[] { 0x0202, 0x0210 }),
                Arguments.of(DialectVersion.SMB210, DialectVersion.SMB300, new int[] { 0x0210, 0x0300 }),
                Arguments.of(DialectVersion.SMB202, DialectVersion.SMB311, new int[] { 0x0202, 0x0210, 0x0300, 0x0302, 0x0311 }),

    }

    abstract int writeSetupWireFormat(byte[] dst, int dstIndex);

    abstract int writeParametersWireFormat(byte[] dst, int dstIndex);

    abstract int writeDataWireFormat(byte[] dst, int dstIndex);

    abstract int readSetupWireFormat(byte[] buffer, int bufferIndex, int len);

    abstract int readParametersWireFormat(byte[] buffer, int bufferIndex, int len);

        long overallStart = System.nanoTime();

        for (int t = 0; t < threadCount; t++) {
            final int threadId = t;
            executor.submit(() -> {
                try {
                    startLatch.await();

                    long threadStart = System.nanoTime();
                    for (int i = 0; i < operationsPerThread; i++) {
                        try {

        // implies the correct parameters were used internally.
    }

    @Test
    void constructor_shouldThrowSmbExceptionOnOpenFailure() throws IOException {
        // Arrange
        int access = 1;
        int rid = 100;
        int errorCode = 0xC0000022; // Example error code

        // Mock the behavior of sendrecv for MsrpcSamrOpenAlias to simulate failure
        doAnswer(invocation -> {

 * DNS resolvable hosts.
 */

public class UniAddress {

    private static final int RESOLVER_WINS = 0;
    private static final int RESOLVER_BCAST = 1;
    private static final int RESOLVER_DNS = 2;
    private static final int RESOLVER_LMHOSTS = 3;

    private static int[] resolveOrder;
    private static InetAddress baddr;

    private static LogStream log = LogStream.getInstance();

    }

    @Override
    protected int writeParameterWordsWireFormat(final byte[] dst, final int dstIndex) {
        SMBUtil.writeInt2(this.searchAttributes, dst, dstIndex);
        return 2;
    }

    @Override
    protected int writeBytesWireFormat(final byte[] dst, int dstIndex) {
        final int start = dstIndex;

        dst[dstIndex] = (byte) 0x04;
        dstIndex++;

        if (fitsInLong(difference)) {
          int expected = (x < y) ? 1 : 0;
          int actual = LongMath.lessThanBranchFree(x, y);
          assertEquals(expected, actual);
        }
      }
    }
  }

  // Throws an ArithmeticException if "the simple implementation" of binomial coefficients overflows
  @GwtIncompatible // TODO
  private long simpleBinomial(int n, int k) {
    long accum = 1;

        this.took = took;
    }

    public int getTotalShards() {
        return totalShards;
    }

    public void setTotalShards(int totalShards) {
        this.totalShards = totalShards;
    }

    public int getSuccessfulShards() {
        return successfulShards;
    }

    public void setSuccessfulShards(int successfulShards) {
        this.successfulShards = successfulShards;
    }

        SuggestSettings settings = suggester.settings();
        int num = 10000;

        addDocument(indexName, client, num);

        ESSourceReader reader = new ESSourceReader(client, settings, indexName);
        reader.setScrollSize(1000);
        reader.addSort(SortBuilders.fieldSort("field2"));
        int count = 0;
        int prev = -1;
        Map<String, Object> source;