List of mod() Examples

Examples of mod()

br.com.caelum.stella.DigitoPara.mod()
@param modulo Inteiro pelo qual o resto será tirado e também seu complementar.O valor padrão é 11.
java.math.BigInteger.mod()
Returns a BigInteger whose value is {@code (this mod m}). This method differs from {@code remainder} in that it always returns anon-negative BigInteger. @param m the modulus. @return {@code this mod m} @throws ArithmeticException {@code m <= 0} @see #remainder
lipstone.joshua.parser.types.BigDec.mod()
The modulus operation. Equivalent to this % number @param number the BigDec to mod by @return this % number @throws UndefinedResultException
net.fortytwo.ripple.model.NumericValue.mod()
net.i2p.util.NativeBigInteger.mod()
org.apache.velocity.tools.generic.MathTool.mod()
Does integer modulus on the int values of the specified numbers.
So, $math.mod('5.1',3) will return '2', and $math.mod(6,'3.9') will return '0'.
@param num1 the first number @param num2 the second number @return the result of performing integer moduluson the operands. @see #toInteger
org.ethereum.vm.DataWord.mod()
org.jpox.store.mapped.expression.ScalarExpression.mod()
Remainder Operator. The left-hand operand is the dividend and the right-hand operand is the divisor. @param expr the right-hand operator @return The binary % operator is said to yield the remainder of its operands from an implied division
org.luaj.vm2.LuaValue.mod()
Modulo: Perform numeric modulo operation with another value of unknown type, including metatag processing.
Each operand must derive from {@link LuaNumber}or derive from {@link LuaString} and be convertible to a number @param rhs The right-hand-side value to perform the modulo with @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 MOD} metatag defined @see #arithmt(LuaValue,LuaValue)
org.rabinfingerprint.polynomial.Polynomial.mod()
Computes (this mod that) in GF(2^k) using synthetic division

