long timeEnd = measureEqualsTime(baseAuth, endAuth, TIMING_ITERATIONS);

            // Calculate relative timing differences
            double maxTime = Math.max(Math.max(timeStart, timeMiddle), timeEnd);
            double minTime = Math.min(Math.min(timeStart, timeMiddle), timeEnd);
            double timingRatio = (maxTime - minTime) / maxTime;

            // Timing differences should be minimal (within tolerance)

                if (retryDelayMs > 0) {
                    // Safe calculation preventing overflow: use Math.max(0, retryCount - 1) and limit shift
                    int safeShift = Math.min(MAX_BACKOFF_SHIFT, Math.max(0, retryCount - 1));
                    long multiplier = 1L << safeShift;
                    // Check for potential overflow before multiplication

import static java.lang.Double.isNaN;
import static java.lang.Double.longBitsToDouble;
import static java.lang.Math.getExponent;
import static java.lang.Math.max;

import com.google.common.annotations.GwtIncompatible;
import com.google.common.annotations.VisibleForTesting;
import java.math.BigInteger;

/**
 * Utilities for {@code double} primitives.
 *
 * @author Louis Wasserman
 */
@GwtIncompatible

      String unused = interner.intern(Double.toHexString(Math.random()));
    }
    return reps;
  }

  @CanIgnoreReturnValue
  @Benchmark
  int strongInterner(int reps) {
    Interner<String> interner = Interners.newStrongInterner();
    for (int i = 0; i < reps; i++) {
      String unused = interner.intern(Double.toHexString(Math.random()));
    }
    return reps;
  }

  @CanIgnoreReturnValue

      BigInteger v = BigInteger.valueOf(from);
      // Math.sin is very slow for values outside 4*pi
      // Need to take absolute value to avoid inverting the value.
      for (double i = 0; i < 100; i += 20) {
        v =
            v.add(
                v.multiply(
                    BigInteger.valueOf(((Double) Math.abs(Math.sin(i) * 10.0)).longValue())));
      }
      return v;
    }
  }

 * the License.
 */

package com.google.common.math;

import com.google.common.annotations.GwtCompatible;
import com.google.errorprone.annotations.CanIgnoreReturnValue;
import java.math.BigInteger;
import java.math.RoundingMode;

/**
 * A collection of preconditions for math functions.
 *
 * @author Louis Wasserman
 */
@GwtCompatible
final class MathPreconditions {

  <inherits name="com.google.common.escape.Escape" />
  <inherits name="com.google.common.html.Html" />
  <inherits name="com.google.common.io.Io" />
  <inherits name="com.google.common.math.Math" />
  <inherits name="com.google.common.net.Net" />
  <inherits name="com.google.common.primitives.Primitives" />
  <inherits name="com.google.common.util.concurrent.Concurrent" />
  <inherits name="com.google.common.xml.Xml" />

pkg math/big, method (*Float) Scan(fmt.ScanState, int32) error
pkg math/big, method (*Int) Sqrt(*Int) *Int
pkg math/rand, func Uint64() uint64
pkg math/rand, method (*Rand) Uint64() uint64
pkg math/rand, type Source64 interface, Int63() int64
pkg math/rand, type Source64 interface { Int63, Seed, Uint64 }
pkg math/rand, type Source64 interface, Seed(int64)
pkg math/rand, type Source64 interface, Uint64() uint64

import jsinterop.annotations.JsPackage;

/** Web specializations for {@link Floats} methods. */
public abstract class FloatsMethodsForWeb {

  @JsMethod(name = "Math.min", namespace = JsPackage.GLOBAL)
  public static native float min(float... array);

  @JsMethod(name = "Math.max", namespace = JsPackage.GLOBAL)
  public static native float max(float... array);

import jsinterop.annotations.JsPackage;

/** Web specializations for {@link Shorts} methods. */
public abstract class ShortsMethodsForWeb {

  @JsMethod(name = "Math.min", namespace = JsPackage.GLOBAL)
  public static native short min(short... array);

  @JsMethod(name = "Math.max", namespace = JsPackage.GLOBAL)
  public static native short max(short... array);