@Override
    public long distance(Integer start, Integer end) {
      return (long) end - start;
    }

    @Override
    public Integer minValue() {
      return Integer.MIN_VALUE;
    }

    @Override
    public Integer maxValue() {
      return Integer.MAX_VALUE;
    }

    private Object readResolve() {
      return INSTANCE;
    }

    @Override
    public String toString() {

     * @return True if there are errors, false otherwise.
     */
    public boolean hasError() {
        return hasError;
    }

    /**
     * Returns the list of errors.
     * @return The list of errors.
     */
    public List<Throwable> getErrors() {
        return errors;
    }

    /**
     * Returns the time taken for the operation.
     * @return The time taken in milliseconds.

    return Math.min(Math.max(value, min), max);
  }

  /**
   * Returns the values from each provided array combined into a single array. For example, {@code
   * concat(new long[] {a, b}, new long[] {}, new long[] {c}} returns the array {@code {a, b, c}}.
   *
   * @param arrays zero or more {@code long} arrays

  }

  /** Returns a hash function implementing the SHA-512 algorithm (512 hash bits). */
  public static HashFunction sha512() {
    return Sha512Holder.SHA_512;
  }

  private static final class Sha512Holder {
    static final HashFunction SHA_512 =
        new MessageDigestHashFunction("SHA-512", "Hashing.sha512()");
  }

  /**

    /**
     * Returns the indices timeout.
     * @return The indices timeout.
     */
    public String getIndicesTimeout() {
        return timeoutSettings.indicesTimeout;
    }

    /**
     * Returns the bulk timeout.
     * @return The bulk timeout.
     */
    public String getBulkTimeout() {
        return timeoutSettings.bulkTimeout;
    }

    /**
     * Returns the cluster timeout.

        }
        return getLastEntry().element;
    }

    /**
     * Returns the first entry.
     *
     * @return the first entry
     */
    public Entry getFirstEntry() {
        if (isEmpty()) {
            return null;
        }
        return header.next;
    }

    /**
     * Returns the last entry.
     *
     * @return the last entry
     */

    arraycopy(src, offset, dst, 0, len);
    return dst;
  }

  /**
   * Returns an array containing all of the elements in the specified collection. This method
   * returns the elements in the order they are returned by the collection's iterator. The returned
   * array is "safe" in that no references to it are maintained by the collection. The caller is
   * thus free to modify the returned array.
   *

 */
internal interface DerAdapter<T> {
  /** Returns true if this adapter can read [header] in a choice. */
  fun matches(header: DerHeader): Boolean

  /**
   * Returns a value from this adapter.
   *
   * This must always return a value, though it doesn't necessarily need to consume data from
   * [reader]. For example, if the reader's peeked tag isn't readable by this adapter, it may return
   * a default value.
   *

func make(t Type, size ...IntegerType) Type

// The max built-in function returns the largest value of a fixed number of
// arguments of [cmp.Ordered] types. There must be at least one argument.
// If T is a floating-point type and any of the arguments are NaNs,
// max will return NaN.
func max[T cmp.Ordered](x T, y ...T) T

// The min built-in function returns the smallest value of a fixed number of

     *
     * @param <E> the element type of {@link HashSet}
     * @param c the collection of elements to be placed in the set
     * @return a new instance of {@link HashSet}
     * @see HashSet#HashSet()
     */
    public static <E> HashSet<E> newHashSet(final Collection<? extends E> c) {
        return new HashSet<>(c);
    }

    /**