List of pow() Examples

Examples of pow()

com.exigen.ie.constrainer.IntExp.pow()
Returns the expression: pow(this,value).
com.mockturtlesolutions.snifflib.datatypes.DblMatrix.pow()
de.jungblut.math.DoubleVector.pow()
java.math.BigDecimal.pow()
Returns a {@code BigDecimal} whose value is(thisⁿ), The power is computed exactly, to unlimited precision.
The parameter {@code n} must be in the range 0 through999999999, inclusive. {@code ZERO.pow(0)} returns {@link #ONE}. Note that future releases may expand the allowable exponent range of this method. @param n power to raise this {@code BigDecimal} to. @return thisⁿ @throws ArithmeticException if {@code n} is out of range. @since 1.5
java.math.BigInteger.pow()
Returns a BigInteger whose value is (this^exponent). Note that {@code exponent} is an integer rather than a BigInteger. @param exponent exponent to which this BigInteger is to be raised. @return this^exponent @throws ArithmeticException {@code exponent} is negative. (This wouldcause the operation to yield a non-integer value.)
javax.measure.unit.Unit.pow()
lipstone.joshua.parser.types.BigDec.pow()
Equivalent of Math.pow(base, exp) where base is this object @param exp the exponent as a BigDec @return a BigDec object with a value equal to this^exp to the accuracy defined by context @throws UndefinedResultException when both this and exp are infinities
mikera.vectorz.AVector.pow()
org.apache.commons.math3.complex.Complex.pow()
Returns of value of this complex number raised to the power of {@code x}. Implements the formula:
```
  y^x = exp(x·log(y))  
```
where {@code exp} and {@code log} are {@link #exp} and{@link #log}, respectively.
Returns {@link Complex#NaN} if either real or imaginary part of theinput argument is {@code NaN} or infinite, or if {@code y}equals {@link Complex#ZERO}. @param x exponent to which this {@code Complex} is to be raised. @return this^{{@code x}}. @throws NullArgumentException if x is {@code null}. @since 1.2
org.apache.velocity.tools.generic.MathTool.pow()
@param num1 the first number @param num2 the second number @return the first number raised to the power of thesecond or null if they're invalid @see #toNumber
org.jwildfire.base.mathlib.Complex.Pow()
org.luaj.vm2.LuaValue.pow()
Raise to power: Raise this value to a power including metatag processing.
Each operand must derive from {@link LuaNumber}or derive from {@link LuaString} and be convertible to a number @param rhs The power to raise this value to @return value of {@code (this ^ rhs)} if both are numeric, or {@link LuaValue} if metatag processing occurs @throws LuaError if either operand is not a number or string convertible to number, and neither has the {@link POW} metatag defined @see #arithmt(LuaValue,LuaValue)

Examples of java.math.BigInteger.pow()

  private BigInteger num;


  @Override
  public void init(Object... inits) {
    BigInteger i = new BigInteger("2");
    num = i.pow(1000);
  }


  @Override
  public void solve() {
    String s = num.toString();

View Full Code Here

Examples of java.math.BigInteger.pow()

    byte aBytes[] = {1, 2, 3, 4, 5, 6, 7};
    int aSign = 1;
    int exp = -5;
    BigInteger aNumber = new BigInteger(aSign, aBytes);
    try {
      aNumber = aNumber.pow(exp);
      fail("ArithmeticException has not been caught");
    } catch (ArithmeticException e) {
      assertEquals("Improper exception message", "Negative exponent",
          e.getMessage());
    }

View Full Code Here

Examples of java.math.BigInteger.pow()

        byte aBytes[] = {1, 2, 3, 4, 5, 6, 7};
        int aSign = 1;
        int exp = -5;
        BigInteger aNumber = new BigInteger(aSign, aBytes);
        try {
            aNumber.pow(exp);
            fail("ArithmeticException has not been caught");
        } catch (ArithmeticException e) {
            assertEquals("Improper exception message", "Negative exponent", e.getMessage());
        }
    }

View Full Code Here

Examples of java.math.BigInteger.pow()

  public void testSqrtFloor() {
    for (BigInteger x : POSITIVE_BIGINTEGER_CANDIDATES) {
      for (RoundingMode mode : asList(FLOOR, DOWN)) {
        BigInteger result = BigIntegerMath.sqrt(x, mode);
        assertTrue(result.compareTo(ZERO) > 0);
        assertTrue(result.pow(2).compareTo(x) <= 0);
        assertTrue(result.add(ONE).pow(2).compareTo(x) > 0);
      }
    }
  }

View Full Code Here

Examples of java.math.BigInteger.pow()

  public void testSqrtCeiling() {
    for (BigInteger x : POSITIVE_BIGINTEGER_CANDIDATES) {
      for (RoundingMode mode : asList(CEILING, UP)) {
        BigInteger result = BigIntegerMath.sqrt(x, mode);
        assertTrue(result.compareTo(ZERO) > 0);
        assertTrue(result.pow(2).compareTo(x) >= 0);
        assertTrue(result.signum() == 0 || result.subtract(ONE).pow(2).compareTo(x) < 0);
      }
    }
  }

View Full Code Here

Examples of java.math.BigInteger.pow()

  // Relies on the correctness of sqrt(BigInteger, FLOOR).
  public void testSqrtExact() {
    for (BigInteger x : POSITIVE_BIGINTEGER_CANDIDATES) {
      BigInteger floor = BigIntegerMath.sqrt(x, FLOOR);
      // We only expect an exception if x was not a perfect square.
      boolean isPerfectSquare = floor.pow(2).equals(x);
      try {
        assertEquals(floor, BigIntegerMath.sqrt(x, UNNECESSARY));
        assertTrue(isPerfectSquare);
      } catch (ArithmeticException e) {
        assertFalse(isPerfectSquare);

View Full Code Here

Examples of java.math.BigInteger.pow()


        // Test some known Mersenne primes (2^n)-1
        // The array holds the exponents, not the numbers being tested
        for (int i=0; i<NUM_MERSENNES_TO_TEST; i++) {
            p1 = new BigInteger("2");
            p1 = p1.pow(mersenne_powers[i]);
            p1 = p1.subtract(BigInteger.ONE);
            if (!p1.isProbablePrime(100)) {
                System.err.println("Mersenne prime "+i+ " failed.");
                failCount++;
            }

View Full Code Here

Examples of javax.measure.unit.Unit.pow()

        if (javax.measure.unit.ProductUnit.class.isInstance(u)){
            ProductUnit pu=(ProductUnit)u;
            for (int i=0;i<pu.getUnitCount();++i){
                /* First check to see if this unit needs split */
                Unit ux =splitUnits(pu.getUnit(i));
                retval=retval.times(ux.pow(pu.getUnitPow(i)));
            }
            /* Now split again */
            Logger.getLogger("com.CompPad").log(Level.FINE,"ProductUnit "
                    + pu.getUnitCount());
        }

View Full Code Here

Examples of javax.measure.unit.Unit.pow()

        if (javax.measure.unit.ProductUnit.class.isInstance(u)){
            ProductUnit pu=(ProductUnit)u;
            for (int i=0;i<pu.getUnitCount();++i){
                /* First check to see if this unit needs split */
                Unit ux =splitUnits(pu.getUnit(i));
                retval=retval.times(ux.pow(pu.getUnitPow(i)));
            }
            /* Now split again */
            Logger.getLogger("com.CompPad").log(Level.FINE,"ProductUnit "
                    + pu.getUnitCount());
        }

View Full Code Here

Examples of lipstone.joshua.parser.types.BigDec.pow()

          power = (ConsCell) power.getCar();
        current.getNextConsCell().remove();
        power = parser.run(parser.preProcess(power));
        if (power.getCarType() != ConsType.NUMBER || power.length() != 1)
          throw new InvalidUnitException(current.getCar() + " is raised to an invalid power.", nl);
        partial = partial.pow((BigDec) power.getCar());
      }
      factor = divide ? factor.divide(partial) : factor.multiply(partial);
    } while (!(current = current.getNextConsCell()).isNull());
    return factor;
  }

View Full Code Here

0 1 2 3 4 5

TOP

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.