License. However, in accepting such obligations, You may act only
      on Your own behalf and on Your sole responsibility, not on behalf
      of any other Contributor, and only if You agree to indemnify,
      defend, and hold each Contributor harmless for any liability
      incurred by, or claims asserted against, such Contributor by reason
      of your accepting any such warranty or additional liability.

      License. However, in accepting such obligations, You may act only
      on Your own behalf and on Your sole responsibility, not on behalf
      of any other Contributor, and only if You agree to indemnify,
      defend, and hold each Contributor harmless for any liability
      incurred by, or claims asserted against, such Contributor by reason
      of your accepting any such warranty or additional liability.

     * @throws IOException if an I/O error occurs
     */
    protected <T extends Response> long doSend(final Request request, final T response, final Set<RequestParam> params, final long timeout)
            throws IOException {
        final long firstKey = prepareRequests(request, response, params, timeout);
        doSend(request);
        return firstKey;
    }

    /**
     * @param request
     * @param response

crawler.document.unknown.hostname=unknown
# Whether to use site encoding for English documents.
crawler.document.use.site.encoding.on.english=false
# Whether to append data to documents.
crawler.document.append.data=true
# Whether to append filename to documents.
crawler.document.append.filename=false
# Maximum size of alphanumeric terms in documents.
crawler.document.max.alphanum.term.size=20
# Maximum size of symbol terms in documents.

 * remove) are supported. Null keys and values are supported.
 *
 * <p>{@code containsKey(k)}, {@code put(k, v)} and {@code remove(k)} are all (expected and
 * amortized) constant time operations. Expected in the hashtable sense (depends on the hash
 * function doing a good job of distributing the elements to the buckets to a distribution not far
 * from uniform), and amortized since some operations can trigger a hash table resize.
 *

            final String value = node.getTextContent();
            if (value != null) {
                final String content = value.trim();
                if (content.length() > 0) {
                    buf.append(' ').append(content);
                }
            }
        }
    }

    /**
     * Processes Google on/off comment directives in the node.
     *
     * @param node the node to process

ld(n+3){border-top-right-radius:0;border-bottom-right-radius:0}.input-group-append,.input-group-prepend{display:-ms-flexbox;display:flex}.input-group-append .btn,.input-group-prepend .btn{position:relative;z-index:2}.input-group-append .btn:focus,.input-group-prepend .btn:focus{z-index:3}.input-group-append .btn+.btn,.input-group-append .btn+.input-group-text,.input-group-append .input-group-text+.btn,.input-group-append .input-group-text+.input-group-text,.input-group-prepend .btn+.btn,.input-group-prepend...

    }

    @Test
    @DisplayName("Test with very long filename")
    void testWithVeryLongFilename() {
        StringBuilder sb = new StringBuilder();
        for (int i = 0; i < 100; i++) {
            sb.append("longname");
        }
        String longFileName = sb.toString() + ".txt";

        FileRenameInformation2 info = new FileRenameInformation2(longFileName, false);

        StringBuilder sb = new StringBuilder();
        for (int i = offset; i < offset + length && buffer[i] != 0; i++) {
            if (buffer[i] != 0) {
                sb.append((char) buffer[i]);
            }
        }
        return sb.toString();
    }

      }
      // if the length of the toString() result was > maxLength for some reason, truncate that
      seq = string;
    }

    return new StringBuilder(maxLength)
        .append(seq, 0, truncationLength)
        .append(truncationIndicator)
        .toString();
  }

  /**
   * Indicates whether the contents of the given character sequences {@code s1} and {@code s2} are