double[] toDoubleArray() {
      return Arrays.copyOfRange(array, start, end);
    }

    @GwtIncompatible @J2ktIncompatible private static final long serialVersionUID = 0;
  }

  /**
   * This is adapted from the regex suggested by {@link Double#valueOf(String)} for prevalidating
   * inputs. All valid inputs must pass this regex, but it's semantically fine if not all inputs

   *     is not precisely representable as a {@code double}
   * @since 30.0
   */
  @GwtIncompatible
  public static double roundToDouble(long x, RoundingMode mode) {
    // Logic adapted from ToDoubleRounder.
    double roundArbitrarily = (double) x;
    long roundArbitrarilyAsLong = (long) roundArbitrarily;
    int cmpXToRoundArbitrarily;

    if (roundArbitrarilyAsLong == Long.MAX_VALUE) {

quarkus/extensions/mutiny/runtime/pom.xml
	quarkus/core/runtime/pom.xml
	quarkus/extensions/smallrye-context-propagation/runtime/pom.xml
	quarkus/test-framework/junit5-internal/pom.xml
quarkus/extensions/netty-loom-adaptor/runtime/pom.xml
	quarkus/core/runtime/pom.xml
	quarkus/extensions/netty/runtime/pom.xml
	quarkus/extensions/arc/runtime/pom.xml
quarkus/extensions/resteasy-classic/rest-client-jsonb/deployment/pom.xml

### Instrumentation

In v1.9 we focused on improving stability of the components owned by the SIG, including Heapster, Custom Metrics API adapters for Prometheus, and Stackdriver.

### Network

of m. // // It is an error if either a or m is zero, or if they are both even. func extendedGCD(a, m *Nat) (u, A *Nat, err error) { // This is the extended binary GCD algorithm described in the Handbook of // Applied Cryptography, Algorithm 14.61, adapted by BoringSSL to bound // coefficients and avoid negative numbers. For more details and proof of // correctness, see https://github.com/mit-plv/fiat-crypto/pull/333/files. // // Following the proof linked in the PR above, the changes are: // // 1....

of m. // // It is an error if either a or m is zero, or if they are both even. func extendedGCD(a, m *Nat) (u, A *Nat, err error) { // This is the extended binary GCD algorithm described in the Handbook of // Applied Cryptography, Algorithm 14.61, adapted by BoringSSL to bound // coefficients and avoid negative numbers. For more details and proof of // correctness, see https://github.com/mit-plv/fiat-crypto/pull/333/files. // // Following the proof linked in the PR above, the changes are: // // 1....