}

  /**
   * Returns {@code n!}, that is, the product of the first {@code n} positive integers, or {@code 1}
   * if {@code n == 0}.
   *
   * <p><b>Warning:</b> the result takes <i>O(n log n)</i> space, so use cautiously.
   *
   * <p>This uses an efficient binary recursive algorithm to compute the factorial with balanced
   * multiplies. It also removes all the 2s from the intermediate products (shifting them back in at

	// Read certificate file.
	var data []byte
	if data, err = os.ReadFile(certFile); err != nil {
		return nil, err
	}

	// Trimming leading and tailing white spaces.
	data = bytes.TrimSpace(data)

	// Parse all certs in the chain.
	current := data
	for len(current) > 0 {
		var pemBlock *pem.Block
		if pemBlock, current = pem.Decode(current); pemBlock == nil {

sStart:"최소한 ",badNumberOfSelectedOptionsEnd:" 개 항목 이상을 선택해야 합니다.",badAlphaNumeric:"입력 값은 문자와 숫자만 허용합니다.",badAlphaNumericAndExtra:"입력 값은 문자와 숫자와 ",badAlphaNumericExtra:" 만 허용합니다.",badAlphaNumericAndExtraAndSpaces:"입력 값은 문자와 숫자와 ",andSpaces:" 와 빈문자(spaces)만 허용합니다. ",wrongFileSize:"업로드 하려고 하는 파일의 크기가 너무 큽니다. (최대 %s)",wrongFileType:"파일 타입은 %s 만 허용합니다.",groupCheckedRangeStart:"",groupCheckedEnd:" 개 항목을 선택해야 합니다.",groupCheckedTooFewStart:"최소한 ",groupCheckedTooFewEnd:" 개 항목 이상을 선택해야 합니다.",groupCheckedT...

				"application/vnd.scribus",
				"application/vnd.sealed.3df",
				"application/vnd.sealed.csf",
				"application/vnd.sealed.doc",
				"application/vnd.sealed.eml",
				"application/vnd.sealed.mht",
				"application/vnd.sealed.net",
				"application/vnd.sealed.ppt",
				"application/vnd.sealed.tiff",
				"application/vnd.sealed.xls",
				"application/vnd.sealedmedia.softseal.html",

        if (message == null) {
            assertEquals(SMBProtocolDowngradeException.class.getName(), ex.toString());
        } else if (message.isEmpty()) {
            // Throwable.toString prints class + ": " (with space) even for empty string
            assertEquals(SMBProtocolDowngradeException.class.getName() + ": ", ex.toString());
        } else {

        if (Strings.isNullOrEmpty(badWord)) {
            return "badWord was empty.";
        }
        if (badWord.contains(" ") || badWord.contains("  ")) {
            return "badWord contains space.";
        }
        return null;
    }

    /**
     * Update default bad words.
     */
    protected static void updateDefaultBadwords() {
        if (defaultWords != null) {

    }

    // Helper methods for creating test buffers

    private byte[] createValidDfsReferralBuffer() {
        // Create a buffer representing a valid DFS referral response
        // Need to include space for actual string data
        int stringDataStart = 28; // After the referral structure
        String testPath = "\\server\\share";
        byte[] pathBytes = testPath.getBytes(java.nio.charset.StandardCharsets.UTF_16LE);

    assertThat(statusLine.protocol).isEqualTo(Protocol.HTTP_1_1)
    assertThat(statusLine.code).isEqualTo(code)
  }

  /**
   * This is not defined in the protocol but some servers won't add the leading empty space when the
   * message is empty. http://www.w3.org/Protocols/rfc2616/rfc2616-sec6.html#sec6.1
   */
  @Test
  fun emptyMessageAndNoLeadingSpace() {
    val version = 1
    val code = 503

   * strings. The map's keys are lowercase and should be treated case-insensitively.
   */
  @get:JvmName("authParams")
  val authParams: Map<String?, String>

  /** Returns the protection space. */
  @get:JvmName("realm")
  val realm: String?
    get() = authParams["realm"]

  /** The charset that should be used to encode the credentials. */
  @get:JvmName("charset")
  val charset: Charset
    get() {

urn a.replace(/\s+$/,"")},capitalize:function(b){var c=b.split(" ");return a.each(c,function(a,b){c[a]=b.substr(0,1).toUpperCase()+b.substr(1,b.length)}),c.join(" ")},insert:function(a,b,c){var d=(b.attr("data-sanitize-insert-"+c)||"").replace(/\[SPACE\]/g," ");return"left"===c&&0===a.indexOf(d)||"right"===c&&a.substring(a.length-d.length)===d?a:("left"===c?d:"")+a+("right"===c?d:"")},insertRight:function(a,b){return this.insert(a,b,"right")},insertLeft:function(a,b){return this.insert(a,b,"left...