assertEquals("1000bytes", MemoryUtil.byteCountToDisplaySize(1000L));
        assertEquals("1.024KB", MemoryUtil.byteCountToDisplaySize(FileUtils.ONE_KB));
        assertEquals("999.999KB", MemoryUtil.byteCountToDisplaySize(999_999L));
        assertEquals("1000KB", MemoryUtil.byteCountToDisplaySize(1000_000L));
        assertEquals("1.024MB", MemoryUtil.byteCountToDisplaySize(FileUtils.ONE_MB));

    @Min(0)
    @Max(100000)
    @ValidateTypeFailure
    public Integer purgeSuggestSearchLogDay;

    @Size(max = 1000)
    public String ldapProviderUrl;

    @Size(max = 1000)
    public String ldapSecurityPrincipal;

    @Size(max = 1000)
    public String ldapAdminSecurityPrincipal;

    @Size(max = 1000)
    public String ldapAdminSecurityCredentials;

		검색어의 첫 번째 문자는 사용할 수 없습니다.
	</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>

        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}}";

func BenchmarkCopyElim100(b *testing.B)    { benchmarkCopyElim(b, 100) }
func BenchmarkCopyElim1000(b *testing.B)   { benchmarkCopyElim(b, 1000) }
func BenchmarkCopyElim10000(b *testing.B)  { benchmarkCopyElim(b, 10000) }
func BenchmarkCopyElim100000(b *testing.B) { benchmarkCopyElim(b, 100000) }

func benchmarkCopyElim(b *testing.B, n int) {
	c := testConfig(b)

	values := make([]interface{}, 0, n+2)

public class CreateForm {

    @ValidateTypeFailure
    public Integer crudMode;

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

    @Required
    @Size(max = 10000)
    public String queries;

    @Size(max = 1000)
    public String virtualHost;

    @Size(max = 1000)
    public String createdBy;

    @ValidateTypeFailure
    public Long createdTime;

    public void initialize() {

      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) {
      final char c = (char) random.nextInt();
      if (bitSet.get(c)) {
        final int pos = random.nextInt(result.length);
        if (bitSet.get(result[pos])) {

      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) {
      final char c = (char) random.nextInt();
      if (bitSet.get(c)) {
        final int pos = random.nextInt(result.length);
        if (bitSet.get(result[pos])) {

        fooAuth.setServer("foo");
        fooAuth.setPort(1000);
        smbAuthenticationHolder.add(fooAuth);

        assertEquals(hogeAuth, smbAuthenticationHolder.get("smb://hoge/"));
        assertEquals(fugaAuth, smbAuthenticationHolder.get("smb://fuga/"));
        assertEquals(fooAuth, smbAuthenticationHolder.get("smb://foo:1000/"));
        assertEquals(hogeAuth, smbAuthenticationHolder.get("smb://hoge/text.txt"));

		Queries can be inclusive or exclusive of the upper and lower bounds.
		If you want to find documents whose content_length fields have values
		between 1000 and 10000, inclusive, you can enter:
		<pre>content_length:[1000 TO 10000]</pre>
		If you want to exclude the upper and lower bounds, use "{}".
	</dd>
	<dt>Boost</dt>
	<dd>
		To boost a term use the "^" symbol with a boost factor (a number) at