* governing permissions and limitations under the License.
 */
package org.codelibs.fess.exception;

/**
 * Exception thrown when an error occurs during job processing.
 * This exception is used to indicate problems that arise during
 * the execution or processing of jobs in the system.
 */
public class JobProcessingException extends FessSystemException {

    private static final long serialVersionUID = 1L;

    /**

import jakarta.annotation.PostConstruct;

/**
 * Helper class for document processing and manipulation in the Fess search system.
 * This class provides utilities for processing document content, titles, and digests,
 * handling text normalization, content extraction, and similar document hash encoding/decoding.
 * It also manages document processing requests and integrates with the crawler system.
 *
 */
public class DocumentHelper {

import jakarta.servlet.ServletResponse;
import jakarta.servlet.http.HttpServletRequest;
import jakarta.servlet.http.HttpServletResponse;

/**
 * Servlet filter for processing web API requests.
 * This filter intercepts HTTP requests and delegates processing to appropriate web API managers.
 */
public class WebApiFilter implements Filter {

    /**
     * Default constructor.
     */
    public WebApiFilter() {

    /**
     * Processes WEB-INF/lib directory and additionally scans WEB-INF/plugin for Fess plugins.
     * This method extends the standard processing to include plugin JAR files that contain
     * the "Fess-WebAppJar" manifest attribute.
     *
     * @throws LifecycleException if an error occurs during processing
     */
    @Override
    protected void processWebInfLib() throws LifecycleException {
        super.processWebInfLib();

├── security/    # Security & MessageDigest utilities
├── sql/         # SQL type utilities
├── stream/      # Stream utilities
├── text/        # Text processing (JSON, Tokenizer)
├── timer/       # Timer utilities
├── xml/         # XML processing
├── zip/         # ZIP file utilities
└── CoreLibConstants.java
src/test/java/   # Test classes (mirrors main structure)
```

## Development Commands

```bash

import jakarta.annotation.PostConstruct;

/**
 * Response processor implementation for the Fess search engine.
 * This processor extends DefaultResponseProcessor to provide additional
 * processing capabilities through the ingest framework, allowing for
 * custom data transformation and enrichment during the crawling process.
 *
 * <p>It supports pluggable ingesters that can modify the result data

     * @return The account ID.
     */
    public String getAccountId(final SID sid) {
        final int type = sid.getType();
        if (logger.isDebugEnabled()) {
            try {
                logger.debug("Processing SID: {} {} {}", type, sid, sid.toDisplayString());
            } catch (final Exception e) {
                // ignore
            }
        }
        final Integer id = fessConfig.getAvailableSmbSidType(type);

    TF_RETURN_WITH_CONTEXT_IF_ERROR(
        fn_body->graph.IsValidOutputTensor(node, idx),
        "Encountered while processing input ", i, " into function '", fn_name,
        "'");
    TF_RETURN_WITH_CONTEXT_IF_ERROR(ValidateNonRefOutput(node, idx),
                                    "Encountered while processing input ", i,
                                    " into function '", fn_name, "'");

    input_tensors->emplace_back(node, idx);

     * @return {@code true} if plugins should be processed, {@code false} otherwise.
     */
    boolean isProcessPlugins();

    /**
     * Controls the processing of plugin executions and configurations.
     *
     * @param processPlugins {@code true} to enable plugin processing, {@code false} otherwise.
     * @return This request, never {@code null}.
     */
    ModelBuildingRequest setProcessPlugins(boolean processPlugins);

   * visited twice if there is an edge connecting them. To avoid returning duplicate {@link
   * EndpointPair}s, we keep track of the nodes that we have visited. When processing endpoint
   * pairs, we skip if the "other node" is in the visited set, as shown below:
   *
   * <pre>
   * Nodes = {N1, N2, N3, N4}
   *    N2           __
   *   /  \         |  |
   * N1----N3      N4__|