- Sort Score
- Result 10 results
- Languages All
Results 1 - 4 of 4 for checkAvalanche (0.22 sec)
-
guava-tests/test/com/google/common/hash/HashingTest.java
public void testMd5() { HashTestUtils.checkAvalanche(Hashing.md5(), 100, 0.4); HashTestUtils.checkNo2BitCharacteristics(Hashing.md5()); HashTestUtils.checkNoFunnels(Hashing.md5()); HashTestUtils.assertInvariants(Hashing.md5()); assertEquals("Hashing.md5()", Hashing.md5().toString()); } public void testSha1() { HashTestUtils.checkAvalanche(Hashing.sha1(), 100, 0.4);
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 testMd5() { HashTestUtils.checkAvalanche(Hashing.md5(), 100, 0.4); HashTestUtils.checkNo2BitCharacteristics(Hashing.md5()); HashTestUtils.checkNoFunnels(Hashing.md5()); HashTestUtils.assertInvariants(Hashing.md5()); assertEquals("Hashing.md5()", Hashing.md5().toString()); } public void testSha1() { HashTestUtils.checkAvalanche(Hashing.sha1(), 100, 0.4);
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
* different input keys. This test verifies that each possible 1-bit key delta achieves avalanche. * * <p>For more information: http://burtleburtle.net/bob/hash/avalanche.html */ static void checkAvalanche(HashFunction function, int trials, double epsilon) { Random rand = new Random(0); int keyBits = 32; int hashBits = function.bits(); for (int i = 0; i < keyBits; i++) {
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
* different input keys. This test verifies that each possible 1-bit key delta achieves avalanche. * * <p>For more information: http://burtleburtle.net/bob/hash/avalanche.html */ static void checkAvalanche(HashFunction function, int trials, double epsilon) { Random rand = new Random(0); int keyBits = 32; int hashBits = function.bits(); for (int i = 0; i < keyBits; i++) {
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)