if (successfulHttpCodes == null) {
            return true;
        }
        final int httpStatusCode = responseData.getHttpStatusCode();
        for (final int code : successfulHttpCodes) {
            if (code == httpStatusCode) {
                return true;
            }
        }
        return false;
    }

    /**

            return minioClient.statObject(args);
        } catch (final ErrorResponseException e) {
            final String code = e.errorResponse().code();
            switch (code) {
            case "NoSuchBucket":
                throw new CrawlingAccessException("Bucket " + bucketName + " is not found.", e);
            case "NoSuchKey", "NoSuchObject":

    <_comment>Lua source code</_comment>
    <glob pattern="*.lua"/>
    <sub-class-of type="text/plain"/>
  </mime-type>

  <mime-type type="text/x-ml">
    <_comment>ML source code</_comment>
    <glob pattern="*.ml"/>
    <sub-class-of type="text/plain"/>
  </mime-type>

  <mime-type type="text/x-matlab">
    <_comment>Matlab source code</_comment>

     * @param weight the weight
     */
    public void setWeight(float weight) {
        this.weight = weight;
    }

    /**
     * Returns the hash code for this RequestData.
     * @return the hash code
     */
    @Override
    public int hashCode() {
        return Objects.hash(method, url, weight);
    }

    /**
     * Checks if this RequestData is equal to another object.

 * or a fixed number. It also allows filtering documents based on their size, using the {@code limitOfDocumentSize}
 * parameter.
 * </p>
 *
 * <p>
 * The reader uses a queue to buffer documents read from Elasticsearch, and it retries failed requests
 * up to a maximum number of times.
 * </p>
 *
 * <p>
 * <b>Usage:</b>
 * </p>
 * <pre>
 * {@code
 * Client client = // Obtain Elasticsearch client

                && regexMap.equals(rule.regexMap)) {
            return true;
        }
        return false;
    }

    /**
     * Returns the hash code for this RegexRule.
     * @return The hash code.
     */
    @Override
    public int hashCode() {
        int hash = regexMap.hashCode();
        if (defaultRule) {
            hash = hash * 31 + 1;
        }

 * as well as to iterate over them. It uses a {@link MemoryDataHelper} to store the data in memory.
 *
 * <p>
 * The class uses a static {@code idCount} to generate unique IDs for each access result.
 * The {@code idCountLock} object is used to synchronize access to the {@code idCount} variable,
 * ensuring that IDs are generated in a thread-safe manner.
 * </p>
 *
 * <p>

    public void addClient(final String regex, final CrawlerClient client, final int pos) {
        factory.addClient(regex, client, pos);
    }

    /**
     * Returns the hash code of the wrapped factory.
     * @return The hash code.
     */
    @Override
    public int hashCode() {
        return factory.hashCode();
    }

    /**
     * Adds a list of clients to the wrapped factory.

    /**
     * Constructs a new {@code CrawlerSystemException} with the specified detail message and cause.
     *
     * @param message the detail message (which is saved for later retrieval by the {@link #getMessage()} method).
     * @param cause the cause (which is saved for later retrieval by the {@link #getCause()} method).

     */
    void setStatus(Integer status);

    /**
     * Returns the HTTP status code of the access result.
     *
     * @return the HTTP status code
     */
    Integer getHttpStatusCode();

    /**
     * Sets the HTTP status code of the access result.
     *
     * @param httpStatusCode the HTTP status code
     */
    void setHttpStatusCode(Integer httpStatusCode);

    /**