- Sort Score
- Result 10 results
- Languages All
Results 31 - 40 of 86 for Algorithm (3.52 sec)
-
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 May 03 12:43:13 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) -
maven-core/src/main/java/org/apache/maven/internal/impl/PathModularizationCache.java
// More than one filtered value, and we don't know how to handle at least one of them. // TODO: add a plugin mechanism for allowing plugin to specify their selection algorithm. return Optional.empty(); } } } if (classes & modules) { selected = getPathType(path); }
Java - Registered: Sun Mar 24 03:35:10 GMT 2024 - Last Modified: Fri Mar 01 17:18:13 GMT 2024 - 5.2K bytes - Viewed (0) -
src/main/java/jcifs/smb1/smb1/ACE.java
* based on these entries. * <p> * To fully understand the information exposed by this class a description * of the access check algorithm used by Windows is required. The following * is a basic description of the algorithm. For a more complete description * we recommend reading the section on Access Control in Keith Brown's * "The .NET Developer's Guide to Windows Security" (which is also
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Fri Mar 22 21:10:40 GMT 2019 - 7.2K bytes - Viewed (0) -
maven-api-impl/src/main/java/org/apache/maven/internal/impl/PathModularizationCache.java
// More than one filtered value, and we don't know how to handle at least one of them. // TODO: add a plugin mechanism for allowing plugin to specify their selection algorithm. return Optional.empty(); } } } if (classes & modules) { selected = getPathType(path); }
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Mon Mar 25 10:50:01 GMT 2024 - 5.2K bytes - Viewed (0) -
maven-compat/src/main/java/org/apache/maven/repository/legacy/DefaultWagonManager.java
file.deleteOnExit(); } } } private ChecksumObserver addChecksumObserver(Wagon wagon, String algorithm) throws TransferFailedException { try { ChecksumObserver checksumObserver = new ChecksumObserver(algorithm); wagon.addTransferListener(checksumObserver); return checksumObserver; } catch (NoSuchAlgorithmException e) {
Java - Registered: Sun May 05 03:35:11 GMT 2024 - Last Modified: Thu Sep 14 11:48:15 GMT 2023 - 29.9K bytes - Viewed (0) -
src/main/java/jcifs/pac/PacMac.java
} return calculateMacHMACAES(usage, key, data); } else { throw new PACDecodingException("Invalid MAC algorithm"); } } catch ( GeneralSecurityException e ) { throw new PACDecodingException("Failed to calculate MAC", e); } }
Java - Registered: Sun May 05 00:10:10 GMT 2024 - Last Modified: Sun Jul 01 13:12:10 GMT 2018 - 7K bytes - Viewed (0) -
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 19 12:43:09 GMT 2024 - Last Modified: Tue Feb 26 19:18:53 GMT 2019 - 4.9K bytes - Viewed (0) -
android/guava/src/com/google/common/math/LongMath.java
return b; } else if (b == 0) { return a; // similar logic } /* * Uses the binary GCD algorithm; see http://en.wikipedia.org/wiki/Binary_GCD_algorithm. This is * >60% faster than the Euclidean algorithm in benchmarks. */ int aTwos = Long.numberOfTrailingZeros(a); a >>= aTwos; // divide out all 2s int bTwos = Long.numberOfTrailingZeros(b);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 44.6K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/AbstractStreamingHasher.java
// TODO(kevinb): this class still needs some design-and-document-for-inheritance love @ElementTypesAreNonnullByDefault abstract class AbstractStreamingHasher extends AbstractHasher { /** Buffer via which we pass data to the hash algorithm (the implementor) */ private final ByteBuffer buffer; /** Number of bytes to be filled before process() invocation(s). */ private final int bufferSize; /** Number of bytes processed per process() invocation. */
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Jun 15 20:59:00 GMT 2022 - 7.1K bytes - Viewed (0)