import java.util.Collection;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import org.jspecify.annotations.Nullable;

/**
 * Implementation of {@code Multimap} that uses an {@code ArrayList} to store the values for a given
 * key. A {@link HashMap} associates each key with an {@link ArrayList} of values.
 *
 * <p>When iterating through the collections supplied by this class, the ordering of values for a

            final ZipEntry entry = new ZipEntry(id + "/fess_config.properties");
            try {
                zos.putNextEntry(entry);
                prop.store(zos, getHostInfo());
            } catch (final IOException e) {
                logger.warn("Failed to access fess_config.properties.", e);
            }
        }
    }

    /**

        // Default constructor
    }

    /** Logger instance for this class. */
    private static final Logger logger = LogManager.getLogger(CrawlerStatsHelper.class);

    /** Key used to store the begin timestamp in statistics objects. */
    private static final String BEGIN_KEY = "begin";

    /** Logger instance specifically for outputting crawler statistics. */
    protected Logger statsLogger = null;

        validate(form, messages -> {}, this::asEditHtml);
        verifyToken(this::asEditHtml);
        getWebConfig(form).ifPresent(entity -> {
            try {
                webConfigService.store(entity);
                saveInfo(messages -> messages.addSuccessCrudCreateCrudTable(GLOBAL));
            } catch (final Exception e) {
                logger.warn("Failed to process a request.", e);

#### Figure 2 - KMS key hierarchy

```

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

/**
 * {@code ObjectCountLinkedHashMap} is a subclass of {@code ObjectCountHashMap} with insertion
 * iteration order, and uses arrays to store key objects and count values. Comparing to using a
 * traditional {@code LinkedHashMap} implementation which stores keys and count values as map
 * entries, {@code ObjectCountLinkedHashMap} minimizes object allocation and reduces memory

        InetAddress dummy = mock(InetAddress.class);
        // Act
        UniAddress ua = new UniAddress(dummy);
        // Assert
        assertSame(dummy, ua.getAddress(), "constructor should store the supplied address");
    }

    @Test
    void constructorRejectsNull() {
        // Expect constructor to throw IllegalArgumentException when passed null

    /**
     * Processes a document map for datastore operations.
     * Default implementation delegates to the basic process method.
     *
     * @param target the document data to process
     * @param params the data store parameters
     * @return the processed document data
     */
    public Map<String, Object> process(final Map<String, Object> target, final DataStoreParams params) {
        return process(target);
    }

    private DfFinalTimeZoneProvider originalProvider;

    @Override
    public void setUp() throws Exception {
        super.setUp();
        curtainBeforeHook = new FessCurtainBeforeHook();
        // Store original timezone settings
        originalTimeZone = TimeZone.getDefault();
        originalProvider = getDBFluteSystemTimeZoneProvider();
    }

    @Override
    public void tearDown() throws Exception {

        verifyToken(this::asEditHtml);
        createStemmerOverrideItem(form, this::asEditHtml).ifPresent(entity -> {
            try {
                stemmerOverrideService.store(form.dictId, entity);
                saveInfo(messages -> messages.addSuccessCrudCreateCrudTable(GLOBAL));
            } catch (final Exception e) {
                logger.warn("Failed to process a request.", e);