return this.ttl;
    }

    /**
     * {@inheritDoc}
     *
     * @see java.lang.Object#hashCode()
     */
    @Override
    public int hashCode() {
        return Objects.hash(this.server, this.share, this.path, this.pathConsumed);
    }

    /**
     * {@inheritDoc}
     *
     * @see java.lang.Object#equals(java.lang.Object)
     */
    @Override

      --enable-plugin \
      --enable-shared \
      --enable-threads=posix \
      --with-default-libstdcxx-abi=${LIBSTDCXX_ABI} \
      --with-gcc-major-version-only \
      --with-linker-hash-style="gnu" \
      --with-tune="generic" \
      && \
    make -j 42 && \
    make install


# Create the devtoolset libstdc++ linkerscript that links dynamically against

            return o == this || o instanceof PathSource that && Objects.equals(path, that.path);
        }

        @Override
        public int hashCode() {
            return Objects.hash(path);
        }

        @Override
        public String toString() {
            return getClass().getSimpleName() + "[location='" + location + "', path=" + path + ']';
        }
    }

    /**

  boolean equals(@Nullable Object object);

  /**
   * Returns the hash code for this multiset. This is defined as the sum of
   *
   * {@snippet :
   * ((element == null) ? 0 : element.hashCode()) ^ count(element)
   * }
   *
   * <p>over all distinct elements in the multiset. It follows that a multiset and its entry set
   * always have the same hash code.
   */
  @Override
  int hashCode();

  /**

          + ")";
    }
  }

  /**
   * Returns a supplier that caches the instance supplied by the delegate and removes the cached
   * value after the specified time has passed. Subsequent calls to {@code get()} return the cached
   * value if the expiration time has not passed. After the expiration time, a new value is
   * retrieved, cached, and returned. See: <a
   * href="http://en.wikipedia.org/wiki/Memoization">memoization</a>
   *

import org.opensearch.index.query.QueryBuilders;
import org.opensearch.search.SearchHit;
import org.opensearch.search.SearchHits;
import org.opensearch.search.sort.SortBuilder;

import com.google.common.hash.HashFunction;
import com.google.common.hash.Hashing;

import jakarta.annotation.Resource;

/**
 * Abstract base class for crawler services that interact with OpenSearch.
 *
 * @author shinsuke
 *
 */

        - com.google.common.cache
        - com.google.common.collect
        - com.google.common.escape
        - com.google.common.eventbus
        - com.google.common.graph
        - com.google.common.hash
        - com.google.common.io
        - com.google.common.math
        - com.google.common.net
        - com.google.common.primitives
        - com.google.common.reflect
        - com.google.common.testing

            && typeSignature.equals(other.typeSignature);
      }

      return false;
    }

    @Override
    public int hashCode() {
      return Objects.hash(name, parameterTypes, typeSignature);
    }

    @Override
    public String toString() {
      return rootLocaleFormat("%s%s(%s)", typeSignature, name, getTypesString(parameterTypes));
    }

    @Override

   */
  public static Comparator<Boolean> falseFirst() {
    return BooleanComparator.FALSE_FIRST;
  }

  /**
   * Returns a hash code for {@code value}; obsolete alternative to {@link
   * Boolean#hashCode(boolean)}.
   *
   * @param value a primitive {@code boolean} value
   * @return a hash code for the value
   */
  @InlineMe(replacement = "Boolean.hashCode(value)")
  public static int hashCode(boolean value) {

   */
  public static Comparator<Boolean> falseFirst() {
    return BooleanComparator.FALSE_FIRST;
  }

  /**
   * Returns a hash code for {@code value}; obsolete alternative to {@link
   * Boolean#hashCode(boolean)}.
   *
   * @param value a primitive {@code boolean} value
   * @return a hash code for the value
   */
  @InlineMe(replacement = "Boolean.hashCode(value)")
  public static int hashCode(boolean value) {