int[] codes = (int[]) propMap.get(CRAWLER_FAILURE_URL_STATUS_CODES);
        if (codes == null) {
            codes = split(getCrawlerFailureUrlStatusCodes(), ",")
                    .get(stream -> stream.filter(StringUtil::isNotBlank).mapToInt(Integer::parseInt).toArray());
            propMap.put(CRAWLER_FAILURE_URL_STATUS_CODES, codes);
        }
        for (final int v : codes) {

    protected int connectionCheckInterval = 5; // sec

    /** Idle connection timeout in milliseconds */
    protected long idleConnectionTimeout = 60 * 1000L; // 1min

    /** Pattern for matching HTTP redirect status codes */
    protected Pattern redirectHttpStatusPattern = Pattern.compile("[3][0-9][0-9]");

    /** Whether to use robots.txt disallow rules */
    protected boolean useRobotsTxtDisallows = true;

# Whether to ignore robots meta tags during crawling.
crawler.ignore.robots.tags=false
# Whether to ignore content exceptions during crawling.
crawler.ignore.content.exception=true
# HTTP status codes considered as failure URLs.
crawler.failure.url.status.codes=404
# Interval (seconds) for system monitor during crawling.
crawler.system.monitor.interval=60
# Whether to ignore idle threads in hot thread monitoring.

      }
      return super.equals(obj);
    }

    @Override
    public int hashCode() {
      /*
       * The sum of the sums of the hash codes in each subset is just the sum of
       * each input element's hash code times the number of sets that element
       * appears in. Each element appears in exactly half of the 2^n sets, so:
       */

    boolean checkStatus(final ServerMessageBlock req, final ServerMessageBlock resp) throws SmbException {
        boolean cont = false;
        if (resp.getErrorCode() == 0x30002) {
            // if using DOS error codes this indicates a DFS referral
            resp.setErrorCode(NtStatus.NT_STATUS_PATH_NOT_COVERED);
        } else {
            resp.setErrorCode(SmbException.getStatusByCode(resp.getErrorCode()));
        }

   * hash functions. This is critical when the concurrent hash map uses power-of-two length hash
   * tables, that otherwise encounter collisions for hash codes that do not differ in lower or upper
   * bits.
   *
   * @param h hash code
   */
  static int rehash(int h) {
    // Spread bits to regularize both segment and index locations,