labels.updatedTime=Updated Time
labels.urls=URLs
labels.userAgent=User Agent
labels.username=Username
labels.value=Value
labels.versionNo=Version No
labels.cronExpression=Schedule
labels.dayForCleanup=Delete documents older than specified days
labels.crawlingThreadCount=Concurrent Crawling Count
labels.boost=Boost
labels.crawlingConfigName=Name
labels.crawlingConfigPath=Path to Crawl
labels.processType=Process Type
labels.parameters=Parameters

 * </tr>
 * <tr>
 * <th>{@link String}</th>
 * <td>characters</td>
 * <td>characters</td>
 * <td>characters</td>
 * <td>&times;</td>
 * </tr>
 * </table>
 * <p>
 * Methods that take {@link InputStream}/{@link OutputStream}/{@link Reader}/{@link Writer} as arguments do not call {@link Closeable#close()} on the arguments. The caller is responsible for closing them.
 * </p>
 * <p>

// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//

さらに、並列性と非同期性を同時に活用できるため、テストされた多くの NodeJS フレームワークより高い性能を発揮し、C に近いコンパイル言語である Go と同等の性能になります [(すべて Starlette のおかげです)](https://www.techempower.com/benchmarks/#section=data-r17&hw=ph&test=query&l=zijmkf-1)。

### 並行処理は並列処理より優れている？ { #is-concurrency-better-than-parallelism }

いいえ！それがこの話の教訓ではありません。

並行処理は並列処理とは異なります。そして多くの待ち時間を伴う**特定の**シナリオでは優れています。そのため、一般に Web アプリ開発では並列処理よりはるかに適しています。しかし、すべてに対して最良というわけではありません。

バランスを取るために、次の短い物語を想像してください。

> 大きくて汚れた家を掃除しなければならない。

        return Iterators.forArray(1, 2, 3);
      }
    }.test();
  }

  /*
   * TODO(cpovirk): Test forArray with ListIteratorTester (not just IteratorTester), including with
   * a start position other than 0.
   */

  public void testForEnumerationEmpty() {
    Enumeration<Integer> enumer = enumerate();
    Iterator<Integer> iter = Iterators.forEnumeration(enumer);

    assertFalse(iter.hasNext());

### 동시성이 병렬성보다 더 나은가요? { #is-concurrency-better-than-parallelism }

아니요! 그게 이 이야기의 교훈은 아닙니다.

동시성은 병렬성과 다릅니다. 그리고 많은 기다림이 포함되는 **특정한** 시나리오에서는 더 낫습니다. 그 때문에 웹 애플리케이션 개발에서는 일반적으로 병렬성보다 훨씬 더 낫습니다. 하지만 모든 것에 해당하진 않습니다.

그래서 균형을 맞추기 위해, 다음의 짧은 이야기를 상상해보세요:

fineProperty(e,s,i.get?i:{enumerable:!0,get:()=>t[s]})}return e.default=t,Object.freeze(e)}const s=e(t),i=new Map,n={set(t,e,s){i.has(t)||i.set(t,new Map);const n=i.get(t);n.has(e)||0===n.size?n.set(e,s):console.error(`Bootstrap doesn't allow more than one instance per element. Bound instance: ${Array.from(n.keys())[0]}.`)},get:(t,e)=>i.has(t)&&i.get(t).get(e)||null,remove(t,e){if(!i.has(t))return;const s=i.get(t);s.delete(e),0===s.size&&i.delete(t)}},o="transitionend",r=t=>(t&&window.CSS&&windo...

    }

    /**
     * Creates aliases for a newly created index.
     *
     * @param index            the index configuration name
     * @param createdIndexName the actual index name that was created
     */
    protected void createAlias(final String index, final String createdIndexName) {
        final FessConfig fessConfig = ComponentUtil.getFessConfig();
        // alias

// Copyright 2022 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

#include "../../../../../runtime/textflag.h"

TEXT asmtest(SB),DUPOK|NOSPLIT,$0
lable1:
	BFPT	1(PC)				// 00050048
	BFPT	lable1		// BFPT 2	// 1ffdff4b
	BFPT	FCC0, lable1	// BFPT FCC0, 2	// 1ff9ff4b
	BFPT	FCC7, lable1	// BFPT FCC7, 2	// fff5ff4b

lable2:
	BFPF	1(PC)				// 00040048

// it under the terms of the GNU Affero General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
// GNU Affero General Public License for more details.
//