Java BigInteger is Prime fnvHash(final byte[] data, final BigInteger fnvOffs, final BigInteger fnvPrime, final BigInteger mod)

Here you can find the source of fnvHash(final byte[] data, final BigInteger fnvOffs, final BigInteger fnvPrime, final BigInteger mod)

Description

fnv Hash

License

Open Source License

Declaration

private static BigInteger fnvHash(final byte[] data, final BigInteger fnvOffs, final BigInteger fnvPrime,
            final BigInteger mod) 

Method Source Code


//package com.java2s;
/*//from   w  w w  .j  a va2 s.  c o m
 * Copyright ? 2011 - 2013 Aaron Mahan
 * Copyright ? 2013 - 2016 Forerunner Games, LLC
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in all
 * copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
 * SOFTWARE.
 */

import java.math.BigInteger;

public class Main {
    private static BigInteger fnvHash(final byte[] data, final BigInteger fnvOffs, final BigInteger fnvPrime,
            final BigInteger mod) {
        BigInteger hash = fnvOffs;
        for (final byte next : data) {
            final BigInteger bigIntValue = BigInteger.valueOf(next & 0xff);
            hash = hash.xor(bigIntValue);
            hash = hash.multiply(fnvPrime).mod(mod);
        }
        return hash;
    }
}

Related

  1. calculateMPrime(BigInteger n, byte[] message)
  2. hasSqrtModPrime(BigInteger r, BigInteger p)
  3. isBigPrime(BigInteger number)
  4. isCoprime(BigInteger a, BigInteger b)
  5. isFermatPrime(BigInteger f)