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

  /**
   * Compares the two specified {@code long} values. The sign of the value returned is the same as

  private static final int ARRAY_MASK = 0x0ffff;
  private static final Random randomSource = new Random(314159265358979L);
  private static final long[] longs = new long[ARRAY_SIZE];
  private static final long[] divisors = new long[ARRAY_SIZE];
  private static final String[] decimalStrings = new String[ARRAY_SIZE];
  private static final String[] binaryStrings = new String[ARRAY_SIZE];

    // was some asymmetry so that the initial v0 and v1 differ from v2 and v3.
    private long v0 = 0x736f6d6570736575L;
    private long v1 = 0x646f72616e646f6dL;
    private long v2 = 0x6c7967656e657261L;
    private long v3 = 0x7465646279746573L;

    // The number of bytes in the input.
    private long b = 0;

    // The final 64-bit chunk includes the last 0 through 7 bytes of m followed by null bytes

      doubleInLongRange[i] = randomDouble(Long.SIZE - 2);
      positiveDoubles[i] = randomPositiveDouble();
    }
  }

  @Benchmark
  int roundToInt(int reps) {
    int tmp = 0;
    for (int i = 0; i < reps; i++) {
      int j = i & ARRAY_MASK;
      tmp += DoubleMath.roundToInt(doubleInIntRange[j], mode);
    }
    return tmp;
  }

  @Benchmark
  long roundToLong(int reps) {
    long tmp = 0;

    @Override
    public void offerAll(final String sessionId, final List<UrlQueueImpl<Long>> newUrlQueueList) {
        final Queue<UrlQueueImpl<Long>> urlQueueList = dataHelper.getUrlQueueList(sessionId);
        synchronized (urlQueueList) {
            final List<UrlQueueImpl<Long>> targetList = new ArrayList<>();
            for (final UrlQueueImpl<Long> urlQueue : newUrlQueueList) {
                if (isNewUrl(urlQueue, urlQueueList)) {

      @Override
      public long getLongLittleEndian(byte[] array, int offset) {
        long bigEndian = theUnsafe.getLong(array, (long) offset + BYTE_ARRAY_BASE_OFFSET);
        // The hardware is big-endian, so we need to reverse the order of the bytes.
        return Long.reverseBytes(bigEndian);
      }

      @Override
      public void putLongLittleEndian(byte[] array, int offset, long value) {

    }

    /**
     * Returns the size of the file.
     *
     * @param channel
     *            The file channel. Must not be {@literal null}.
     * @return The size of the file.
     */
    public static long size(final FileChannel channel) {
        assertArgumentNotNull("channel", channel);

        try {
            return channel.size();
        } catch (final IOException e) {
            throw new IORuntimeException(e);

        private final long bufferOverflowsPrevented;
        private final long integerOverflowsPrevented;

        public ValidationStats(long totalValidations, long failedValidations, long bufferOverflowsPrevented,
                long integerOverflowsPrevented) {
            this.totalValidations = totalValidations;
            this.failedValidations = failedValidations;
            this.bufferOverflowsPrevented = bufferOverflowsPrevented;

      }

      var minFreshMillis: Long = 0
      if (requestCaching.minFreshSeconds != -1) {
        minFreshMillis = SECONDS.toMillis(requestCaching.minFreshSeconds.toLong())
      }

      var maxStaleMillis: Long = 0
      if (!responseCaching.mustRevalidate && requestCaching.maxStaleSeconds != -1) {

          },
          "createdTime" : {
            "type" : "long"
          },
          "queries" : {
            "type" : "keyword"
          },
          "term" : {
            "type" : "keyword"
          },
          "updatedBy" : {
            "type" : "keyword"
          },
          "updatedTime" : {
            "type" : "long"
          },
          "virtualHost" : {
            "type" : "keyword"