- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for check2BitAvalanche (0.22 sec)
-
guava-tests/test/com/google/common/hash/HashingTest.java
public void testAdler32() { HashTestUtils.assertInvariants(Hashing.adler32()); assertEquals("Hashing.adler32()", Hashing.adler32().toString()); } public void testMurmur3_128() { HashTestUtils.check2BitAvalanche(Hashing.murmur3_128(), 250, 0.20); HashTestUtils.checkAvalanche(Hashing.murmur3_128(), 250, 0.17); HashTestUtils.checkNo2BitCharacteristics(Hashing.murmur3_128());
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 26.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/HashingTest.java
public void testAdler32() { HashTestUtils.assertInvariants(Hashing.adler32()); assertEquals("Hashing.adler32()", Hashing.adler32().toString()); } public void testMurmur3_128() { HashTestUtils.check2BitAvalanche(Hashing.murmur3_128(), 250, 0.20); HashTestUtils.checkAvalanche(Hashing.murmur3_128(), 250, 0.17); HashTestUtils.checkNo2BitCharacteristics(Hashing.murmur3_128());
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 26.5K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/HashTestUtils.java
} } } } } /** * Test for avalanche with 2-bit deltas. Most probabilities of output bit(j) differing are well * within 50%. */ static void check2BitAvalanche(HashFunction function, int trials, double epsilon) { Random rand = new Random(0); int keyBits = 32; int hashBits = function.bits(); for (int bit1 = 0; bit1 < keyBits; bit1++) {
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 25.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/HashTestUtils.java
} } } } } /** * Test for avalanche with 2-bit deltas. Most probabilities of output bit(j) differing are well * within 50%. */ static void check2BitAvalanche(HashFunction function, int trials, double epsilon) { Random rand = new Random(0); int keyBits = 32; int hashBits = function.bits(); for (int bit1 = 0; bit1 < keyBits; bit1++) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 25.3K bytes - Viewed (0)