검색어의 첫 번째 문자는 사용할 수 없습니다.
	</dd>
	<dt>범위검색</dt>
	<dd>
		범위 검색 필드 값의 범위를 지정하여 그 조건에 일치하는 문서를 검색합니다.
		범위의 경계 값을 포함하려면 []를 사용하여 포함하지 않는 경우는 {}을 이용합니다.
		예를 들어, content_length 필드가 1000에서 10000의 값을 가진 문서를 검색하려면 다음과 같이 입력합니다.
		<pre>content_length:[1000 TO 10000]</pre>
	</dd>
	<dt>부스트(Boost)검색</dt>
	<dd>
		부스트 검색은 검색어 뒤에 ^을 지정하여 사용할 수 있습니다.
		^ 다음에 가중치 값을 정수로 지정하여 그 검색어가 향상됩니다.
		<pre>Fess^100</pre>
	</dd>
	<dt>퍼지(Fuzzy)검색</dt>

import org.junit.jupiter.api.Test

@Suppress("ktlint:standard:property-naming")
class InetAddressOrderTest {
  val ipv4_10_0_0_6 = Inet4Address.getByName("10.0.0.6")
  val ipv4_10_0_0_1 = Inet4Address.getByName("10.0.0.1")
  val ipv4_10_0_0_4 = Inet4Address.getByName("10.0.0.4")
  val ipv6_ab = Inet6Address.getByName("::ac")
  val ipv6_fc = Inet6Address.getByName("::fc")

  @Test fun prioritiseIpv6Example() {
    val result =

        assertEquals(0, new BigDecimal("1.23E-10").compareTo(BigDecimalConversionUtil.toBigDecimal(Double.valueOf(0.000000000123))));

        assertEquals(0, new BigDecimal("100.00").compareTo(BigDecimalConversionUtil.toBigDecimal("100.00")));
        assertEquals(0, new BigDecimal("0.000000123").compareTo(BigDecimalConversionUtil.toBigDecimal("1.23E-7")));

        String result =
                "{\"bool\":{\"should\":[{\"geo_distance\":{\"location\":[151.0,35.0],\"distance\":1000.0,\"distance_type\":\"arc\",\"validation_method\":\"STRICT\",\"ignore_unmapped\":false,\"boost\":1.0}},{\"geo_distance\":{\"location\":[150.0,34.0],\"distance\":10000.0,\"distance_type\":\"arc\",\"validation_method\":\"STRICT\",\"ignore_unmapped\":false,\"boost\":1.0}}],\"adjust_pure_negative\":true,\"boost\":1.0}}";

     * This is a required field with a maximum length of 1000 characters.
     */
    @Required
    @Size(max = 1000)
    public String name;

    /**
     * The actual access token string.
     * This is the token value that will be used for authentication.
     * Maximum length is 10000 characters.
     */
    @Size(max = 10000)
    public String token;

    /**

            $favoritedCount = $(".favorited-count", $favorited);
            $favoritedCount.css("display", "none");
            $favorite.fadeOut(1000, function() {
              $favorited.fadeIn(1000);
            });
          }
        })
        .fail(function(data) {
          $favorite.attr("href", "#" + docId);
          // alert(JSON.stringify(data));
        });
    }

     */
    @Required
    @Size(max = 10000)
    public String term;

    /**
     * The related content to be displayed.
     */
    @Required
    @Size(max = 10000)
    public String content;

    /**
     * The virtual host for which this related content applies.
     */
    @Size(max = 1000)
    public String virtualHost;

    /**

    @ValidateTypeFailure
    public Integer crudMode;

    /** URL expression pattern to match documents for boosting */
    @Required
    @Size(max = 10000)
    public String urlExpr;

    /** Boost expression to apply to matching documents */
    @Required
    @Size(max = 10000)
    public String boostExpr;

    /** Sort order for displaying boost configurations */
    @Required
    @Min(value = 0)

        public Integer getLoggingSearchMaxQueueSizeAsInteger() {
            return 1000;
        }

        @Override
        public Integer getLoggingClickMaxQueueSizeAsInteger() {
            return 1000;
        }

        @Override
        public Integer getQueryMaxLengthAsInteger() {
            return 1000;
        }

        @Override

      result[i] = allMatchingChars.charAt(random.nextInt(allMatchingChars.length()));
    }
    // Replace some of chars by non-matching.
    int remaining = (int) ((100 - percentMatching) * result.length / 100.0 + 0.5);
    while (remaining > 0) {
      char c = (char) random.nextInt();
      if (bitSet.get(c)) {
        int pos = random.nextInt(result.length);
        if (bitSet.get(result[pos])) {
          result[pos] = c;