- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 63 for reeds (0.12 sec)
-
.github/workflows/ci.yml
- name: 'Integration Test' if: matrix.java == 11 shell: bash run: util/gradle_integration_tests.sh publish_snapshot: name: 'Publish snapshot' needs: test if: github.event_name == 'push' && github.repository == 'google/guava' runs-on: ubuntu-latest steps: - name: 'Check out repository'
Others - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Wed Apr 24 19:33:50 GMT 2024 - 3.5K bytes - Viewed (0) -
guava-gwt/src-super/com/google/common/collect/super/com/google/common/collect/RegularImmutableBiMap.java
static final RegularImmutableBiMap<Object, Object> EMPTY = new RegularImmutableBiMap<Object, Object>(); // This reference is used both by the GWT compiler to infer the elements // of the lists that needs to be serialized. private ImmutableBiMap<V, K> inverse; @SuppressWarnings("unchecked") // used only for the empty map, which works for any types RegularImmutableBiMap() {
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Tue Feb 27 19:19:19 GMT 2024 - 2K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CollectionFuture.java
/* * We access this field racily but safely. For discussion of a similar situation, see the comments * on the fields of TimeoutFuture. This field is slightly different from the fields discussed * there: cancel() never reads this field, only writes to it. That makes the race here completely * harmless, rather than just 99.99% harmless. */ @CheckForNull @LazyInit private List<@Nullable Present<V>> values; CollectionFuture(
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 3.8K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Suppliers.java
public T get() { // Another variant of Double Checked Locking. // // We use two volatile reads. We could reduce this to one by // putting our fields into a holder class, but (at least on x86) // the extra memory consumption and indirection are more // expensive than the extra volatile reads. long nanos = expirationNanos; long now = System.nanoTime(); if (nanos == 0 || now - nanos >= 0) {
Java - Registered: Fri May 03 12:43:13 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 15.3K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/AbstractTableTest.java
import java.util.Map; import org.checkerframework.checker.nullness.qual.NonNull; import org.checkerframework.checker.nullness.qual.Nullable; /** * Test cases for a {@link Table} implementation supporting reads and writes. * * @author Jared Levy * @author Louis Wasserman */ @GwtCompatible @ElementTypesAreNonnullByDefault public abstract class AbstractTableTest<C extends @Nullable Character>
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Mon Mar 04 16:54:11 GMT 2024 - 6K 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 the given secret key. * * <p>If you are designing a new system that needs HMAC, prefer {@link #hmacSha256} or other * future-proof algorithms <a * href="https://datatracker.ietf.org/doc/html/rfc6151#section-2.3">over {@code hmacMd5}</a>. * * @param key the secret key
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/util/concurrent/JSR166TestCase.java
public void refresh() {} } /** Returns a policy containing all the permissions we ever need. */ public static Policy permissivePolicy() { return new AdjustablePolicy // Permissions j.u.c. needs directly ( new RuntimePermission("modifyThread"), new RuntimePermission("getClassLoader"), new RuntimePermission("setContextClassLoader"), // Permissions needed to change permissions!
Java - Registered: Fri Apr 12 12:43:09 GMT 2024 - Last Modified: Thu Feb 22 17:15:24 GMT 2024 - 37.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* locks---to each of the acquired locks, an edge from the soon-to-be-acquired lock is either * verified or created. * <li>If a new edge needs to be created, the outgoing edges of the acquired locks are traversed * to check for a cycle that reaches the lock to be acquired. If no cycle is detected, a new * "safe" edge is created.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri Dec 15 19:31:54 GMT 2023 - 35.9K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
// monitor.enterXXX()/monitor.leave() will make it really clear // which lock is held at any point in the code. // // 3. I think "enterWhen(notEmpty)" reads better than "notEmpty.enter()". // // TODO(user): Implement ReentrantLock features: // - toString() method // - getOwner() method // - getQueuedThreads() method
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Dec 04 18:22:01 GMT 2023 - 38.6K bytes - Viewed (0) -
guava-tests/test/com/google/common/collect/SetsTest.java
@Override public int hashCode() { return hashCode; } }; } // TODO b/327389044 - `Set<? extends Object> elements` should be enough but J2KT needs the <E> private static <E> void assertPowerSetHashCode(int expected, Set<E> elements) { assertEquals(expected, powerSet(elements).hashCode()); }
Java - Registered: Fri Apr 19 12:43:09 GMT 2024 - Last Modified: Thu Mar 07 18:34:03 GMT 2024 - 49.3K bytes - Viewed (0)