- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 359 for Chen (0.15 sec)
-
android/guava/src/com/google/common/util/concurrent/SequentialExecutor.java
* block, and reference field assignment is atomic, this may save reacquiring the lock when * another thread or the worker task has cleared the count and set the state. * * <p>When {@link #executor} is a directExecutor(), the value written to * {@code workerRunningState} will be available synchronously, and behaviour will be * deterministic.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Thu Feb 01 21:46:34 GMT 2024 - 10.6K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Suppliers.java
* cached value, which will be recalculated when {@code get()} is called on the reserialized * instance. The actual memoization does not happen when the underlying delegate throws an * exception. * * <p>When the underlying delegate throws an exception then this memoizing supplier will keep * delegating calls until it returns valid data. *
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 15.3K bytes - Viewed (0) -
guava/src/com/google/common/base/Throwables.java
* find it when available. When this is null, use the slow way. */ @J2ktIncompatible @GwtIncompatible // java.lang.reflect @CheckForNull private static final Method getStackTraceElementMethod = (jla == null) ? null : getGetMethod(); /** * The "getStackTraceDepth" method, only available on some JDKs so we use reflection to find it * when available. When this is null, use the slow way.
Java - Registered: Fri Apr 05 12:43:09 GMT 2024 - Last Modified: Wed Mar 06 15:38:58 GMT 2024 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/base/Throwables.java
* find it when available. When this is null, use the slow way. */ @J2ktIncompatible @GwtIncompatible // java.lang.reflect @CheckForNull private static final Method getStackTraceElementMethod = (jla == null) ? null : getGetMethod(); /** * The "getStackTraceDepth" method, only available on some JDKs so we use reflection to find it * when available. When this is null, use the slow way.
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Wed Mar 06 15:38:58 GMT 2024 - 20.6K bytes - Viewed (0) -
android/guava/src/com/google/common/math/Quantiles.java
if (upper == POSITIVE_INFINITY) { // Return NaN when lower == NEGATIVE_INFINITY and upper == POSITIVE_INFINITY: return NaN; } // Return NEGATIVE_INFINITY when NEGATIVE_INFINITY == lower <= upper < POSITIVE_INFINITY: return NEGATIVE_INFINITY; } if (upper == POSITIVE_INFINITY) { // Return POSITIVE_INFINITY when NEGATIVE_INFINITY < lower <= upper == POSITIVE_INFINITY:
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Fri May 12 17:02:53 GMT 2023 - 29.9K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/ImmutableSortedSet.java
* When multiple elements are equivalent according to {@code compareTo()}, only the first one * specified is included. To create a copy of a {@code SortedSet} that preserves the comparator, * call {@link #copyOfSorted} instead. This method iterates over {@code elements} at most once. * * <p>Note that if {@code s} is a {@code Set<String>}, then {@code ImmutableSortedSet.copyOf(s)}
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Apr 01 16:15:01 GMT 2024 - 36.7K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/Monitor.java
* without the guard being satisfied (due to timeout, but not interrupt) can then immediately exit * the monitor without signalling. If it timed out without being signalled, it does not need to * "pass on" the signal to another thread. If it *was* signalled, then its guard must have been * satisfied at the time of signal, and has since been modified by some other thread to be
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) -
android/guava/src/com/google/common/base/Ascii.java
/** * File Separator: These four information separators may be used within data in optional fashion, * except that their hierarchical relationship shall be: FS is the most inclusive, then GS, then * RS, and US is least inclusive. (The content and length of a File, Group, Record, or Unit are * not specified.) * * @since 8.0 */ public static final byte FS = 28; /**
Java - Registered: Fri Apr 26 12:43:10 GMT 2024 - Last Modified: Mon Jul 19 15:43:07 GMT 2021 - 21.6K bytes - Viewed (0) -
android/guava/src/com/google/common/util/concurrent/CycleDetectingLockFactory.java
* <strong>Performance</strong>). * * <p><strong>Cycle Detection</strong> * * <p>Deadlocks can arise when locks are acquired in an order that forms a cycle. In a simple * example involving two locks and two threads, deadlock occurs when one thread acquires Lock A, and * then Lock B, while another thread acquires Lock B, and then Lock A: * * <pre> * Thread1: acquire(LockA) --X acquire(LockB) * Thread2: acquire(LockB) --X acquire(LockA)
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/math/LongMath.java
* can narrow the possible floor(log10(x)) values to two. For example, if floor(log2(x)) is 6, * then 64 <= x < 128, so floor(log10(x)) is either 1 or 2. */ int y = maxLog10ForLeadingZeros[Long.numberOfLeadingZeros(x)]; /* * y is the higher of the two possible values of floor(log10(x)). If x < 10^y, then we want the * lower of the two possible values, or y - 1, otherwise, we want y. */
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)