labels.maintenance_title_configuration=Wartung
labels.number_of_shards_for_doc=Anzahl der Shards
labels.auto_expand_replicas_for_doc=Replikate automatisch erweitern
labels.clear_crawler_index=Crawler-Index
labels.clear_crawler_index_button=Crawler-Index löschen
labels.diagnostic_logs=Diagnose
labels.download_diagnostic_logs_button=Protokolle herunterladen
labels.reload_doc_index=Dokumentenindex neu laden
labels.reload_doc_index_button=Neu laden

{
  "settings": {
    "index": {
      "codec": "${fess.index.codec}",
      "refresh_interval": "1s",
      "number_of_shards": "${fess.index.number_of_shards}",
      "number_of_replicas": 0,
      "auto_expand_replicas": "${fess.index.auto_expand_replicas}"
    },
    "analysis": {
      "char_filter": {
        "mapping_fa_filter": {
          "type": "mapping",

									<c:forEach var="item" varStatus="s" items="${popularWords}">
										<c:if test="${s.index < 3}">
											<la:link
												href="/search?q=${f:u(item)}${fe:facetQuery()}${fe:geoQuery()}">${f:h(item)}</la:link>
										</c:if>
										<c:if test="${3 <= s.index}">
											<la:link styleClass="d-none d-sm-inline-block"

									<c:forEach var="item" varStatus="s" items="${popularWords}">
										<c:if test="${s.index < 3}">
											<la:link
												href="/search?q=${f:u(item)}${fe:facetQuery()}${fe:geoQuery()}">${f:h(item)}</la:link>
										</c:if>
										<c:if test="${3 <= s.index}">
											<la:link styleClass="d-none d-sm-inline-block"

Shinsuke Sugaya <******@****.***> 1737202147 +0900

Shinsuke Sugaya <******@****.***> 1737202147 +0900

Shinsuke Sugaya <******@****.***> 1737202147 +0900

Shinsuke Sugaya <******@****.***> 1737202147 +0900

    // Search for misses.
    assertEquals(-1, binarySearch(0, 6) { index -> 0.compareTo(table[index]) })
    assertEquals(-2, binarySearch(0, 6) { index -> 2.compareTo(table[index]) })
    assertEquals(-3, binarySearch(0, 6) { index -> 4.compareTo(table[index]) })
    assertEquals(-4, binarySearch(0, 6) { index -> 6.compareTo(table[index]) })
    assertEquals(-5, binarySearch(0, 6) { index -> 8.compareTo(table[index]) })

    int startingIndex = smear(c) & mask;
    int index = startingIndex;
    do {
      if (table[index] == 0) { // Check for empty.
        return false;
      } else if (table[index] == c) { // Check for match.
        return true;
      } else { // Linear probing.
        index = (index + 1) & mask;
      }
      // Check to see if we wrapped around the whole table.
    } while (index != startingIndex);
    return false;
  }