// We don't expect perfect rounding accuracy.
    for (int exp : asList(-1022, -50, -1, 0, 1, 2, 3, 4, 100, 1022, 1023)) {
      for (RoundingMode mode : asList(HALF_EVEN, HALF_UP, HALF_DOWN)) {
        double x = Math.scalb(Math.sqrt(2) + 0.001, exp);
        double y = Math.scalb(Math.sqrt(2) - 0.001, exp);
        assertEquals(exp + 1, DoubleMath.log2(x, mode));
        assertEquals(exp, DoubleMath.log2(y, mode));
      }
    }
  }

        }

        @Override
        public Long getExpiration() {
            return expiration;
        }

        @Override
        public void setExpiration(Long exp) {
            this.expiration = exp;
        }

        @Override
        public Exception getException() {
            return exception;
        }

        @Override
        public void exception(Exception e) {

	MOVB	R0, math·Exp(SB)     // MOVB R0, math.Exp(SB)
	MOVB	math·Exp(SB), R0     // MOVB math.Exp(SB), R0
	MOVBS	R0, math·Exp(SB)     // MOVBS R0, math.Exp(SB)
	MOVBS	math·Exp(SB), R0     // MOVBS math.Exp(SB), R0
	MOVBU	R0, math·Exp(SB)     // MOVBU R0, math.Exp(SB)
	MOVBU	math·Exp(SB), R0     // MOVBU math.Exp(SB), R0
	MOVB	R2, R0>>28(R1)                                    // 202ec1e7

func (z *Int) Rsh(x *Int, s uint) *Int {
	x.doinit()
	z.doinit()
	C._mpz_div_2exp(&z.i[0], &x.i[0], C.ulong(s))
	return z
}

// Exp sets z = x^y % m and returns z.
// If m == nil, Exp sets z = x^y.
func (z *Int) Exp(x, y, m *Int) *Int {
	m.doinit()
	x.doinit()
	y.doinit()
	z.doinit()
	if m == nil {
		C.mpz_pow_ui(&z.i[0], &x.i[0], C.mpz_get_ui(&y.i[0]))
	} else {

	argP, err := ellipses.FindEllipsesPatterns(args)
	if err != nil {
		return nil, err
	}
	exp := argP.Expand()

	if node == "" {
		for index, e := range exp {
			result = append(result, localDisk{index: index, path: strings.Join(e, "")})
		}
	} else {
		for index, e := range exp {
			u, err := url.Parse(strings.Join(e, ""))
			if err != nil {
				return nil, err
			}

	}

	// Set macros for GOEXPERIMENTs so we can easily switch
	// runtime assembly code based on them.
	if objabi.LookupPkgSpecial(ctxt.Pkgpath).AllowAsmABI {
		for _, exp := range buildcfg.Experiment.Enabled() {
			flags.D = append(flags.D, "GOEXPERIMENT_"+exp)
		}
	}

	var ok, diag bool
	var failedFile string
	for _, f := range flag.Args() {
		lexer := lex.NewLexer(f)
		parser := asm.NewParser(ctxt, architecture, lexer)

    List<?> exp = copyToList(expected);
    List<?> act = copyToList(actual);
    String actString = act.toString();

    // Of course we could take pains to give the complete description of the
    // problem on any failure.

    // Yeah it's n^2.
    for (Object object : exp) {
      if (!act.remove(object)) {
        fail(

    }

    /**
     * {@inheritDoc}
     *
     * @see jcifs.util.transport.Response#setExpiration(java.lang.Long)
     */
    @Override
    public void setExpiration(final Long exp) {
        this.expiration = exp;
    }

    /**
     * Checks whether the asynchronous interim response has been handled.
     *
     * @return whether the interim response has been handled
     */

        assertFalse(isPerfectSquare);
      }
    }
  }

  @GwtIncompatible // TODO
  public void testPow() {
    for (long i : ALL_LONG_CANDIDATES) {
      for (int exp : EXPONENTS) {
        assertEquals(LongMath.pow(i, exp), valueOf(i).pow(exp).longValue());
      }
    }
  }

  @J2ktIncompatible // J2kt BigDecimal.divide also has the rounding bug
  @GwtIncompatible // TODO

  static int randomExponent() {
    return RANDOM_SOURCE.nextInt(MAX_EXPONENT + 1);
  }

  static double randomPositiveDouble() {
    return Math.exp(randomDouble(6));
  }

  private MathBenchmarking() {}