}

    /**
     * Sets the exception that occurred while accessing the content.
     *
     * @param e the exception to set.
     */
    public void setContentException(final Exception e) {
        contentException = e;
    }

    /**
     * Gets the exception that occurred while accessing the content, if any.
     *
     * @return the exception, or null if no exception occurred.

 *
 * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as
 * 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);

 *
 * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as
 * 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);
 * }

 * including retrieving, storing, and deleting stopwords.
 */
public class StopwordsService {
    /** The dictionary manager for accessing dictionary files. */
    @Resource
    protected DictionaryManager dictionaryManager;

    /** The Fess configuration for accessing system settings. */
    @Resource
    protected FessConfig fessConfig;

    /**
     * Constructs a new stopwords service.
     */

 * including retrieving, storing, and deleting synonyms.
 */
public class SynonymService {
    /** The dictionary manager for accessing dictionary files. */
    @Resource
    protected DictionaryManager dictionaryManager;

    /** The Fess configuration for accessing system settings. */
    @Resource
    protected FessConfig fessConfig;

    /**
     * Constructs a new synonym service.
     */

 *
 * <p>This interface is meant to be used as the type of a parameter to graph algorithms (such as
 * 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);
 * }

After that, all of the processing logic is the same.

But because of our changes in `GzipRequest.body`, the request body will be automatically decompressed when it is loaded by **FastAPI** when needed.

## Accessing the request body in an exception handler { #accessing-the-request-body-in-an-exception-handler }

/// tip

// the arena is freed. Accessing the value after free may result in a fault,
// but this fault is also not guaranteed.
func New[T any](a *Arena) *T {
	return runtime_arena_arena_New(a.a, reflectlite.TypeOf((*T)(nil))).(*T)
}

// MakeSlice creates a new []T with the provided capacity and length. The []T must
// not be used after the arena is freed. Accessing the underlying storage of the

/**
 * CrawlingAccessException is an exception class that represents an issue encountered while accessing a resource during the crawling process.
 * It extends CrawlerSystemException and provides functionality to set and check the log level for the exception.
 *
 * <p>
 * This exception can be thrown when there are problems accessing URLs, files, or any other resources needed for crawling.

 */
package org.codelibs.core.beans.util;

import java.util.LinkedHashMap;

import org.codelibs.core.exception.IllegalKeyOfBeanMapException;

/**
 * A map with String keys that throws an exception when accessing (get) a non-existent key.
 *
 * @author higa
 */
public class BeanMap extends LinkedHashMap<String, Object> {

    private static final long serialVersionUID = 1;

    /**