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 net.i2p.util.NativeBigInteger.mod()

      
      BigInteger X = new NativeBigInteger(1, Wbuf);
      
      // 9: Let c = X mod 2q. Set p = X - ( c - 1 ). Therefore p mod 2q = 1.
      
      BigInteger c = X.mod(q.add(q));
      BigInteger p = X.subtract(c.subtract(BigInteger.ONE));
      
      if(p.bitLength() >= keyLength-1) {
        if(isPrime(p)) {
          finish(r, hashLength, new NativeBigInteger(p), new NativeBigInteger(q), seed, counter);

View Full Code Here

Examples of org.apache.velocity.tools.generic.MathTool.mod()

        /* getTotal() watches the type of its first argument, so assertEquals needs a long */
        assertEquals((long)7,mathTool.getTotal(new long[] {2,2,3}));
        assertEquals(8,mathTool.idiv(130,16));
        assertEquals(9,mathTool.max(9,-10));
        assertEquals(10,mathTool.min(10,20));
        assertEquals(11,mathTool.mod(37,13));
        assertEquals(12,mathTool.mul(3,4));
        assertEquals(13,mathTool.round(12.8));
        assertEquals(14.2,mathTool.roundTo(1,14.18));
        assertEquals(-5.0,mathTool.roundTo(2,-4.999));
        assertEquals(15,mathTool.sub(30,15));

View Full Code Here

Examples of org.apache.velocity.tools.generic.MathTool.mod()

        /* getTotal() watches the type of its first argument, so assertEquals needs a long */
        assertEquals((long)7,mathTool.getTotal(new long[] {2,2,3}));
        assertEquals(8,mathTool.idiv(130,16));
        assertEquals(9,mathTool.max(9,-10));
        assertEquals(10,mathTool.min(10,20));
        assertEquals(11,mathTool.mod(37,13));
        assertEquals(12,mathTool.mul(3,4));
        assertEquals(13,mathTool.round(12.8));
        assertEquals(14.2,mathTool.roundTo(1,14.18));
        assertEquals(-5.0,mathTool.roundTo(2,-4.999));
        assertEquals(15,mathTool.sub(30,15));

View Full Code Here

Examples of org.ethereum.vm.DataWord.mod()

    }
    two[31] = 0x56; // 0xffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff56
    
    DataWord x = new DataWord(one);// System.out.println(x.value());
    DataWord y = new DataWord(two);// System.out.println(y.value());
    y.mod(x);
    assertEquals(32, y.getData().length);
    assertEquals(expected, Hex.toHexString(y.getData()));
  }
  
  @Test

View Full Code Here

Examples of org.jpox.store.mapped.expression.ScalarExpression.mod()

            {
                expr = expr.div(compileUnaryExpression());
            }
            else if (p.parseChar('%'))
            {
                expr = expr.mod(compileUnaryExpression());
            }
            else
            {
                break;
            }

View Full Code Here

Examples of org.luaj.vm2.LuaValue.mod()

      break;
    case OP_DIV:
      r = v1.div(v2);
      break;
    case OP_MOD:
      r = v1.mod(v2);
      break;
    case OP_POW:
      r = v1.pow(v2);
      break;
    case OP_UNM:

View Full Code Here

Examples of org.rabinfingerprint.polynomial.Polynomial.mod()


  private void precomputePopTable() {
    for (int i = 0; i < 256; i++) {
      Polynomial f = Polynomial.createFromLong(i);
      f = f.shiftLeft(BigInteger.valueOf(bytesPerWindow * 8));
      f = f.mod(poly);
      popTable[i] = f.toBigInteger().longValue();
    }
  }


  @Override

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.