- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 63 for Algorithm (0.17 sec)
-
guava-tests/benchmark/com/google/common/hash/MessageDigestAlgorithmBenchmark.java
MESSAGE_DIGEST_API() { @Override public byte[] hash(Algorithm algorithm, byte[] input) { MessageDigest md = algorithm.getMessageDigest(); md.update(input); return md.digest(); } }, HASH_FUNCTION_DIRECT() { @Override public byte[] hash(Algorithm algorithm, byte[] input) { return algorithm.getHashFunction().hashBytes(input).asBytes(); } },
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/hash/MacHashFunctionTest.java
Hashing.hmacSha1(keyData).toString()); assertEquals( "Hashing.hmacSha256(Key[algorithm=HmacSHA256, format=RAW])", Hashing.hmacSha256(SHA256_KEY).toString()); assertEquals( "Hashing.hmacSha256(Key[algorithm=HmacSHA256, format=RAW])", Hashing.hmacSha256(keyData).toString()); assertEquals(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 13.8K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/Hashing.java
/** * Returns a hash function implementing the Message Authentication Code (MAC) algorithm, using the * MD5 (128 hash bits) hash function and a {@link SecretKeySpec} created from the given byte array * and the MD5 algorithm. * * <p>If you are designing a new system that needs HMAC, prefer {@link #hmacSha256} or other * future-proof algorithms <a
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Apr 09 00:37:15 GMT 2024 - 29.2K bytes - Viewed (0) -
guava-tests/test/com/google/common/math/QuantilesAlgorithmTest.java
} } public void testSingleQuantile_median() { double referenceValue = REFERENCE_ALGORITHM.singleQuantile(1, 2, dataset.clone()); for (QuantilesAlgorithm algorithm : NON_REFERENCE_ALGORITHMS) { assertWithMessage("Mismatch between %s and %s", algorithm, REFERENCE_ALGORITHM) .that(algorithm.singleQuantile(1, 2, dataset.clone())) .isWithin(ALLOWED_ERROR) .of(referenceValue); }
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.4K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/math/QuantilesBenchmark.java
double median(int reps) { double dummy = 0.0; for (int i = 0; i < reps; i++) { dummy += algorithm.singleQuantile(1, 2, dataset(i)); } return dummy; } @Benchmark double percentile90(int reps) { double dummy = 0.0; for (int i = 0; i < reps; i++) { dummy += algorithm.singleQuantile(90, 100, dataset(i)); } return dummy; } @Benchmark
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Oct 10 19:45:10 GMT 2022 - 3.1K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/MacHashFunctionTest.java
Hashing.hmacSha1(keyData).toString()); assertEquals( "Hashing.hmacSha256(Key[algorithm=HmacSHA256, format=RAW])", Hashing.hmacSha256(SHA256_KEY).toString()); assertEquals( "Hashing.hmacSha256(Key[algorithm=HmacSHA256, format=RAW])", Hashing.hmacSha256(keyData).toString()); assertEquals(
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 13.8K bytes - Viewed (0) -
guava-tests/benchmark/com/google/common/hash/MessageDigestCreationBenchmark.java
private String algorithm; private MessageDigest md; @BeforeExperiment void setUp() throws Exception { md = MessageDigest.getInstance(algorithm); } @Benchmark int getInstance(int reps) throws Exception { int retValue = 0; for (int i = 0; i < reps; i++) { retValue ^= MessageDigest.getInstance(algorithm).getDigestLength(); } return retValue; }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 1.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/hash/MessageDigestHashFunctionTest.java
// - Some providers may choose to also include alias names. // - For example, the "SHA-1" algorithm might be referred to as "SHA1". // - The algorithm name is not case-sensitive. private static final ImmutableMap<String, HashFunction> ALGORITHMS = new ImmutableMap.Builder<String, HashFunction>() .put("MD5", Hashing.md5())
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 4.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/collect/BinaryTreeTraverserBenchmark.java
for (int i = 0; i < size; i++) { keys[i] = rng.nextInt(); } return createTreap(Ints.asList(keys)); } // See http://en.wikipedia.org/wiki/Treap for details on the algorithm. private Optional<BinaryNode> createTreap(List<Integer> keys) { if (keys.isEmpty()) { return Optional.absent(); } int minIndex = 0; for (int i = 1; i < keys.size(); i++) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 26 19:18:53 GMT 2019 - 4.9K bytes - Viewed (0) -
guava/src/com/google/common/collect/Collections2.java
} /** * Returns a {@link Collection} of all the permutations of the specified {@link Iterable}. * * <p><i>Notes:</i> This is an implementation of the algorithm for Lexicographical Permutations * Generation, described in Knuth's "The Art of Computer Programming", Volume 4, Chapter 7, * Section 7.2.1.2. The iteration order follows the lexicographical order. This means that the
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 23.1K bytes - Viewed (0)