- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 82 for Panter (0.22 sec)
-
android/guava/src/com/google/common/hash/Fingerprint2011.java
b ^= (b >>> 47); b *= K3; return b; } /** * Computes intermediate hash of 32 bytes of byte array from the given offset. Results are * returned in the output array - this is 12% faster than allocating new arrays every time. */ private static void weakHashLength32WithSeeds( byte[] bytes, int offset, long seedA, long seedB, long[] output) { long part1 = load64(bytes, offset);
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Dec 28 17:50:25 GMT 2021 - 6.5K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/util/concurrent/SequentialExecutorTest.java
assertEquals(1, numCalls.get()); } /* * Under Android, MyError propagates up and fails the test? * * TODO(b/218700094): Does this matter to prod users, or is it just a feature of our testing * environment? If the latter, maybe write a custom Executor that avoids failing the test when it * sees an Error? */ @AndroidIncompatible public void testTaskThrowsError() throws Exception {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Sep 06 17:04:31 GMT 2023 - 11.4K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/HashFunction.java
* * <p><b>Warning:</b> This method, which reencodes the input before hashing it, is useful only for * cross-language compatibility. For other use cases, prefer {@link #hashUnencodedChars}, which is * faster, produces the same output across Java releases, and hashes every {@code char} in the * input, even if some are invalid. */ HashCode hashString(CharSequence input, Charset charset); /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue May 25 18:22:59 GMT 2021 - 10.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/AbstractFuture.java
} @Override void putNext(Waiter waiter, @CheckForNull Waiter newValue) { UNSAFE.putObject(waiter, WAITER_NEXT_OFFSET, newValue); } /** Performs a CAS operation on the {@link #waiters} field. */ @Override boolean casWaiters( AbstractFuture<?> future, @CheckForNull Waiter expect, @CheckForNull Waiter update) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 22 21:17:24 GMT 2024 - 63K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Lists.java
int size = thisList.size(); if (size != otherList.size()) { return false; } if (thisList instanceof RandomAccess && otherList instanceof RandomAccess) { // avoid allocation and use the faster loop for (int i = 0; i < size; i++) { if (!Objects.equal(thisList.get(i), otherList.get(i))) { return false; } } return true; } else {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Thu Feb 29 16:48:36 GMT 2024 - 41.5K bytes - Viewed (0) -
guava/src/com/google/common/collect/ImmutableSortedMap.java
return CollectCollectors.toImmutableSortedMap( comparator, keyFunction, valueFunction, mergeFunction); } /* * TODO(kevinb): Confirm that ImmutableSortedMap is faster to construct and * uses less memory than TreeMap; then say so in the class Javadoc. */ private static final Comparator<?> NATURAL_ORDER = Ordering.natural();
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 21:19:52 GMT 2024 - 50.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/util/concurrent/FuturesTest.java
ExecutorService executor = newSingleThreadExecutor(); Future<V> waiter = executor.submit( new Callable<V>() { @Override public V call() throws Exception { return input.get(); } }); try { return getUninterruptibly(waiter, timeout, unit); } catch (ExecutionException e) {
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Tue Feb 20 17:00:05 GMT 2024 - 144.5K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Bytes.java
return (array.length < minLength) ? Arrays.copyOf(array, minLength + padding) : array; } /** * Returns an array containing each value of {@code collection}, converted to a {@code byte} value * in the manner of {@link Number#byteValue}. * * <p>Elements are copied from the argument collection as if by {@code collection.toArray()}. * Calling this method is as thread-safe as calling that method. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 15 16:12:13 GMT 2024 - 14.9K bytes - Viewed (0) -
android/guava/src/com/google/common/primitives/Floats.java
* moved to index "distance", and the element at index {@code i} ends up at index {@code (distance * + i) mod array.length}. This is equivalent to {@code Collections.rotate(Floats.asList(array), * distance)}, but is considerably faster and avoids allocation and garbage collection. * * <p>The provided "distance" may be negative, which will rotate left. * * @since 32.0.0 */ public static void rotate(float[] array, int distance) {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 29 15:43:06 GMT 2024 - 25.2K bytes - Viewed (0) -
README.md
[![Latest release](https://img.shields.io/github/release/google/guava.svg)](https://github.com/google/guava/releases/latest) [![Build Status](https://github.com/google/guava/workflows/CI/badge.svg?branch=master)](https://github.com/google/guava/actions) [![OpenSSF Best Practices](https://bestpractices.coreinfrastructure.org/projects/7197/badge)](https://bestpractices.coreinfrastructure.org/projects/7197)
Plain Text - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed May 01 18:44:57 GMT 2024 - 5.9K bytes - Viewed (0)