- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 63 for Algorithms (0.15 sec)
-
android/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 May 03 12:43:13 GMT 2024 - Last Modified: Mon Dec 04 17:37:03 GMT 2017 - 3.5K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Ordering.java
} // Ordering<Object> singletons /** * Returns an ordering which treats all values as equal, indicating "no ordering." Passing this * ordering to any <i>stable</i> sort algorithm results in no change to the order of elements. * Note especially that {@link #sortedCopy} and {@link #immutableSortedCopy} are stable, and in * the returned instance these are implemented by simply copying the source list.
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:38:27 GMT 2024 - 39.4K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Shorts.java
* {@code toIndex > fromIndex} * @since 32.0.0 */ public static void rotate(short[] array, int distance, int fromIndex, int toIndex) { // See Ints.rotate for more details about possible algorithms here. checkNotNull(array); checkPositionIndexes(fromIndex, toIndex, array.length); if (array.length <= 1) { return; } int length = toIndex - fromIndex;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 25.1K bytes - Viewed (0) -
android/guava/src/com/google/common/escape/UnicodeEscaper.java
* * <p>If the character does not need to be escaped, this method should return {@code null}, rather * than an array containing the character representation of the code point. This enables the * escaping algorithm to perform more efficiently. * * <p>If the implementation of this method cannot correctly handle a particular code point then it * should either throw an appropriate runtime exception or return a suitable replacement
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Jan 18 20:55:09 GMT 2022 - 13.2K bytes - Viewed (0) -
android/guava-tests/benchmark/com/google/common/util/concurrent/MonitorBasedArrayBlockingQueue.java
int takeIndex; /** items index for next put, offer, or add. */ int putIndex; /** Number of items in the queue */ private int count; /* * Concurrency control uses the classic two-condition algorithm * found in any textbook. */ /** Monitor guarding all access */ final Monitor monitor; /** Guard for waiting takes */ private final Monitor.Guard notEmpty; /** Guard for waiting puts */
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 19 19:24:36 GMT 2023 - 22.5K bytes - Viewed (0) -
guava/src/com/google/common/cache/CacheBuilder.java
* once after loading completes). Much internal cache management is performed at the segment * granularity. For example, access queues and write queues are kept per segment when they are * required by the selected eviction algorithm. As such, when writing unit tests it is not * uncommon to specify {@code concurrencyLevel(1)} in order to achieve more deterministic eviction * behavior. *
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 51.3K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Longs.java
* {@code toIndex > fromIndex} * @since 32.0.0 */ public static void rotate(long[] array, int distance, int fromIndex, int toIndex) { // See Ints.rotate for more details about possible algorithms here. checkNotNull(array); checkPositionIndexes(fromIndex, toIndex, array.length); if (array.length <= 1) { return; } int length = toIndex - fromIndex;
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 28.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/BigIntegerMath.java
* and the arithmetic mean is always higher than the geometric mean. * * b) this iteration converges to floor(sqrt(x)). In fact, the number of correct digits doubles * with each iteration, so this algorithm takes O(log(digits)) iterations. * * We start out with a double-precision approximation, which may be higher or lower than the * true value. Therefore, we perform at least one Newton iteration to get a guess that's
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Feb 07 17:50:39 GMT 2024 - 18.9K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/FarmHashFingerprint64.java
import static java.lang.Long.rotateRight; import com.google.common.annotations.VisibleForTesting; /** * Implementation of FarmHash Fingerprint64, an open-source fingerprinting algorithm for strings. * * <p>Its speed is comparable to CityHash64, and its quality of hashing is at least as good. * * <p>Note to maintainers: This implementation relies on signed arithmetic being bit-wise equivalent
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Apr 01 22:39:48 GMT 2022 - 7.6K bytes - Viewed (0)