Examples of java.math.BigInteger.mod()

        BigInteger upv = BigInteger.valueOf(fraction.numerator)
            .multiply(BigInteger.valueOf(denominator/d1));
        BigInteger t = isAdd ? uvp.add(upv) : uvp.subtract(upv);
        // but d2 doesn't need extra precision because
        // d2 = gcd(t,d1) = gcd(t mod d1, d1)
        int tmodd1 = t.mod(BigInteger.valueOf(d1)).intValue();
        int d2 = (tmodd1==0)?d1:greatestCommonDivisor(tmodd1, d1);


        // result is (t/d2) / (u'/d1)(v'/d2)
        BigInteger w = t.divide(BigInteger.valueOf(d2));
        if (w.bitLength() > 31) {

View Full Code Here

Examples of java.math.BigInteger.mod()

        BigInteger upv = BigInteger.valueOf(fraction.numerator)
            .multiply(BigInteger.valueOf(denominator/d1));
        BigInteger t = isAdd ? uvp.add(upv) : uvp.subtract(upv);
        // but d2 doesn't need extra precision because
        // d2 = gcd(t,d1) = gcd(t mod d1, d1)
        int tmodd1 = t.mod(BigInteger.valueOf(d1)).intValue();
        int d2 = (tmodd1==0)?d1:greatestCommonDivisor(tmodd1, d1);


        // result is (t/d2) / (u'/d1)(v'/d2)
        BigInteger w = t.divide(BigInteger.valueOf(d2));
        if (w.bitLength() > 31) {

View Full Code Here

Examples of java.math.BigInteger.mod()

        final BigInteger upv = BigInteger.valueOf(fraction.numerator)
            .multiply(BigInteger.valueOf(denominator/d1));
        final BigInteger t = isAdd ? uvp.add(upv) : uvp.subtract(upv);
        // but d2 doesn't need extra precision because
        // d2 = gcd(t,d1) = gcd(t mod d1, d1)
        final int tmodd1 = t.mod(BigInteger.valueOf(d1)).intValue();
        final int d2 = tmodd1==0?d1:greatestCommonDivisor(tmodd1, d1);


        // result is (t/d2) / (u'/d1)(v'/d2)
        final BigInteger w = t.divide(BigInteger.valueOf(d2));
        if (w.bitLength() > 31) {

View Full Code Here

Examples of java.math.BigInteger.mod()

     */
    long temp = rand.getHigh8();
    if (temp < 0) {
      // use biginteger to avoid the negative sign problem
      BigInteger bigTemp = makeBigInteger(temp);
      recBuf[0] = (byte) (' ' + (bigTemp.mod(NINETY_FIVE).longValue()));
      temp = bigTemp.divide(NINETY_FIVE).longValue();
    } else {
      recBuf[0] = (byte) (' ' + (temp % 95));
      temp /= 95;      
    }

View Full Code Here

Examples of java.math.BigInteger.mod()

      temp /= 95;      
    }
    temp = rand.getLow8();
    if (temp < 0) {
      BigInteger bigTemp = makeBigInteger(temp);
      recBuf[8] = (byte) (' ' + (bigTemp.mod(NINETY_FIVE).longValue()));
      temp = bigTemp.divide(NINETY_FIVE).longValue();      
    } else {
      recBuf[8] = (byte) (' ' + (temp % 95));
      temp /= 95;
    }

View Full Code Here

Examples of java.math.BigInteger.mod()

        BigInteger upv = BigInteger.valueOf(fraction.numerator)
            .multiply(BigInteger.valueOf(denominator/d1));
        BigInteger t = isAdd ? uvp.add(upv) : uvp.subtract(upv);
        // but d2 doesn't need extra precision because
        // d2 = gcd(t,d1) = gcd(t mod d1, d1)
        int tmodd1 = t.mod(BigInteger.valueOf(d1)).intValue();
        int d2 = (tmodd1==0)?d1:greatestCommonDivisor(tmodd1, d1);


        // result is (t/d2) / (u'/d1)(v'/d2)
        BigInteger w = t.divide(BigInteger.valueOf(d2));
        if (w.bitLength() > 31) {

View Full Code Here

Examples of java.math.BigInteger.mod()

        BigInteger upv = BigInteger.valueOf(fraction.numerator)
        .multiply(BigInteger.valueOf(denominator/d1));
        BigInteger t = isAdd ? uvp.add(upv) : uvp.subtract(upv);
        // but d2 doesn't need extra precision because
        // d2 = gcd(t,d1) = gcd(t mod d1, d1)
        int tmodd1 = t.mod(BigInteger.valueOf(d1)).intValue();
        int d2 = (tmodd1==0)?d1:MathUtils.gcd(tmodd1, d1);


        // result is (t/d2) / (u'/d1)(v'/d2)
        BigInteger w = t.divide(BigInteger.valueOf(d2));
        if (w.bitLength() > 31) {

View Full Code Here

Examples of java.math.BigInteger.mod()

            ((hasDay() == hasMonth() && hasDay() == hasYear())));


        if (!needNormalize && getFraction() != null && getFraction().scale() > 0)
        {
            BigInteger bi = getFraction().unscaledValue();
            needNormalize = (bi.mod(GDateBuilder.TEN).signum() == 0);
        }


        if (!needNormalize)
            _canonicalString = toString();
        else

View Full Code Here

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

    if (value.length() != 1 || value.getCarType() != ConsType.NUMBER)
      throw new UndefinedResultException("The " + operation + " operation takes one decimal number for its arguments.", this);
    BigDec inp = (BigDec) value.getCar();
    
    //Special points (e.g. angles at which sin, cos, etc. have exact answers
    if (operation.equals("cos") && ((parser.getAngleType().equals("Degrees") && inp.mod(new BigDec(180.0)).eq(new BigDec(90.0)))
        || (parser.getAngleType().equals("Radians") && inp.mod(new BigDec(Math.PI)).eq(new BigDec(Math.PI / 2))) || (parser.getAngleType().equals("Grads") && inp.mod(new BigDec(200.0)).eq(new BigDec(100.0))))) {
      return new ConsCell(BigDec.ZERO, ConsType.NUMBER);
    }
    if ((operation.equals("sin") || operation.equals("tan")) && ((parser.getAngleType().equals("Degrees") && inp.mod(new BigDec(180.0)).eq(new BigDec(0.0)))
        || (parser.getAngleType().equals("Radians") && inp.mod(new BigDec(Math.PI)).eq(BigDec.ZERO)) || (parser.getAngleType().equals("Grads") && inp.mod(new BigDec(200.0)).eq(BigDec.ZERO)))) {

View Full Code Here

Examples of net.fortytwo.ripple.model.NumericValue.mod()

        a = mc.toNumericValue(stack.getFirst());
        stack = stack.getRest();


        // Note: mod by zero simply does not yield a result.
        if (!b.isZero()) {
            result = a.mod(b);


            solutions.put(
                    stack.push(result));
        }
    }

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.