public String paths;

    /** Number of threads for crawling */
    public String numOfThread;

    /** Interval time between crawling operations */
    public String intervalTime;

    /** Boost value for search ranking */
    public String boost;

    /** Availability status of the configuration */
    public String available;

    /** Sort order for the configuration */
    public String sortOrder;

        sourceRoots.asSequence()
            .map { it.resolve(sourceFilePath) to it }
            .firstOrNull { it.first.isFile }
            ?: error("Source file '$sourceFilePath' not found, searched in source roots:\n  - ${sourceRoots.joinToString("\n  - ")}")

    private
    val KtFile.normalizedPath: String?
        get() = virtualFile.canonicalPath?.let { normaliseFileSeparators(it) }

    private

.form-control-sidebar ~ .input-group-append,\n.sidebar-collapse .sidebar-search-results {\n  display: none;\n}\n\n[data-widget=\"sidebar-search\"] input[type=\"search\"]::-ms-clear, [data-widget=\"sidebar-search\"] input[type=\"search\"]::-ms-reveal {\n  display: none;\n  width: 0;\n  height: 0;\n}\n\n[data-widget=\"sidebar-search\"] input[type=\"search\"]::-webkit-search-cancel-button, [data-widget=\"sidebar-search\"] input[type=\"search\"]::-webkit-search-decoration, [data-widget=\"sidebar-search\"] input[type...

  static double getMinValue(double[] array, int from) {
    // This is basically a copy of com.google.math.Rank#getMinValue, with a small change in the
    // method signature: we always search to the end of the array.
    int min = from;
    for (int i = from + 1; i < array.length; i++) {
      if (array[min] > array[i]) {
        min = i;
      }
    }
    return array[min];
  }

    padding: 0;
    border: 1px solid #dfe1e6;
    border-radius: 6px;
    box-shadow: 0 4px 8px -2px rgba(9, 30, 66, 0.25), 0 0 1px rgba(9, 30, 66, 0.31);
}

.filter-search-wrapper {
    padding: 0.5rem;
    border-bottom: 1px solid #ebecf0;
}

.filter-search-input {
    font-size: 0.8125rem;
}

.filter-dropdown-list {
    max-height: 240px;
    overflow-y: auto;
    padding: 0.25rem 0;
}

import org.opensearch.action.admin.indices.settings.get.GetSettingsResponse;
import org.opensearch.action.search.SearchResponse;
import org.opensearch.common.settings.Settings;
import org.opensearch.common.xcontent.XContentType;
import org.opensearch.index.query.QueryBuilders;
import org.opensearch.search.SearchHit;
import org.opensearch.transport.client.Client;

/**

labels.sidebar.placeholder_search=Suchen...
labels.menu_plugin=Plugin
labels.menu_storage=Speicher
labels.sidebar.menu=Menü
labels.footer.copyright=&copy;2026 <a href="https://github.com/codelibs">CodeLibs-Projekt</a>.
labels.search=Suchen
labels.similar_doc_result_status=Ähnliche Ergebnisse werden angezeigt.
labels.search_result_status=Ergebnisse <b>{2}</b> - <b>{3}</b> von <b>{1}</b> für <b>{0}</b>

 * including tracking information for optimistic locking and audit trails.
 * Key matches are used to promote specific documents when certain keywords are searched.
 */
public class EditForm extends CreateForm {

    /**
     * Creates a new EditForm instance.
     */
    public EditForm() {
        super();
    }

    /**

    // ===================================================================================
    //                                                                           Attribute
    //

    /**
     * Search engine client for performing maintenance operations on indices.
     */
    @Resource
    protected SearchEngineClient searchEngineClient;

   * i, i + target.length)} contains exactly the same elements as {@code target}.
   *
   * @param array the array to search for the sequence {@code target}
   * @param target the array to search for as a sub-sequence of {@code array}
   */
  public static int indexOf(byte[] array, byte[] target) {
    checkNotNull(array, "array");
    checkNotNull(target, "target");