Java BigInteger Calculate modulus(BigInteger value, BigInteger divider, int modulo, int... weight)

Description

modulus

License

Apache License

Declaration

public static int modulus(BigInteger value, BigInteger divider, int modulo, int... weight) 

Method Source Code

//package com.java2s;
/*/*w ww .jav a2s.c  o  m*/
 * Copyright 2015 agwlvssainokuni
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

import static java.math.BigInteger.ZERO;
import static java.math.BigInteger.valueOf;
import java.math.BigInteger;

public class Main {
    public static int modulus(BigInteger value, BigInteger divider, int modulo, int... weight) {
        BigInteger[] temp = new BigInteger[] { value, ZERO };
        int result = 0;
        for (int i = 0; temp[0].compareTo(ZERO) != 0; i++) {
            temp = temp[0].divideAndRemainder(divider);
            result = result + temp[1].multiply(valueOf(weight[i % weight.length])).intValue();
        }
        result = modulo - result % modulo;
        return (result >= modulo ? 0 : result);
    }
}

Related

1. min(BigInteger a, BigInteger b)
2. modPow(BigInteger base, BigInteger e, BigInteger m)
3. modPowByte(byte[] arg, BigInteger e, BigInteger n)
4. modPowLong(BigInteger n, long exponent, BigInteger modulo)
5. mods(BigInteger v, BigInteger m)
6. multi_exponent(BigInteger[] base, BigInteger[] exponent, BigInteger modulus)
7. multiply(BigInteger x, BigInteger y)
8. negative(BigInteger n)
9. normalizarParaBigInteger(Number numero, RoundingMode modo)