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()


                ECPoint p = key.getParameters().getG().multiply(k);


                BigInteger x = p.getX().toBigInteger();


                r = x.mod(n);
            }
            while (r.equals(ECConstants.ZERO));


            BigInteger d = ((ECPrivateKeyParameters)key).getD();

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:ArithmeticUtils.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()

        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:ArithmeticUtils.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()

            if (randomNum.compareTo(upperBound) < 0)
            {
                return randomNum;
            }
        }
        return randomNum.mod(upperBound);
    }


    /**
     * Extract the truncated square root of a BigInteger.
     *

View Full Code Here

Examples of java.math.BigInteger.mod()

                ECPoint p = key.getParameters().getG().multiply(k);


                // 5.3.3
                BigInteger x = p.getX().toBigInteger();


                r = x.mod(n);
            }
            while (r.equals(ZERO));


            BigInteger d = ((ECPrivateKeyParameters)key).getD();

View Full Code Here

Examples of java.math.BigInteger.mod()


                ECPoint p = key.getParameters().getG().multiply(k);


                BigInteger x = p.getX().toBigInteger();


                r = x.mod(n);
            }
            while (r.equals(ECConstants.ZERO));


            BigInteger d = ((ECPrivateKeyParameters)key).getD();

View Full Code Here

Examples of java.math.BigInteger.mod()

        //
        for (;;)
        {
            p = new BigInteger(pbitlength, 1, param.getRandom());
            
            if (p.mod(e).equals(ONE))
            {
                continue;
            }
            
            if (!p.isProbablePrime(param.getCertainty()))

View Full Code Here

Examples of java.math.BigInteger.mod()

    private BigInteger blindMessage(
        BigInteger msg)
    {
        BigInteger blindMsg = blindingFactor;
        blindMsg = msg.multiply(blindMsg.modPow(key.getExponent(), key.getModulus()));
        blindMsg = blindMsg.mod(key.getModulus());


        return blindMsg;
    }


    /*

View Full Code Here

Examples of java.math.BigInteger.mod()

                //step 9
                BigInteger N = TWO.pow(t[m]-1).divide(p[m+1]).
                                   add((TWO.pow(t[m]-1).multiply(Ym)).
                                       divide(p[m+1].multiply(TWO.pow(16*rm))));


                if (N.mod(TWO).compareTo(ONE)==0) 
                {
                    N = N.add(ONE);
                }


                int k = 0; //step 10

View Full Code Here

Examples of java.math.BigInteger.mod()

                //step 9
                BigInteger N = TWO.pow(t[m]-1).divide(p[m+1]).
                                   add((TWO.pow(t[m]-1).multiply(Ym)).
                                       divide(p[m+1].multiply(TWO.pow(32*rm))));


                if (N.mod(TWO).compareTo(ONE)==0) 
                {
                    N = N.add(ONE);
                }


                int k = 0; //step 10

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.