import java.util.regex.Pattern;

import org.codelibs.fess.opensearch.config.bsbhv.BsDuplicateHostBhv;
import org.codelibs.fess.util.ComponentUtil;

/**
 * @author FreeGen
 */
public class DuplicateHostBhv extends BsDuplicateHostBhv {
    private String indexName = null;

    @Override
    protected String asEsIndex() {
        if (indexName == null) {

import java.util.regex.Pattern;

import org.codelibs.fess.opensearch.config.bsbhv.BsRequestHeaderBhv;
import org.codelibs.fess.util.ComponentUtil;

/**
 * @author FreeGen
 */
public class RequestHeaderBhv extends BsRequestHeaderBhv {
    private String indexName = null;

    @Override
    protected String asEsIndex() {
        if (indexName == null) {

 * parameters.
 *
 * @param <T> the type created by this generator.
 * @author George van den Driessche
 */
@GwtCompatible
@NullMarked
public interface TestSubjectGenerator<T extends @Nullable Object> {
  T createTestSubject();

import org.jspecify.annotations.NullMarked;
import org.jspecify.annotations.Nullable;

/**
 * Creates queues, containing sample elements, to be tested.
 *
 * @author Jared Levy
 */
@GwtCompatible
@NullMarked
public interface TestQueueGenerator<E extends @Nullable Object> extends TestCollectionGenerator<E> {
  @Override
  Queue<E> create(Object... elements);

import com.google.common.base.Predicate;
import com.google.common.collect.FilteredCollectionsTestUtil.AbstractFilteredNavigableSetTest;
import java.util.NavigableSet;
import org.jspecify.annotations.NullUnmarked;

@NullUnmarked
public final class SetsFilterNavigableSetTest extends AbstractFilteredNavigableSetTest {
  @Override
  NavigableSet<Integer> createUnfiltered(Iterable<Integer> contents) {
    return Sets.newTreeSet(contents);
  }

  @Override

     * Default constructor for creating a new SearchLogService instance.
     */
    public SearchLogService() {
        // Default constructor
    }

    /**
     * Deletes search logs older than the specified number of days.
     *
     * @param days Number of days to keep (logs older than this will be deleted)
     */
    public void deleteBefore(final int days) {
        searchLogBhv.queryDelete(cb -> {

        private final String stdout;
        private final String stderr;

        public ExecResult(String[] args, int code, String stdout, String stderr) {
            this.args = args;
            this.code = code;
            this.stdout = stdout;
            this.stderr = stderr;
        }

        @Override
        public String toString() {

 * topological sort) that only need a way of accessing the predecessors of a node in a graph.
 *
 * <h3>Usage</h3>
 *
 * Given an algorithm, for example:
 *
 * {@snippet :
 * public <N> someGraphAlgorithm(N startNode, PredecessorsFunction<N> predecessorsFunction);
 * }
 *
 * you will invoke it depending on the graph representation you're using.
 *

 * breadth first traversal) that only need a way of accessing the successors of a node in a graph.
 *
 * <h3>Usage</h3>
 *
 * Given an algorithm, for example:
 *
 * {@snippet :
 * public <N> someGraphAlgorithm(N startNode, SuccessorsFunction<N> successorsFunction);
 * }
 *
 * you will invoke it depending on the graph representation you're using.
 *

import com.google.common.annotations.GwtCompatible;
import junit.framework.TestCase;
import org.jspecify.annotations.NullMarked;

/** Tests for {@code Hashing}. */
@GwtCompatible
@NullMarked
public class HashingTest extends TestCase {
  public void testSmear() {
    assertEquals(1459320713, smear(754102528));
    assertEquals(-160560296, smear(1234567890));
    assertEquals(-1017931171, smear(1));